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
2011Input-Thrifty Extrema Testing.Kuan-Chieh Robert Tseng, David G. Kirkpatrick
2011A New Algorithm for the Characteristic String Problem under Loose Similarity Criteria.Yoshifumi Sakai
2011Hamiltonian Paths in the Square of a Tree.Jakub Radoszewski, Wojciech Rytter
2011An Index Structure for Spaced Seed Search.Taku Onodera, Tetsuo Shibuya
2011A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space.Masatora Ogata, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2011Improved Collaborative Filtering.Aviv Nisgav, Boaz Patt-Shamir
2011External Memory Orthogonal Range Reporting with Fast Updates.Yakov Nekrich
2011A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time.Yakov Nekrich
2011Space-Efficient Data-Analysis Queries on Grids.Gonzalo Navarro, Lus M. S. Russo
2011Asymptotic Modularity of Some Graph Classes.Fabien de Montgolfier, Mauricio Soto, Laurent Viennot
2011A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments.Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2011Recognizing Polar Planar Graphs Using New Results for Monopolarity.Van Bang Le, Ragnar Nevries
2011Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization - (Extended Abstract).Jrg Lssig, Dirk Sudholt
2011Minimizing Interference in Ad-Hoc Networks with Bounded Communication Radius.Matias Korman
2011Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k, 2)-Subgraph.M. Reza Khani, Mohammad R. Salavatipour
2011Capacitated Domination: Constant Factor Approximations for Planar Graphs.Mong-Jen Kao, D. T. Lee
2011Robustness of Minimum Cost Arborescences.Naoyuki Kamiyama
2011Computing Knapsack Solutions with Cardinality Robustness.Naonori Kakimura, Kazuhisa Makino, Kento Seimi
2011Lower Bounds for Myopic DPLL Algorithms with a Cut Heuristic.Dmitry Itsykson, Dmitry Sokolov
2011A Nearly-Quadratic Gap between Adaptive and Non-adaptive Property Testers - (Extended Abstract).Jeremy Hurwitz
2011Fixed-Parameter Complexity of Feedback Vertex Set in Bipartite Tournaments.Sheng-Ying Hsiao
2011Succinct Indexes for Circular Patterns.Wing-Kai Hon, Chen-Hua Lu, Rahul Shah, Sharma V. Thankachan
2011Path Queries in Weighted Trees.Meng He, J. Ian Munro, Gelin Zhou
2011Dynamic Range Selection in Linear Space.Meng He, J. Ian Munro, Patrick K. Nicholson
2011Max-Throughput for (Conservative) k-of-n Testing.Lisa Hellerstein, zgr zkan, Linda Sellie
926950 of 2,287← PreviousNext →

Comparable venues

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