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
2000Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets.Hiro Ito, Yuichiro Itatsu, Hideyuki Uehara, Mitsuo Yokoyama, Motoyasu Ito
2000Simultaneous Augmentation of Two Graphs to anToshimasa Ishii, Hiroshi Nagamochi
2000A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors.Jingui Huang, Jianer Chen, Songqiao Chen
2000Reasoning with Ordered Binary Decision Diagrams.Takashi Horiyama, Toshihide Ibaraki
2000Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers.Wing-Kai Hon, Ming-Yang Kao, Tak Wah Lam
2000An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs.Seok-Hee Hong, Peter Eades
2000Simple Algorithms for a Weighted Interval Selection Problem.Thomas Erlebach, Frits C. R. Spieksma
2000A 2-Approximation Algorithm for Path Coloring on Trees of Rings.Xiaotie Deng, Yi Zhou, Guojun Li, Wenan Zang
2000coping with Delays and Time-Outs in Binary Search Procedures.Ferdinando Cicalese, Ugo Vaccaro
2000Some Formal Analysis of Roccio's Similarity-Based Relvance Feedback Algorithm.Zhixiang Chen, Binhai Zhu
2000An Intuitive and Effective New Representation for Interconnection Network Structures.Jianer Chen, Lihua Liu, Songqiao Chen, Weijia Jia
2000Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets.Yuyu Chen, Ming-Yang Kao, Hsueh-I Lu
2000On Approximating Minimum Vertex Cover for Graphs with Perfect Matching.Jianer Chen, Iyad A. Kanj
2000Optimal Beam Penetrations in Two and Three Dimensions.Danny Z. Chen, Xiaobo Hu, Jinhui Xu
2000Optimal Polygon Cover Problems and Applcations.Danny Z. Chen, Xiaobo Hu, Xiaodong Wu
2000Essentially Every Unimodular Matrix Defines and Expander.Jin-yi Cai
2000Online Routing in Convex Subdivisions.Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro Lpez-Ortiz
2000An Improved Algorithm for Subdivision Traversal without Extra Storage.Prosenjit Bose, Pat Morin
2000Strategies for Hotlink Assignments.Prosenjit Bose, Evangelos Kranakis, Danny Krizanc, Miguel Vargas Martin, Jurek Czyzowicz, Andrzej Pelc, Leszek Gasieniec
2000Voronoi-Based Systems of Coordinates and Surface Reconstruction.Jean-Daniel Boissonnat
2000Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits.Takao Asano, Magns M. Halldrsson, Kazuo Iwama, Takeshi Matsuda
1999Efficient Approximation Algorithms for Multi-label Map Labeling.Binhai Zhu, Chung Keung Poon
1999Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts.Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
1999Reverse Center Location Problem.Jianzhong Zhang, Xiaoguang Yang, Mao-cheng Cai
1999Approximating Multicast Congestion.Santosh S. Vempala, Berthold Vcking
1,8511,875 of 2,287← PreviousNext →

Comparable venues

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