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
2012Weak Visibility Queries of Line Segments in Simple Polygons.Danny Z. Chen, Haitao Wang
2012Optimal Point Movement for Covering Circular Regions.Danny Z. Chen, Xuehou Tan, Haitao Wang, Gangshan Wu
2012On the Hyperbolicity of Small-World and Tree-Like Random Graphs.Wei Chen, Wenjie Fang, Guangda Hu, Michael W. Mahoney
2012Strong Conflict-Free Coloring for Intervals.Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky
2012Combinatorial Geometry and Approximation Algorithms.Timothy M. Chan
2012Speeding Up Shortest Path Algorithms.Andrej Brodnik, Marko Grgurovic
2012Finger Search in the Implicit Model.Gerth Stlting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen
2012Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs.Andreas Brandstdt, Arne Leitert, Dieter Rautenbach
2012Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights.Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song
2012Interval Scheduling and Colorful Independent Sets.Ren van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller
2012Induced Immersions.Rmy Belmonte, Pim van 't Hof, Marcin Kaminski
2012Green Scheduling, Flows and Matchings.Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli
2012Area Bounds of Rectilinear Polygons Realized by Angle Sequences.Sang Won Bae, Yoshio Okamoto, Chan-Su Shin
2012The Minimum Vulnerability Problem.Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh
2012Universal Point Subsets for Planar Graphs.Patrizio Angelini, Carla Binucci, William S. Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, Yoshio Okamoto
2012On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree.Tatsuya Akutsu, Takeyuki Tamura
2012Computing k-center over Streaming Data for Small k.Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son
2012Rectilinear Covering for Imprecise Input Points - (Extended Abstract).Hee-Kap Ahn, Sang Won Bae, Shin-ichi Tanigawa
2011Improved Approximation Algorithms for Routing Shop Scheduling.Wei Yu, Guochuan Zhang
2011Finding Maximum Sum Segments in Sequences with Uncertainty.Hung-I Yu, Tien-Ching Lin, D. T. Lee
2011Online Linear Optimization over Permutations.Shota Yasutake, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Masayuki Takeda
2011Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems.Tomoyuki Yamakami
2011Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem.Chunhao Wang, Qian-Ping Gu
2011Algorithm Engineering for Route Planning - An Update -.Dorothea Wagner
2011Broadcasting in Heterogeneous Tree Networks with Uncertainty.Cheng-Hsiao Tsou, Gen-Huey Chen, Ching-Chi Lin
901925 of 2,287← PreviousNext →

Comparable venues

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