International Symposium on Algorithms and Computation

ISAAC

CORE rank

CORE rank (raw)

Fields of research

Theory of Computation

Papers indexed

2,287

1992–2025

Best Theory of Computation conferences

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
2018	Packing Returning Secretaries.	Martin Hoefer, Lisa Wilhelmi
2018	Stabbing Pairwise Intersecting Disks by Five Points.	Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert
2018	Correlation Clustering Generalized.	David F. Gleich, Nate Veldt, Anthony Wirth
2018	Polyline Drawings with Topological Constraints.	Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani
2018	Proving the Turing Universality of Oritatami Co-Transcriptional Folding.	Cody W. Geary, Pierre-tienne Meunier, Nicolas Schabanel, Shinnosuke Seki
2018	Computing Optimal Shortcuts for Networks.	Delia Garijo, Alberto Mrquez, Natalia Rodrguez, Rodrigo I. Silveira
2018	Tree Path Majority Data Structures.	Travis Gagie, Meng He, Gonzalo Navarro
2018	Covering Clients with Types and Budgets.	Dimitris Fotakis, Laurent Gourvs, Claire Mathieu, Abhinav Srivastav
2018	Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm.	Annette M. C. Ficker, Thomas Erlebach, Mats Mihalk, Frits C. R. Spieksma
2018	New Algorithms for Edge Induced Knig-Egervry Subgraph Based on Gallai-Edmonds Decomposition.	Qilong Feng, Guanlan Tan, Senmin Zhu, Bin Fu, Jianxin Wang
2018	Streaming Algorithms for Planar Convex Hulls.	Martin Farach-Colton, Meng Li, Meng-Tsung Tsai
2018	Target Set Selection in Dense Graph Classes.	Pavel Dvork, Dusan Knop, Toms Toufar
2018	The b-Matching Problem in Distance-Hereditary Graphs and Beyond.	Guillaume Ducoffe, Alexandru Popa
2018	The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes.	Guillaume Ducoffe, Alexandru Popa
2018	Planar Maximum Matching: Towards a Parallel Algorithm.	Samir Datta, Raghav Kulkarni, Ashish Kumar, Anish Mukherjee
2018	Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs.	Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski
2018	A Dichotomy Result for Cyclic-Order Traversing Games.	Yen-Ting Chen, Meng-Tsung Tsai, Shi-Chun Tsai
2018	Cluster Editing in Multi-Layer and Temporal Graphs.	Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Such
2018	Extensions of Self-Improving Sorters.	Siu-Wing Cheng, Lie Yan
2018	Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems.	Jian-Jia Chen, Nikhil Bansal, Samarjit Chakraborty, Georg von der Brggen
2018	Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity.	Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff
2018	Multi-Finger Binary Search Trees.	Parinya Chalermsook, Mayank Goswami, Lszl Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2018	Diversity Maximization in Doubling Metrics.	Alfonso Cevallos, Friedrich Eisenbrand, Sarah Morell
2018	On Polynomial Time Constructions of Minimum Height Decision Tree.	Nader H. Bshouty, Waseem Makhoul
2018	Competitive Searching for a Line on a Line Arrangement.	Quirijn W. Bouts, Thom Castermans, Arthur van Goethem, Marc J. van Kreveld, Wouter Meulemans

476–500 of 2,287← Previous Next →

Comparable venues

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