default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th ISAAC 2002: Vancouver, BC, Canada
- Prosenjit Bose
, Pat Morin:
Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings. Lecture Notes in Computer Science 2518, Springer 2002, ISBN 3-540-00142-5 - Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich:
Biased Skip Lists. 1-13 - Kunihiko Sadakane:
Space-Efficient Data Structures for Flexible Text Retrieval Systems. 14-24 - John Iacono:
Key Independent Optimality. 25-31 - Seth Pettie:
On the Comparison-Addition Complexity of All-Pairs Shortest Paths. 32-43 - Rodica Boliac, Vadim V. Lozin:
On the Clique-Width of Graphs in Hereditary Classes. 44-54 - Martin Dietzfelbinger:
The Probability of a Rendezvous is Minimal in Complete Graphs. 55-66 - Jin-yi Cai:
On the Minimum Volume of a Perturbed Unit Cube. 67-78 - Sumanta Guha, Paula Josiah, Anoop Mittal, Son Dinh Tran:
Non-Delaunay-Based Curve Reconstruction. 79-90 - Marc J. van Kreveld, Bettina Speckmann:
Cutting a Country for Smallest Square Fit. 91-102 - Zhe Dang, Oscar H. Ibarra, Zhi-Wei Sun:
On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter. 103-114 - Hirotada Kobayashi, Keiji Matsumoto:
Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement. 115-127 - Qi Cheng:
Some Remarks on the L-Conjecture. 128-136 - Thomas Wolle:
A Framework for Network Reliability Problems on Graphs of Bounded Treewidth. 137-149 - Anna Galluccio, Guido Proietti:
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation. 150-162 - Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le:
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems. 163-174 - Klaus Jansen, Roberto Solis-Oba:
An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering. 175-186 - Markus Bläser, Bodo Manthey:
Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint. 187-198 - Yoshiyuki Karuno, Hiroshi Nagamochi:
A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage. 199-210 - John Iacono, Stefan Langerman:
Queaps. 211-218 - Gerth Stølting Brodal, Rolf Fagerberg:
Funnel Heap - A Cache Oblivious Priority Queue. 219-228 - Jason D. Hartline, Edwin S. Hong, Alexander E. Mohr, William R. Pentney, Emily Rocke:
Characterizing History Independent Data Structures. 229-240 - Venkatesh Raman, Saket Saurabh, C. R. Subramanian:
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. 241-248 - Ulrike Stege, Iris van Rooij, Alexander Hertel, Philipp Hertel:
An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover. 249-261 - Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs. 262-273 - Hee-Kap Ahn, Otfried Cheong, René van Oostrum:
Casting a Polyhedron with Directional Uncertainty. 274-285 - Siu-Wing Cheng, Tamal K. Dey, Sheung-Hung Poon:
Hierarchy of Surface Models and Irreducible Triangulation. 286-295 - Boting Yang, Cao An Wang, Francis Y. L. Chin:
Algorithms and Complexity for Tetrahedralization Detections. 296-307 - Chun-Hsi Huang, Xin He:
Average-Case Communication-Optimal Parallel Parenthesis Matching. 308-319 - Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks. 320-331 - Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
New Results for Energy-Efficient Broadcasting in Wireless Networks. 332-343 - Ryo Kato, Keiko Imai, Takao Asano:
An Improved Algorithm for the Minimum Manhattan Network Problem. 344-356 - Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
Approximate Distance Oracles Revisited. 357-368 - Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark H. Overmars, Michael A. Soss, Ileana Streinu, Godfried T. Toussaint:
Flat-State Connectivity of Linkages under Dihedral Motions. 369-380 - Alexander Grigoriev, Gerhard J. Woeginger:
Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms. 381-390 - Evripidis Bampis, Massimiliano Caramia, Jirí Fiala, Aleksei V. Fishkin, Antonio Iovanella:
Scheduling of Independent Dedicated Multiprocessor Tasks. 391-402 - Antonio Miranda, Luz Torres, Jianer Chen:
On the Approximability of Multiprocessor Task Scheduling Problems. 403-415 - Therese Biedl, Dana F. Wilkinson:
Bounded-Degree Independent Sets in Planar Graphs. 416-427 - Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki:
Minimum Edge Ranking Spanning Trees of Threshold Graphs. 428-440 - Hiro Ito, Hiroshi Nagamochi, Yosuke Sugiyama, Masato Fujita:
File Transfer Tree Problems. 441-452 - Vikraman Arvind, Venkatesh Raman:
Approximation Algorithms for Some Parameterized Counting Problems. 453-464 - Adi Avidor, Uri Zwick:
Approximating MIN k-SAT. 465-475 - Hiroshi Fujiwara, Kazuo Iwama:
Average-Case Competitive Analyses for Ski-Rental Problems. 476-488 - Christoph Ambühl, Uli Wagner:
On the Clique Problem in Intersection Graphs of Ellipses. 489-500 - Andrzej Lingas:
A Geometric Approach to Boolean Matrix Multiplication. 501-510 - Evanthia Papadopoulou, D. T. Lee:
The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing. 511-522 - Rezaul Alam Chowdhury, Vijaya Ramachandran:
Improved Distance Oracles for Avoiding Link-Failure. 523-534 - Tomasz Jurdzinski, Grzegorz Stachowiak:
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks. 535-549 - Vivek Shikaripura, Ajay D. Kshemkalyani:
A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm. 550-562 - Christoph Buchheim, Seok-Hee Hong:
Crossing Minimization for Symmetries. 563-574 - Cesim Erten, Stephen G. Kobourov:
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid. 575-587 - Paul M. B. Vitányi:
Meaningful Information. 588-599 - Tuomas Sandholm, Subhash Suri:
Market Clearing with Supply and Demand Curves. 600-611 - Takehiro Ito, Xiao Zhou, Takao Nishizeki:
Partitioning Trees of Supply and Demand. 612-623 - Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel:
Maximizing a Voronoi Region: The Convex Case. 624-634 - Luc Devroye:
Random Tries. 635 - Nicholas Pippenger:
Expected Acceptance Counts for Finite Automata with Almost Uniform Input. 636-646 - János Pach, Géza Tóth:
Monotone Drawings of Planar Graphs. 647-654
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-26 00:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
