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
2009Good Programming in Transactional Memory.Raphael Eidenbenz, Roger Wattenhofer
2009New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body.Adrian Dumitrescu, Csaba D. Tth
2009Strong Robustness of Randomized Rumor Spreading Protocols.Benjamin Doerr, Anna Huber, Ariel Levavi
2009I/O and Space-Efficient Path Traversal in Planar Graphs.Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh
2009Folding a Better Checkerboard.Erik D. Demaine, Martin L. Demaine, Goran Konjevod, Robert J. Lang
2009New Results on Simple Stochastic Games.Decheng Dai, Rong Ge
2009Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs.Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska
2009Range Non-overlapping Indexing.Hagai Cohen, Ely Porat
2009Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm.Francisco Claude, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro Lpez-Ortiz, Alejandro Salinger
2009Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes.Jinhee Chun, Ryosei Kasai, Matias Korman, Takeshi Tokuyama
2009Maintaining Nets and Net Trees under Incremental Motion.Minkyoung Cho, David M. Mount, Eunhui Park
20091-Bounded Space Algorithms for 2-Dimensional Bin Packing.Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang
2009Frchet Distance Problems in Weighted Regions.Yam Ki Cheung, Ovidiu Daescu
2009Locating an Obnoxious Line among Planar Objects.Danny Z. Chen, Haitao Wang
2009Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers.Danny Z. Chen, Haitao Wang
2009Approximating Points by a Piecewise Linear Function: I.Danny Z. Chen, Haitao Wang
2009Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria.Xi Chen, Shang-Hua Teng
2009Reconstructing Numbers from Pairwise Function Values.Shiteng Chen, Zhiyi Huang, Sampath Kannan
2009Linear and Sublinear Time Algorithms for Basis of Abelian Groups.Li Chen, Bin Fu
2009A Combinatorial Algorithm for Horn Programs.R. Chandrasekaran, K. Subramani
2009Computing Multidimensional Persistence.Gunnar E. Carlsson, Gurjeet Singh, Afra Zomorodian
2009Algorithmic Folding Complexity.Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara
2009Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms.Laurent Bulteau, Guillaume Fertin, Irena Rusu
2009A Certifying Algorithm for 3-Colorability ofDaniel Bruce, Chnh T. Hong, Joe Sawada
2009Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time.Gerth Stlting Brodal, Alexis C. Kaporis, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas
1,1511,175 of 2,287← PreviousNext →

Comparable venues

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