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
Most published authors
ISAAC papers
2,287 records sourced from DBLP. Search titles, filter by year, sort by recency.
| Year | Title | Authors |
|---|---|---|
| 2010 | Quantum Counterfeit Coin Problems. | Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama |
| 2010 | Minimum Cost Partitions of Trees with Supply and Demand. | Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki |
| 2010 | Computing the ( | Sun-Yuan Hsieh, Chun-An Chen |
| 2010 | Induced Subgraph Isomorphism on Interval and Proper Interval Graphs. | Pinar Heggernes, Daniel Meister, Yngve Villanger |
| 2010 | The ( | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
| 2010 | Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles. | Thomas Dueholm Hansen, Uri Zwick |
| 2010 | Testing Simultaneous Planarity When the Common Graph Is 2-Connected. | Bernhard Haeupler, Krishnam Raju Jampani, Anna Lubiw |
| 2010 | Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. | Qian-Ping Gu, Hisao Tamaki |
| 2010 | Spanning Ratio and Maximum Detour of Rectilinear Paths in the | Ansgar Grne, Tien-Ching Lin, Teng-Kai Yu, Rolf Klein, Elmar Langetepe, D. T. Lee, Sheung-Hung Poon |
| 2010 | Priority Range Trees. | Michael T. Goodrich, Darren Strash |
| 2010 | Computing Sparse Multiples of Polynomials. | Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak |
| 2010 | Drawing a Tree as a Minimum Spanning Tree Approximation. | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer |
| 2010 | Algorithmic Aspects of Secure Computation and Communication. | Matt Franklin |
| 2010 | Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity. | Hugo Fre, Emmanuel Hainry, Mathieu Hoyrup, Romain Pchoux |
| 2010 | Entropy-Bounded Representation of Point Grids. | Arash Farzan, Travis Gagie, Gonzalo Navarro |
| 2010 | Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. | David Eppstein, Maarten Lffler, Darren Strash |
| 2010 | Regular Labelings and Geometric Structures. | David Eppstein |
| 2010 | Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs. | Amr Elmasry |
| 2010 | Fractal Parallelism: Solving SAT in Bounded Space and Time. | Denys Duchier, Jrme Durand-Lose, Maxime Senot |
| 2010 | On Greedy Algorithms for Decision Trees. | Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro |
| 2010 | Anonymous Fuzzy Identity-Based Encryption for Similarity Search. | David W. Cheung, Nikos Mamoulis, Wai Kit Wong, Siu-Ming Yiu, Ye Zhang |
| 2010 | Identifying Approximate Palindromes in Run-Length Encoded Strings. | Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao |
| 2010 | Approximating the Average Stretch Factor of Geometric Graphs. | Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel H. M. Smid |
| 2010 | Approximate Shortest Homotopic Paths in Weighted Regions. | Siu-Wing Cheng, Jiongxin Jin, Antoine Vigneron, Yajun Wang |
| 2010 | Connectivity Graphs of Uncertainty Regions. | Erin W. Chambers, Alejandro Erickson, Sndor P. Fekete, Jonathan Lenchner, Jeff Sember, Srinivasan Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides |
1,026–1,050 of 2,287← PreviousNext →
Comparable venues
Other A*/A conferences filed under the same field of research.
- A*SODAACM/SIAM Symposium on Discrete Algorithms
- A*ICALPInternational Colloquium on Automata Languages and Programming
- A*STOCACM Symposium on Theory of Computing
- A*FOCSIEEE Symposium on Foundations of Computer Science
- AESAEuropean Symposium on Algorithms
- ASTACSInternational Symposium on Theoretical Aspects of Computer Science
- A*LICSIEEE Symposium on Logic in Computer Science
- AGDGraph Drawing