ISAAC (1)

Keyphrases

Publications

2010

Bingbing Zhuang, Hiroshi Nagamochi
Generating Trees on Multisets. ISAAC (1) (2010)
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo
Levelwise Mesh Sparsification for Shortest Path Queries. ISAAC (1) (2010)
Dirk Sudholt, Christine Zarges
Analysis of an Iterated Local Search Algorithm for Vertex Coloring. ISAAC (1) (2010)
Denys Duchier, Jérôme Durand-Lose, Maxime Senot
Fractal Parallelism: Solving SAT in Bounded Space and Time. ISAAC (1) (2010)
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
Popularity at Minimum Cost. ISAAC (1) (2010)
Jinhui Xu, Lei Xu, Yulai Xie
Approximating Minimum Bending Energy Path in a Simple Corridor. ISAAC (1) (2010)
Matt Franklin
Algorithmic Aspects of Secure Computation and Communication. ISAAC (1) (2010)
Kazuyuki Amano
New Upper Bounds on the Average PTF Density of Boolean Functions. ISAAC (1) (2010)
Jozef Jirásek, Pavel Klavík
Structural and Complexity Aspects of Line Systems of Graphs. ISAAC (1) (2010)
Vincent Limouzy
Seidel Minor, Permutation Graphs and Combinatorial Properties. ISAAC (1) (2010)
Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel H. M. Smid
Approximating the Average Stretch Factor of Geometric Graphs. ISAAC (1) (2010)
Paz Carmi, Michiel H. M. Smid
An Optimal Algorithm for Computing Angle-Constrained Spanners. ISAAC (1) (2010)
Piotr Berman, Marek Karpinski, Alexander Zelikovsky
A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2. ISAAC (1) (2010)
Angsheng Li, Peng Zhang
Unbalanced Graph Partitioning. ISAAC (1) (2010)
Andrej Brodnik, John Iacono
Unit-Time Predecessor Queries on Massive Data Sets. ISAAC (1) (2010)
Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Ioannis Milis
Bounded Max-colorings of Graphs. ISAAC (1) (2010)
Prosenjit Bose, Karim Douïeb
Should Static Search Trees Ever Be Unbalanced? ISAAC (1) (2010)
André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller
On Tractable Cases of Target Set Selection. ISAAC (1) (2010)
Krishnam Raju Jampani, Anna Lubiw
Simultaneous Interval Graphs. ISAAC (1) (2010)
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. ISAAC (1) (2010)
Marek Karpinski, Warren Schudy
Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament. ISAAC (1) (2010)
Michael T. Goodrich, Darren Strash
Priority Range Trees. ISAAC (1) (2010)
Thomas Dueholm Hansen, Uri Zwick
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles. ISAAC (1) (2010)
Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity. ISAAC (1) (2010)
Joachim Spoerhase
An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems. ISAAC (1) (2010)
David W. Cheung, Nikos Mamoulis, Wai Kit Wong, Siu-Ming Yiu, Ye Zhang
Anonymous Fuzzy Identity-Based Encryption for Similarity Search. ISAAC (1) (2010)
Hongyu Liang, Jing He
Satisfiability with Index Dependency. ISAAC (1) (2010)
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama
Quantum Counterfeit Coin Problems. ISAAC (1) (2010)
David Eppstein, Maarten Löffler, Darren Strash
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. ISAAC (1) (2010)
David Eppstein
Regular Labelings and Geometric Structures. ISAAC (1) (2010)
George B. Mertzios, Shmuel Zaks
On the Intersection of Tolerance and Cocomparability Graphs. ISAAC (1) (2010)
Maxim A. Babenko
A Faster Algorithm for the Maximum Even Factor Problem. ISAAC (1) (2010)
Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki
Improved Randomized Algorithms for 3-SAT. ISAAC (1) (2010)
Ljiljana Brankovic, Henning Fernau
Combining Two Worlds: Parameterised Approximation for Vertex Cover. ISAAC (1) (2010)
Akiyoshi Shioura
Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra. ISAAC (1) (2010)
Jin-yi Cai, Sangxia Huang, Pinyan Lu
Problems. ISAAC (1) (2010)
Amihood Amir, Estrella Eisenberg, Avivit Levy
Approximate Periodicity. ISAAC (1) (2010)
Abhijin Adiga, Rajesh Hemant Chitnis, Saket Saurabh
Parameterized Algorithms for Boxicity. ISAAC (1) (2010)
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
Computing Sparse Multiples of Polynomials. ISAAC (1) (2010)
Erin W. Chambers, David Eppstein
Flows in One-Crossing-Minor-Free Graphs. ISAAC (1) (2010)

volume 6506, 2010

Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I ISAAC (1) 6506 (2010)