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 |
|---|---|---|
| 2009 | Counting in the Presence of Memory Faults. | Gerth Stlting Brodal, Allan Grnlund Jrgensen, Gabriel Moruz, Thomas Mlhave |
| 2009 | Data Structures for Range Median Queries. | Gerth Stlting Brodal, Allan Grnlund Jrgensen |
| 2009 | Online Sorted Range Reporting. | Gerth Stlting Brodal, Rolf Fagerberg, Mark Greve, Alejandro Lpez-Ortiz |
| 2009 | Exact Algorithms for Dominating Clique Problems. | Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos |
| 2009 | Finding Fullerene Patches in Polynomial Time. | Paul S. Bonsma, Felix Breuer |
| 2009 | On the Advice Complexity of Online Problems. | Hans-Joachim Bckenhauer, Dennis Komm, Rastislav Krlovic, Richard Krlovic, Tobias Mmke |
| 2009 | Reconstructing Polygons from Scanner Data. | Therese Biedl, Stephane Durocher, Jack Snoeyink |
| 2009 | The Identity Correspondence Problem and Its Applications. | Paul Bell, Igor Potapov |
| 2009 | Covering a Graph with a Constrained Forest (Extended Abstract). | Cristina Bazgan, Basile Coutoux, Zsolt Tuza |
| 2009 | Online Maximum Directed Cut. | Amotz Bar-Noy, Michael Lampis |
| 2009 | A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability. | Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prdel, Maxim Sviridenko |
| 2009 | Querying Two Boundary Points for Shortest Paths in a Polygonal Domain. | Sang Won Bae, Yoshio Okamoto |
| 2009 | Exact Algorithms for the Bottleneck Steiner Tree Problem. | Sang Won Bae, Sunghee Choi, Chunseok Lee, Shin-ichi Tanigawa |
| 2009 | On Lower Bounds for Constant Width Arithmetic Circuits. | Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan |
| 2009 | Untangled Monotonic Chains and Adaptive Range Search. | Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro Lpez-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala |
| 2009 | I/O-Efficient Contour Tree Simplification. | Lars Arge, Morten Revsbk |
| 2009 | Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity. | Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy |
| 2009 | The Complexity of Solving Stochastic Games on Graphs. | Daniel Andersson, Peter Bro Miltersen |
| 2009 | Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. | Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers |
| 2009 | Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs. | Marwan Al-Jubeh, Mashhood Ishaque, Kristf Rdei, Diane L. Souvaine, Csaba D. Tth |
| 2009 | Distributed Scheduling of Parallel Hybrid Computations. | Shivali Agarwal, Ankur Narang, R. K. Shyamasundar |
| 2009 | PTAS for | Anna Adamaszek, Artur Czumaj, Andrzej Lingas |
| 2008 | The Isolation Game: A Game of Distances. | Yingchao Zhao, Wei Chen, Shang-Hua Teng |
| 2008 | An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts. | Mingyu Xiao |
| 2008 | Computing the Maximum Detour of a Plane Graph in Subquadratic Time. | Christian Wulff-Nilsen |
1,176–1,200 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