Skip to content

International Symposium on Algorithms and Computation

ISAAC

B

CORE rank

CORE rank (raw)

B

Fields of research

Theory of Computation

Papers indexed

2,287

1992–2025

Papers per year

1992122 peak2025

ISAAC papers

2,287 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2009Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks.Minming Li, Peng-Jun Wan, F. Frances Yao
2009Minimum Cycle Bases of Weighted Outerplanar Graphs.Tsung-Hao Liu, Hsueh-I Lu
2009Optimal Randomized Algorithm for the Density Selection Problem.Tien-Ching Lin, D. T. Lee
2009On Protein Structure Alignment under Distance Constraint.Shuai Cheng Li, Yen Kaow Ng
2009Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics.Minming Li
2009Online paging for flash memory devices.Annamria Kovcs, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu
2009On Shortest Disjoint Paths in Planar Graphs.Yusuke Kobayashi, Christian Sommer
2009The Directed Hausdorff Distance between Imprecise Point Sets.Christian Knauer, Maarten Lffler, Marc Scherfenberg, Thomas Wolle
2009Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model.Jin Wook Kim, Siwon Choi, Joong Chae Na, Jeong Seop Sim
2009Generalized Reduction to Compute Toric Ideals.Deepanjan Kesh, Shashank K. Mehta
2009Electric Routing and Concurrent Flow Cutting.Jonathan A. Kelner, Petar Maymounkov
2009Popular Matchings with Variable Job Capacities.Telikepalli Kavitha, Meghana Nasre
2009Max-Coloring Paths: Tight Bounds and Extensions.Telikepalli Kavitha, Julin Mestre
2009On the Infinitesimal Rigidity of Bar-and-Slider Frameworks.Naoki Katoh, Shin-ichi Tanigawa
2009A Proof of the Molecular Conjecture.Naoki Katoh
2009The Complexity of Perfect Matching Problems on Dense Hypergraphs.Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
2009General Pseudo-random Generators from Weaker Models of Computation.George Karakostas
2009Geodesic Spanners on Polyhedral Surfaces.Sanjiv Kapoor, Xiang-Yang Li
2009A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths.Naoyuki Kamiyama, Naoki Katoh
2009Inapproximability of Maximal Strip Recovery.Minghui Jiang
2009A Self-stabilizing and Local Delaunay Graph Construction.Riko Jacob, Stephan Ritscher, Christian Scheideler, Stefan Schmid
2009Computational Complexity of Cast Puzzles.Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita
2009Route-Enabling Graph Orientation Problems.Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
2009Parameterizing Cut Sets in a Graph by the Number of Their Components.Takehiro Ito, Marcin Kaminski, Danil Paulusma, Dimitrios M. Thilikos
2009Posi-modular Systems with Modulotone Requirements under Permutation Constraints.Toshimasa Ishii, Kazuhisa Makino
1,1011,125 of 2,287← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.