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
2012Beyond Homothetic Polygons: Recognition and Maximum Clique.Konstanty Junosza-Szaniawski, Jan Kratochvl, Martin Pergel, Pawel Rzazewski
2012A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks.Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2012Reconfiguration of List L(2, 1)-Labelings in a Graph.Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou
2012The Canadian Traveller Problem Revisited.Yamming Huang, Chung-Shou Liao
2012Future Directions in Computer Science Research.John E. Hopcroft
2012Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph.Danny Hermelin, Romeo Rizzi, Stphane Vialette
2012A Space-Efficient Framework for Dynamic Point Location.Meng He, Patrick K. Nicholson, Norbert Zeh
2012A Framework for Succinct Labeled Ordinal Trees over Large Alphabets.Meng He, J. Ian Munro, Gelin Zhou
2012Counting Partitions of Graphs.Pavol Hell, Miki Hermann, Mayssam Mohammadi Nevisi
2012Fast and Simple Fully-Dynamic Cut Tree Construction.Tanja Hartmann, Dorothea Wagner
2012Cubic Augmentation of Planar Graphs.Tanja Hartmann, Jonathan Rollin, Ignaz Rutter
2012Kernelization and Parameterized Complexity of Star Editing and Union Editing.Jiong Guo, Yash Raj Shrestha
2012Closing Complexity Gaps for Coloring Problems on H-Free Graphs.Petr A. Golovach, Danil Paulusma, Jian Song
2012Detecting Induced Minors in AT-Free Graphs.Petr A. Golovach, Dieter Kratsch, Danil Paulusma
2012Precision vs Confidence Tradeoffs for ℓ2-Based Frequency Estimation in Data Streams.Sumit Ganguly
2012A Time-Efficient Output-Sensitive Quantum Algorithm for Boolean Matrix Multiplication.Franois Le Gall
2012A Strongly Polynomial Time Algorithm for the Shortest Path Problem on Coherent Planar Periodic Graphs.Norie Fu
2012Parameterized Clique on Scale-Free Networks.Tobias Friedrich, Anton Krohmer
2012On the Number of Upward Planar Orientations of Maximal Planar Graphs.Fabrizio Frati, Joachim Gudmundsson, Emo Welzl
2012More on a Problem of Zarankiewicz.Chinmoy Dutta, Jaikumar Radhakrishnan
2012Robust Nonparametric Data Approximation of Point Sets via Data Reduction.Stephane Durocher, Alexandre Leblanc, Jason Morrison, Matthew Skala
2012On the Advice Complexity of Buffer Management.Reza Dorrigiv, Meng He, Norbert Zeh
2012Degree-Constrained Orientations of Embedded Graphs.Yann Disser, Jannik Matuschke
2012Revenue Maximization in a Bayesian Double Auction Market.Xiaotie Deng, Paul W. Goldberg, Bo Tang, Jinshan Zhang
2012Origami Robots and Star Trek Replicators.Erik D. Demaine
876900 of 2,287← PreviousNext →

Comparable venues

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