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
2004Pareto Optimality in House Allocation Problems.David J. Abraham, Katarna Cechlrov, David F. Manlove, Kurt Mehlhorn
2003Quasi-optimal Arithmetic for Quaternion Polynomials.Martin Ziegler
2003Online Scheduling of Parallel Jobs with Dependencies on 2-Dimensional Meshes.Deshi Ye, Guochuan Zhang
2003Interactive Proofs for Quantum Computation.Andrew Chi-Chih Yao
2003A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem.Hiroaki Yamamoto
2003Computational Complexity Measures of Multipartite Quantum Entanglement.Tomoyuki Yamakami
2003Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees.Atsuko Yamaguchi, Hiroshi Mamitsuka
2003Segmenting Doughnut-Shaped Objects in Medical Images.Xiaodong Wu
2003A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle Graphs.Gabriel Valiente
2003A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs.Torsten Tholey
2003Enumerating Global Roundings of an Outerplanar Graph.Nadia Takki-Chebihi, Takeshi Tokuyama
2003Limiting Negations in Bounded-Depth Circuits: An Extension of Markov's Theorem.Shao Chin Sung, Keisuke Tanaka
2003Lower Bounds on Correction Networks.Grzegorz Stachowiak
2003A Promising Key Agreement Protocol.Eun-Kyung Ryu, Kee-Won Kim, Kee-Young Yoo
2003Fair Cost Allocations under Conflicts - A Game-Theoretic Point of View.Yoshio Okamoto
2003Drawing Plane Graphs.Takao Nishizeki
2003Voronoi Diagram in the Flow Field.Tetsushi Nishida, Kokichi Sugihara
2003Approximate Regular Expression Searching with Arbitrary Integer Weights.Gonzalo Navarro
2003Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem.Hiroshi Nagamochi, Kohei Okada
2003An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas.Hiroshi Nagamochi, Yuusuke Abe
2003Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution.Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani
2003The Intractability of Computing the Hamming Distance.Bodo Manthey, Rdiger Reischuk
2003A Dynamic Dictionary for Priced Information with Application.Anil Maheshwari, Michiel H. M. Smid
2003A Faster Lattice Reduction Method Using Quantum Search.Christoph Ludwig
2003Finding a Length-Constrained Maximum-Density Path in a Tree.Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao
1,6261,650 of 2,287← PreviousNext →

Comparable venues

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