default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st ISAAC 2010: Jeju Island, Korea
- Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park:
Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I. Lecture Notes in Computer Science 6506, Springer 2010, ISBN 978-3-642-17516-9
Invited Talks
- David Eppstein:
Regular Labelings and Geometric Structures. 1 - Matt Franklin:
Algorithmic Aspects of Secure Computation and Communication. 2
Approximation Algorithm I
- Marek Karpinski, Warren Schudy:
Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament. 3-14 - Piotr Berman, Marek Karpinski, Alexander Zelikovsky
:
A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2. 15-24 - Amihood Amir, Estrella Eisenberg, Avivit Levy:
Approximate Periodicity. 25-36 - Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel H. M. Smid:
Approximating the Average Stretch Factor of Geometric Graphs. 37-48
Complexity I
- Hongyu Liang, Jing He:
Satisfiability with Index Dependency. 49-60 - David W. Cheung, Nikos Mamoulis, Wai Kit Wong, Siu-Ming Yiu, Ye Zhang:
Anonymous Fuzzy Identity-Based Encryption for Similarity Search. 61-72 - Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki:
Improved Randomized Algorithms for 3-SAT. 73-84 - Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama:
Quantum Counterfeit Coin Problems. 85-96
Data Structure and Algorithm I
- Michael T. Goodrich, Darren Strash:
Priority Range Trees. 97-108 - Prosenjit Bose, Karim Douïeb:
Should Static Search Trees Ever Be Unbalanced? 109-120 - Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo:
Levelwise Mesh Sparsification for Shortest Path Queries. 121-132 - Andrej Brodnik, John Iacono:
Unit-Time Predecessor Queries on Massive Data Sets. 133-144
Combinatorial Optimization
- Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar:
Popularity at Minimum Cost. 145-156 - Jozef Jirásek, Pavel Klavík:
Structural and Complexity Aspects of Line Systems of Graphs. 157-168 - Akiyoshi Shioura:
Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra. 169-181 - Bingbing Zhuang, Hiroshi Nagamochi:
Generating Trees on Multisets. 182-193
Graph Algorithm I
- Vincent Limouzy:
Seidel Minor, Permutation Graphs and Combinatorial Properties. 194-205 - Krishnam Raju Jampani, Anna Lubiw:
Simultaneous Interval Graphs. 206-217 - Angsheng Li, Peng Zhang:
Unbalanced Graph Partitioning. 218-229 - George B. Mertzios, Shmuel Zaks:
On the Intersection of Tolerance and Cocomparability Graphs. 230-240 - Erin W. Chambers, David Eppstein:
Flows in One-Crossing-Minor-Free Graphs. 241-252
Complexity II
- Jin-yi Cai, Sangxia Huang, Pinyan Lu:
From Holant to #CSP and Back: Dichotomy for Holantc Problems. 253-265 - Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak:
Computing Sparse Multiples of Polynomials. 266-278 - Denys Duchier, Jérôme Durand-Lose, Maxime Senot:
Fractal Parallelism: Solving SAT in Bounded Space and Time. 279-290 - Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux:
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity. 291-303 - Kazuyuki Amano:
New Upper Bounds on the Average PTF Density of Boolean Functions. 304-315
Computational Geometry I
- Paz Carmi, Michiel H. M. Smid:
An Optimal Algorithm for Computing Angle-Constrained Spanners. 316-327 - Jinhui Xu, Lei Xu, Yulai Xie:
Approximating Minimum Bending Energy Path in a Simple Corridor. 328-339
Graph Coloring I
- Dirk Sudholt, Christine Zarges:
Analysis of an Iterated Local Search Algorithm for Vertex Coloring. 340-352 - Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Ioannis Milis:
Bounded Max-colorings of Graphs. 353-365
Fixed Parameter Tractability
- Abhijin Adiga, Rajesh Hemant Chitnis, Saket Saurabh:
Parameterized Algorithms for Boxicity. 366-377 - André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller:
On Tractable Cases of Target Set Selection. 378-389 - Ljiljana Brankovic, Henning Fernau:
Combining Two Worlds: Parameterised Approximation for Vertex Cover. 390-402 - David Eppstein, Maarten Löffler, Darren Strash:
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. 403-414
Optimization
- Thomas Dueholm Hansen, Uri Zwick:
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles. 415-426 - Immanuel M. Bomze, Markus Chimani, Michael Jünger, Ivana Ljubic, Petra Mutzel, Bernd Zey:
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut. 427-439 - Joachim Spoerhase:
An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems. 440-450 - Maxim A. Babenko:
A Faster Algorithm for the Maximum Even Factor Problem. 451-462
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-22 02:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
