Last update:
Fri Apr 5 10:01:37 MDT 2024
Don Coppersmith and
Andrew M. Odlyzko and
Richard Schroeppel Discrete logarithms in $ {\rm GF}(p) $ 1--15
Christopher J. Van Wyk and
Jeffrey Scott Vitter The Complexity of Hashing with Lazy
Deletion . . . . . . . . . . . . . . . . 17--29
Robert Sedgewick and
Jeffrey Scott Vitter Shortest Paths in Euclidean Graphs . . . 31--48
Takao Asano and
Tetsuo Asano and
Leonidas J. Guibas and
John Hershberger and
Hiroshi Imai Visibility of Disjoint Polygons . . . . 49--63
Gianfranco Bilardi and
Franco P. Preparata Area-Time Lower-Bound Techniques with
Applications to Sorting . . . . . . . . 65--91
Herbert Edelsbrunner Edge-Skeletons in Arrangements with
Applications . . . . . . . . . . . . . . 93--109
Michael L. Fredman and
Robert Sedgewick and
Daniel Dominic Sleator and
Robert Endre Tarjan The Pairing Heap: a New Form of
Self-Adjusting Heap . . . . . . . . . . 111--129
Bernard Chazelle and
Leonidas J. Guibas Fractional Cascading: I. A Data
Structuring Technique . . . . . . . . . 133--162
Bernard Chazelle and
Leonidas J. Guibas Fractional cascading. II. Applications 163--191
D. T. Lee and
Y. F. Wu Geometric complexity of some location
problems . . . . . . . . . . . . . . . . 193--211
Kurt Mehlhorn and
Franco P. Preparata and
Majid Sarrafzadeh Channel Routing in Knock-Knee Mode:
Simplified Algorithms and Proofs . . . . 213--221
Shaodi Gao and
Susanne E. Hambrusch Two-Layer Channel Routing with Vertical
Uni-Length Overlap . . . . . . . . . . . 223--232
Richard A. Games Optimal Book Embeddings of the FFT,
Benes, and Barrel Shifter Networks . . . 233--250
Eugene W. Myers An $ O(N D) $ Difference Algorithm and
Its Variations . . . . . . . . . . . . . 251--266
Calton Pu On-the-Fly, Incremental, Consistent
Reading of Entire Databases . . . . . . 271--287
Harry K. T. Wong and
Jianzhong Li and
Frank Olken and
Doron Rotem and
Linda Wong Bit Transposition for Very Large
Scientific and Statistical Databases . . 289--309
Hong-Tai Chou and
David J. DeWitt An Evaluation of Buffer Management
Strategies for Relational Database
Systems . . . . . . . . . . . . . . . . 311--336
Claudia Bauzer Medeiros and
Frank Wm. Tompa Understanding the Implications of View
Update Policies . . . . . . . . . . . . 337--360
Yannis E. Ioannidis A Time Bound on the Materialization of
Some Recursively Defined Views . . . . . 361--385
Nimrod Megiddo Introduction: New Approaches to Linear
Programming . . . . . . . . . . . . . . 387--394
Robert J. Vanderbei and
Marc S. Meketon and
Barry A. Freedman A Modification of Karmarkar's Linear
Programming Algorithm . . . . . . . . . 395--407
Michael J. Todd and
Bruce P. Burrell An Extension of Karmarkar's Algorithm
for Linear Programming Using Dual
Variables . . . . . . . . . . . . . . . 409--424
Guy de Ghellinck and
Jean-Philippe Vial A Polynomial Newton Method for Linear
Programming . . . . . . . . . . . . . . 425--453
Masao Iri and
Hiroshi Imai A Multiplicative Barrier Function Method
for Linear Programming . . . . . . . . . 455--482
Kurt M. Anstreicher A Monotonic Projective Algorithm for
Fractional Linear Programming . . . . . 483--498
Masakazu Kojima Determining Basic Variables of Optimal
Solutions in Karmarkar's New LP
Algorithm . . . . . . . . . . . . . . . 499--515
G. Rinaldi A Projective Method for Linear
Programming with Box-Type Constraints 517--527
J. L. Nazareth Homotopy Techniques in Linear
Programming . . . . . . . . . . . . . . 529--535
C. E. Blair The iterative step in the linear
programming algorithm of N. Karmarkar 537--539
Naoki Katoh and
Tiko Kameda and
Toshihide Ibaraki A Cautious Scheduler for Multistep
Transactions . . . . . . . . . . . . . . 1--26
Colm Ó'Dúnlaing and
Micha Sharir and
Chee K. Yap Generalized Vorono\u\i diagrams for a
ladder. II. Efficient construction of
the diagram . . . . . . . . . . . . . . 27--59
Mark A. Shand Algorithms for Corner Stitched
Data-Structures . . . . . . . . . . . . 61--80
Eitan Zemel A Linear Time Randomizing Algorithm for
Searching Ranked Functions . . . . . . . 81--90
Daniel S. Hirschberg and
Lawrence L. Larmore The Set LCS Problem . . . . . . . . . . 91--95
Scot W. Hornick and
Majid Sarrafzadeh On Problem Transformability in VLSI . . 97--111
Richard M. Karp and
Frank Thomson Leighton and
Ronald L. Rivest and
Clark D. Thompson and
Umesh V. Vazirani and
Vijay V. Vazirani Global Wire Routing in Two-Dimensional
Arrays . . . . . . . . . . . . . . . . . 113--129
Claire Mathieu Some Problems in Computational Geometry 131--134
Bernard Chazelle Editor's Foreword . . . . . . . . . . . 135--136
Rex A. Dwyer A Faster Divide-and-Conquer Algorithm
for Constructing Delaunay Triangulations 137--151
Steven Fortune A Sweepline Algorithm for Vorono\u\i
Diagrams . . . . . . . . . . . . . . . . 153--174
Christos Levcopoulos and
Andrzej Lingas On Approximation Behavior of the Greedy
Triangulation for Convex Polygons . . . 175--193
Alok Aggarwal and
Maria M. Klawe and
Shlomo Moran and
Peter W. Shor and
Robert E. Wilber Geometric Applications of a
Matrix-Searching Algorithm . . . . . . . 195--208
Leonidas J. Guibas and
John Hershberger and
Daniel Leven and
Micha Sharir and
Robert Endre Tarjan Linear-Time Algorithms for Visibility
and Shortest Path Problems Inside
Triangulated Simple Polygons . . . . . . 209--233
Francis Y. Chin and
H. F. Ting An Improved Algorithm for Finding the
Median Distributively . . . . . . . . . 235--249
Pavol \vDuri\vs and
Ondrej Sýkora and
Clark D. Thompson and
Imrich V\vr\softto A minimum-area circuit for $l$-selection 251--265
Jean R. S. Blair and
Sanjiv Kapoor and
Errol L. Lloyd and
Kenneth J. Supowit Minimizing Channel Density in Standard
Cell Layout . . . . . . . . . . . . . . 267--282
Anna R. Karlin and
Howard W. Trickey and
Jeffrey D. Ullman Algorithms for the Compilation of
Regular Expressions into PLAs . . . . . 283--314
Alberto Apostolico and
C. Guerra The Longest Common Subsequence Problem
Revisited . . . . . . . . . . . . . . . 315--336
Bernard Chazelle Computing on a Free Tree via
Complexity-Preserving Mappings . . . . . 337--361
Chee-Keng Yap Preface Special Issue on Robotics . . . 363--365
Shmuel Sifrony and
Micha Sharir A New Efficient Motion-Planning
Algorithm for a Rod in Two-Dimensional
Polygonal Space . . . . . . . . . . . . 367--402
Vladimir J. Lumelsky and
Alexander A. Stepanov Path-Planning Strategies for a Point
Mobile Automaton Moving Amidst Unknown
Obstacles of Arbitrary Shape . . . . . . 403--430
Colm Ó'Dúnlaing Motion Planning with Inertial
Constraints . . . . . . . . . . . . . . 431--475
Michael Erdmann and
Tomás Lozano-Pérez On Multiple Moving Objects . . . . . . . 477--521
Christos H. Papadimitriou and
Ellen B. Silverberg Optimal Piecewise Linear Motion of an
Object Among Obstacles . . . . . . . . . 523--539
B. Mishra and
Jacob T. Schwartz and
Micha Sharir On the Existence and Synthesis of
Multifinger Positive Grips . . . . . . . 541--558
Jeffrey Scott Vitter Editor's Foreword: Special Issue on
Parallel and Distributed Computing, Part
I . . . . . . . . . . . . . . . . . . . 1--3
Jeffrey D. Ullman and
Allen Van Gelder Parallel Complexity of Logical Query
Programs . . . . . . . . . . . . . . . . 5--42
Faith E. Fich and
Prabhakar Ragde and
Avi Wigderson Simulations Among Concurrent-Write PRAMs 43--51
Charles E. Leiserson and
Bruce M. Maggs Communication-Efficient Parallel
Algorithms for Distributed Random-Access
Machines . . . . . . . . . . . . . . . . 53--77
Anna R. Karlin and
Mark S. Manasse and
Larry Rudolph and
Daniel Dominic Sleator Competitive Snoopy Caching . . . . . . . 79--119
Yoram Moses and
Mark R. Tuttle Programming Simultaneous Actions Using
Common Knowledge . . . . . . . . . . . . 121--169
Greg N. Frederickson and
Ravi Janardan Designing Networks with Compact Routing
Tables . . . . . . . . . . . . . . . . . 171--190
Marshall W. Bern Two Probabilistic Results on Rectilinear
Steiner Trees . . . . . . . . . . . . . 191--204
Bernard Chazelle An Algorithm for Segment-Dragging and
Its Implementation . . . . . . . . . . . 205--221
Hyeong-Ah Choi and
S. Louis Hakimi Data Transfers in Networks . . . . . . . 223--245
Jayaram Bhasker and
Sartaj Sahni A Linear Algorithm to Find a Rectangular
Dual of a Planar Triangulated Graph . . 247--278
Chee-Keng Yap Parallel Triangulation of a Polygon in
Two Calls to the Trapezoidal Map . . . . 279--288
Jeffrey Scott Vitter Editor's Foreword: Special Issue on
Parallel and Distributed Computing, Part
II . . . . . . . . . . . . . . . . . . . 289--291
Alok Aggarwal and
Bernard Chazelle and
Leonidas J. Guibas and
Colm Ó'Dúnlaing and
Chee K. Yap Parallel Computational Geometry . . . . 293--327
Richard Cole and
Uzi Vishkin The Accelerated Centroid Decomposition
Technique for Optimal Parallel Tree
Evaluation in Logarithmic Time . . . . . 329--346
Alberto Apostolico and
Costas S. Iliopoulos and
Gad M. Landau and
Baruch Schieber and
Uzi Vishkin Parallel Construction of a Suffix Tree
with Applications . . . . . . . . . . . 347--365
Sape J. Mullender and
Paul M. B. Vitányi Distributed Match-Making . . . . . . . . 367--391
Rivka Ladin and
Barbara Liskov and
Liuba Shrira A Technique for Constructing Highly
Available Services . . . . . . . . . . . 393--420
Paris C. Kanellakis and
Scott A. Smolka On the Analysis of Cooperation and
Antagonism in Networks of Communicating
Processes . . . . . . . . . . . . . . . 421--450
Foto N. Afrati and
Christos H. Papadimitriou and
George Papageorgiou The Synthesis of Communication Protocols 451--472
David P. Dobkin and
Diane L. Souvaine and
Christopher J. Van Wyk Decomposition and Intersection of Simple
Splinegons . . . . . . . . . . . . . . . 473--485
Paul Czerwinski and
Vijaya Ramachandran Optimal VLSI Graph Embeddings in
Variable Aspect Ratio Rectangles . . . . 487--510
Paul A. Peterson and
Michael C. Loui The general maximum matching algorithm
of Micali and Vazirani . . . . . . . . . 511--533
Mikhail J. Atallah and
Michael T. Goodrich Parallel Algorithms for Some Functions
of two Convex Polygons . . . . . . . . . 535--548
Michael R. Fellows and
Donald K. Friesen and
Michael A. Langston On Finding Optimal and Near-Optimal
Lineal Spanning Trees . . . . . . . . . 549--560
John M. Marberg and
Eli Gafni Sorting in Constant Number of Row and
Column Phases on a Mesh . . . . . . . . 561--572
Chee-Keng Yap Editor's Foreword: Special Issue on
Computational Geometry . . . . . . . . . 1--2
David P. Dobkin and
Michael J. Laszlo Primitives for the Manipulation of
Three-Dimensional Subdivisions . . . . . 3--32
Robert L. (Scot) Drysdale III and
Robert B. Jerard and
Barry Schaudt and
Ken Hauck Discrete Simulation of NC Machining . . 33--60
Masato Edahiro and
Katsuhiko Tanaka and
Takashi Hoshino and
Takao Asano A Bucketing Algorithm for the Orthogonal
Segment Intersection Search Problem and
Its Practical Efficiency . . . . . . . . 61--76
Hiroshi Imai and
Kenji Kato and
Peter Yamamoto A Linear-Time Algorithm for Linear $ L_1
$ Approximation of Points . . . . . . . 77--96
L. Paul Chew Constrained Delaunay Triangulations . . 97--108
Boris Aronov On the Geodesic Vorono\u\i Diagram of
Point Sites in a Simple Polygon . . . . 109--140
John Hershberger An Optimal Visibility Graph Algorithm
for Triangulated Simple Polygons . . . . 141--155
Chanderjit L. Bajaj and
Myung Soo Kim Generation of Configuration Space
Obstacles: The Case of Moving Algebraic
Curves . . . . . . . . . . . . . . . . . 157--172
David Fernández-Baca and
Charles U. Martel On the Efficiency of Maximum-Flow
Algorithms on Networks with Small
Integer Capacities . . . . . . . . . . . 173--189
Dana S. Richards Fast Heuristic Algorithms for
Rectilinear Steiner Trees . . . . . . . 191--207
Joseph Y.-T. Leung A new algorithm for scheduling periodic,
real-time tasks . . . . . . . . . . . . 209--219
Mikhail J. Atallah and
S. Rao Kosaraju An Efficient Algorithm for Maxdominance,
with Applications . . . . . . . . . . . 221--236
Shang-Ching Chou and
Jin Gen Yang On the Algebraic Formulation of Certain
Geometry Statements and Mechanical
Geometry Theorem Proving . . . . . . . . 237--262
D. F. Wong and
C. L. Liu Floorplan Design of VLSI Circuits . . . 263--291
Andrew Chi-Chih Yao On selecting the $k$ largest with median
tests . . . . . . . . . . . . . . . . . 293--300
Israel Cidon and
Inder Gopal Editor's Foreword: Special Issue on
Algorithmic Aspects of Communications 301--302
Sergio Verdú Computational Complexity of Optimum
Multiuser Detection . . . . . . . . . . 303--312
Michael Paterakis and
L. Georgiadis and
P. Papantoni-Kazakos A Full Sensing Window Random-Access
Algorithm for Messages with Strict Delay
Constraints . . . . . . . . . . . . . . 313--328
Yaron I. Gold and
Shlomo Moran A Correction Algorithm for Token-Passing
Sequences in Mobile Communication
Networks . . . . . . . . . . . . . . . . 329--341
Jeffrey M. Jaffe and
Zvi Rosberg Maximal Selection in Tandem Networks
with Symmetric Hearing Range . . . . . . 343--364
M. J. Post and
A. S. Kershenbaum and
P. E. Sarachik Scheduling Multihop CDMA Networks in the
Presence of Secondary Conflicts . . . . 365--393
Jonathan L. Wang and
John A. Silvester Optimizing Responses to Broadcast
Messages in Radio Networks . . . . . . . 395--416
Jeffrey M. Jaffe and
Moshe Sidi Distributed Deadlock Resolution in
Store-and-Forward Networks . . . . . . . 417--436
Hagit Attiya and
Jan van Leeuwen and
Nicola Santoro and
Shmuel Zaks Efficient Elections in Chordal Ring
Networks . . . . . . . . . . . . . . . . 437--446
Sanjiv Kapoor and
Prakash V. Ramanan Lower Bounds for Maximal and Convex
Layers Problems . . . . . . . . . . . . 447--459
Kenneth L. Clarkson An Algorithm for Geometric Minimum
Spanning Trees Requiring Nearly Linear
Expected Time . . . . . . . . . . . . . 461--469
Hitoshi Suzuki and
Takao Nishizeki and
Nobuji Saito Algorithms for Multicommodity Flows in
Planar Graphs . . . . . . . . . . . . . 471--501
Daniel S. Hirschberg and
Lawrence L. Larmore The Set-Set LCS Problem . . . . . . . . 503--510
Nimrod Megiddo Extending NC and RNC Algorithms . . . . 511--517
Prakash V. Ramanan and
Kazuhiro Tsuga Average-Case Analysis of the Modified
Harmonic Algorithm . . . . . . . . . . . 519--533
Rolf Klein and
Otto Nurmi and
Thomas Ottmann and
Derick Wood A Dynamic Fixed Windowing Problem . . . 535--550
Michael Luby and
Prabhakar Ragde A Bidirectional Shortest-Path Algorithm
with Good Average-Case Behavior . . . . 551--567
Pravin M. Vaidya Approximate minimum weight matching on
points in $k$-dimensional space . . . . 569--583
Elena Lodi and
Fabrizio Luccio and
Linda Pagli A Preliminary Study of a Diagonal
Channel-Routing Model . . . . . . . . . 585--597
Steven S. Skiena Problems in Geometric Probing . . . . . 599--605
Benny Chor and
Oded Goldreich An Improved Parallel Algorithm for
Integer GCD . . . . . . . . . . . . . . 1--10
Teofilo F. Gonzalez and
Si-Qing Zheng Approximation Algorithms for
Partitioning a Rectangle with Interior
Points . . . . . . . . . . . . . . . . . 11--42
Clyde P. Kruskal and
Larry Rudolph and
Marc Snir Efficient Parallel Algorithms for Graph
Problems . . . . . . . . . . . . . . . . 43--64
M. Orlowski A New Algorithm for the Largest Empty
Rectangle Problem . . . . . . . . . . . 65--73
Michael S. Paterson Improved Sorting Networks with $ O(\log
N) $ Depth . . . . . . . . . . . . . . . 75--92
Daniel Bienstock and
Clyde L. Monma On the Complexity of Embedding Planar
Graphs To Minimize Certain Distance
Measures . . . . . . . . . . . . . . . . 93--109
Ding Zhu Du and
Yanjun Zhang On Heuristics for Minimum Length
Rectilinear Partitions . . . . . . . . . 111--128
Xin He and
Yaacov Yesha Efficient parallel algorithms for
$r$-dominating set and $p$-center
problems on trees . . . . . . . . . . . 129--145
Shang-Ching Chou and
William F. Schelter and
Jin Gen Yang An Algorithm for Constructing Gröbner
Bases from Characteristic Sets and Its
Application to Geometry . . . . . . . . 147--154
C. S. Jeong and
D. T. Lee Parallel Geometric Algorithms on a
Mesh-Connected Computer . . . . . . . . 155--177
Carla D. Savage and
Matthias Stallmann and
Jo Ellen Perry Solving Some Combinatorial Problems on
Arrays with One-Way Dataflow . . . . . . 179--199
S. Sudarshan and
C. Pandu Rangan A Fast Algorithm for Computing Sparse
Visibility Graphs . . . . . . . . . . . 201--214
Kurt Mehlhorn and
Stefan Näher Dynamic Fractional Cascading . . . . . . 215--241
Ian Parberry An Optimal Time Bound for Oblivious
Routing . . . . . . . . . . . . . . . . 243--250
Gabriele Blankenagel and
Ralf Hartmut Güting Internal and external algorithms for the
points-in-regions problem---the INSIDE
join of geo-relational algebra . . . . . 251--276
Israel Cidon and
Inder S. Gopal Dynamic Detection of Subgraphs in
Computer Networks . . . . . . . . . . . 277--294
Joseph C. Culberson and
J. Ian Munro Analysis of the Standard Deletion
Algorithms in Exact Fit Domain Binary
Search Trees . . . . . . . . . . . . . . 295--311
Esko Ukkonen A Linear-Time Algorithm for Finding
Approximate Shortest Common Superstrings 313--323
Friedemann Mattern Asynchronous Distributed
Termination-Parallel and Symmetric
Solutions with Echo Algorithms . . . . . 325--340
M. T. Ko and
R. C. T. Lee and
J. S. Chang An optimal approximation algorithm for
the rectilinear $m$-center problem . . . 341--352
Bruce Randall Donald The Complexity of Planar Compliant
Motion Planning Under Uncertainty . . . 353--382
Michael M. Wu and
Michael C. Loui An Efficient Distributed Algorithm for
Maximum Matching in General Graphs . . . 383--406
Clyde L. Monma and
Michael S. Paterson and
Subhash Suri and
F. Frances Yao Computing Euclidean Maximum Spanning
Trees . . . . . . . . . . . . . . . . . 407--419
David P. Dobkin and
Diane L. Souvaine Computational Geometry in a Curved World 421--457
Bonnie Berger and
John Rompel A Better Performance Guarantee for
Approximate Graph Coloring . . . . . . . 459--466
Yen Tai Lai and
Sany M. Leinwand A Theory of Rectangular Dual Graphs . . 467--483
Sang Ho Lee and
Kyung-Yong Chwa Some Chain Visibility Problems in a
Simple Polygon . . . . . . . . . . . . . 485--507
Roberto Tamassia and
Franco P. Preparata Dynamic Maintenance of Planar Digraphs,
with Applications . . . . . . . . . . . 509--527
Fabrizio Luccio and
Andrea Pietracaprina and
Geppino Pucci A New Scheme for the Deterministic
Simulation of PRAMs in VLSI . . . . . . 529--544
Xin He Efficient parallel and sequential
algorithms for $4$-coloring perfect
planar graphs . . . . . . . . . . . . . 545--559
David P. Dobkin and
Herbert Edelsbrunner and
Mark H. Overmars Searching for Empty Convex Polygons . . 561--571
Panagiotis Alevizos and
Jean-Daniel Boissonnat and
Franco P. Preparata An Optimal Algorithm for the Boundary of
a Cell in a Union of Rays . . . . . . . 573--590
F. K. Hwang and
Y. C. Yao Comments on Bern's Probabilistic Results
on Rectilinear Steiner Trees . . . . . . 591--598
Andrea S. LaPaugh and
Frank Thomson Leighton Editors' Introduction . . . . . . . . . 1--3
Charles E. Leiserson and
James B. Saxe Retiming Synchronous Circuitry . . . . . 5--35
Sandeep N. Bhatt and
Fan R. K. Chung and
Arnold L. Rosenberg Partitioning Circuits for Improved
Testability . . . . . . . . . . . . . . 37--48
Alok Aggarwal and
J. Lawrence Carter and
S. Rao Kosaraju Optimal Tradeoffs for Addition on
Systolic Arrays . . . . . . . . . . . . 49--71
Prabhakar Raghavan and
Clark D. Thompson Multiterminal Global Routing: a
Deterministic Approximation Scheme . . . 73--82
Martin L. Brady and
Donna J. Brown Optimal Multilayer Channel Routing with
Overlap . . . . . . . . . . . . . . . . 83--101
F. Miller Maley A Generic Algorithm for One-Dimensional
Homotopic Compaction . . . . . . . . . . 103--128
Alok Aggarwal and
Maria M. Klawe and
Peter W. Shor Multilayer Grid Embeddings for VLSI . . 129--151
Clovis C. Gonzaga Search Directions for Interior
Linear-Programming Methods . . . . . . . 153--181
Hans Rohnert Moving a Disc Between Polygons . . . . . 182--191
D. F. Wong and
Edward M. Reingold Probabilistic Analysis of a Grouping
Algorithm . . . . . . . . . . . . . . . 192--206
Gary M. Shute and
Linda L. Deneen and
Clark D. Thomborson An $ O(n \log n) $ Plane-Sweep Algorithm
for $ L_1 $ and $ L_\infty $ Delaunay
Triangulations . . . . . . . . . . . . . 207--221
Sally Floyd and
Richard M. Karp FFD Bin Packing for Item Sizes with
Uniform Distributions on $ [0, \frac 12]
$ . . . . . . . . . . . . . . . . . . . 222--240
Alok Aggarwal and
Maria M. Klawe and
David Lichtenstein and
Nathan Linial and
Avi Wigderson A Lower Bound on the Area of Permutation
Layouts . . . . . . . . . . . . . . . . 241--255
Wojciech Szpankowski On the Height of Digital Trees and
Related Problems . . . . . . . . . . . . 256--277
Sanjiv Kapoor and
Edward M. Reingold Stochastic Rearrangement Rules for
Self-Organizing Data Structures . . . . 278--291
Panagiotis Alevizos and
Jean-Daniel Boissonnat and
Franco P. Preparata Corrigendum: ``An optimal algorithm for
the boundary of a cell in a union of
rays'' [Algorithmica \bf 5 (1990), no.\
4, 573--590; MR1072808 (91g:68154)] . . 292--293
Alberto L. Sangiovanni-Vincentelli Editor's Foreword . . . . . . . . . . . 295--301
Fabio Romeo and
Alberto L. Sangiovanni-Vincentelli A Theoretical Framework for Simulated
Annealing . . . . . . . . . . . . . . . 302--345
Philip N. Strenski and
Scott Kirkpatrick Analysis of Finite Length Annealing
Schedules . . . . . . . . . . . . . . . 346--366
Gregory B. Sorkin Efficient Simulated Annealing on Fractal
Energy Landscapes . . . . . . . . . . . 367--418
Saul B. Gelfand and
Sanjoy K. Mitter Simulated Annealing Type Algorithms for
Multivariate Optimization . . . . . . . 419--436
Emile H. L. Aarts and
Jan H. M. Korst Boltzmann Machines as a Model for
Parallel Annealing . . . . . . . . . . . 437--465
Eugene Wong Stochastic Neural Networks . . . . . . . 466--478
Vince Grolmusz Large Parallel Machines Can Be Extremely
Slow for Small Problems . . . . . . . . 479--489
Harald Rosenberger Order-$k$ Vorono\u\i diagrams of sites
with additive weights in the plane . . . 490--521
Leila De Floriani and
Bianca Falcidieno and
George Nagy and
Caterina Pienovi On Sorting Triangles in a Delaunay
Tessellation . . . . . . . . . . . . . . 522--532
Chanderjit Bajaj and
Myung Soo Kim Convex Hulls of Objects Bounded by
Algebraic Curves . . . . . . . . . . . . 533--553
Daniel M. Gordon Parallel Sorting on Cayley Graphs . . . 554--564
S. Alice Wu and
Joseph JáJá Optimal Algorithms for Adjacent Side
Routing . . . . . . . . . . . . . . . . 565--578
Robert F. Sproull Refinements to nearest-neighbor
searching in $k$-dimensional trees . . . 579--589
J. B. Kruskal and
Albert G. Greenberg A Flexible Way of Counting Large Numbers
Approximately in Small Registers . . . . 590--596
Claire M. Kenyon and
Jeffrey Scott Vitter Maximum Queue Size and Hashing with Lazy
Deletion . . . . . . . . . . . . . . . . 597--619
Frank K. H. A. Dehne Editor's Foreword Special Issue on
Parallel Algorithms for Geometric
Problems on Digitized Pictures . . . . . 621--623
Dipen Moitra Finding a Minimal Cover for Binary
Images: An Optimal Parallel Algorithm 624--657
Russ Miller and
Quentin F. Stout Computing Convexity Properties of Images
on a Pyramid Computer . . . . . . . . . 658--684
Otfried Schwarzkopf Parallel Computation of Disease [i.e.,
Distance] Transforms . . . . . . . . . . 685--697
Hussein M. Alnuweiri and
V. K. Prasanna Kumar Processor-Time Optimal Parallel
Algorithms for Digitized Images on
Mesh-Connected Processor Arrays . . . . 698--733
Frank K. H. A. Dehne and
A.-L. Hassenklover and
Jörg-Rüdiger Sack and
Nicola Santoro Computational Geometry Algorithms for
the Systolic Screen . . . . . . . . . . 734--761
Mikhail J. Atallah and
Susanne E. Hambrusch and
Lynn E. Te Winkel Topological Numbering of Features on a
Mesh . . . . . . . . . . . . . . . . . . 762--769
Robin Liu and
Simeon C. Ntafos On Partitioning Rectilinear Polygons
into Star-Shaped Polygons . . . . . . . 771--800
Marek Chrobak and
Joseph Naor An Efficient Parallel Algorithm for
Computing a Large Independent Set in a
Planar Graph . . . . . . . . . . . . . . 801--815
Lyle A. McGeoch and
Daniel Dominic Sleator A Strongly Competitive Randomized Paging
Algorithm . . . . . . . . . . . . . . . 816--825
Shigeru Masuyama and
Toshihide Ibaraki Chain Packing in Graphs . . . . . . . . 826--839
Marc J. van Kreveld and
Mark H. Overmars Divided $k$-$d$ trees . . . . . . . . . 840--858
Richard J. Anderson and
Gary L. Miller Deterministic Parallel List Ranking . . 859--868
Craig A. Morgenstern and
Henry D. Shapiro Heuristics for Rapidly Four-Coloring
Large Planar Graphs . . . . . . . . . . 869--891
Alok Aggarwal Editor's Foreword . . . . . . . . . . . 1--2
Richard Cole and
Michael T. Goodrich Optimal Parallel Algorithms for
Point-Set and Polygon Problems . . . . . 3--23
Sharat Chandran and
Sung Kwon Kim and
David M. Mount Parallel Computational Geometry of
Rectangles . . . . . . . . . . . . . . . 25--49
Ed Cohen and
Russ Miller and
Elias M. Sarraf and
Quentin F. Stout Efficient convexity and domination
algorithms for fine- and medium-grain
hypercube computers . . . . . . . . . . 51--75
Jorge L. C. Sanz and
Robert Cypher Data Reduction and Fast Routing: a
Strategy for Efficient Algorithms for
Message-Passing Parallel Computers . . . 77--89
John H. Reif and
Sandeep Sen Optimal Randomized Parallel Algorithms
for Computational Geometry . . . . . . . 91--117
F. K. Hwang Foreword . . . . . . . . . . . . . . . . 119--120
Ding-Zhu Du and
F. K. Hwang A proof of the Gilbert--Pollak
conjecture on the Steiner ratio . . . . 121--135
Warren D. Smith How to find Steiner minimal trees in
Euclidean $d$-space . . . . . . . . . . 137--177
Zi Cheng Liu and
Ding Zhu Du On Steiner Minimal Trees with $ L_p $
Distance . . . . . . . . . . . . . . . . 179--191
J. H. Rubinstein and
D. A. Thomas Graham's Problem on Shortest Networks
for Points on a Circle . . . . . . . . . 193--218
E. J. Cockayne and
D. E. Hewgill Improved Computation of Plane Steiner
Minimal Trees . . . . . . . . . . . . . 219--229
R. S. Booth and
J. F. Weng Steiner Minimal Trees for a Class of
Zigzag Lines . . . . . . . . . . . . . . 231--246
Dana S. Richards and
Jeffrey S. Salowe A linear-time algorithm to construct a
rectilinear Steiner minimal tree for
$k$-extremal point sets . . . . . . . . 247--276
Sailesh K. Rao and
P. Sadayappan and
Frank K. Hwang and
Peter W. Shor The Rectilinear Steiner Arborescence
Problem . . . . . . . . . . . . . . . . 277--288
J. Scott Provan Two New Criteria for Finding Steiner
Hulls in Steiner Tree Problems . . . . . 289--302
Charles J. Colbourn A note on bounding $k$-terminal
reliability . . . . . . . . . . . . . . 303--307
Pawel Winter and
J. MacGregor Smith Path-Distance Heuristics for the Steiner
Problem in Undirected Networks . . . . . 309--327
Warren D. Smith and
Peter W. Shor Steiner Tree Problems . . . . . . . . . 329--332
Stefan Voß Problems with Generalized Steiner
Problems . . . . . . . . . . . . . . . . 333--335
Otfried Schwarzkopf Erratum: ``Parallel computation of
distance transforms'' . . . . . . . . . 337
John E. Hopcroft and
Peter J. Kahn A Paradigm for Robust Geometric
Algorithms . . . . . . . . . . . . . . . 339--380
Leonidas J. Guibas and
Donald E. Knuth and
Micha Sharir Randomized Incremental Construction of
Delaunay and Vorono\u\i Diagrams . . . . 381--413
Andrew M. Liao Three Priority Queue Applications
Revisited . . . . . . . . . . . . . . . 415--427
Greg N. Frederickson Editor's Foreword Special Issue on Graph
Algorithms . . . . . . . . . . . . . . . 429--431
Jeffery Westbrook and
Robert Endre Tarjan Maintaining Bridge-Connected and
Biconnected Components On-Line . . . . . 433--464
Harold N. Gabow and
Herbert H. Westermann Forests, Frames, and Games: Algorithms
for Matroid Sums and Applications . . . 465--497
Dan Gusfield and
Charles U. Martel A Fast Algorithm for the Generalized
Parametric Minimum Cut Problem and
Applications . . . . . . . . . . . . . . 499--519
B. Mishra and
Robert Endre Tarjan A Linear-Time Algorithm for Finding an
Ambitus . . . . . . . . . . . . . . . . 521--554
Richard B. Borie and
R. Gary Parker and
Craig A. Tovey Automatic Generation of Linear-Time
Algorithms from Predicate Calculus
Descriptions of Problems on Recursively
Constructed Graph Families . . . . . . . 555--581
Hiroshi Nagamochi and
Toshihide Ibaraki A linear-time algorithm for finding a
sparse $k$-connected spanning subgraph
of a $k$-connected graph . . . . . . . . 583--596
John H. Reif and
Paul G. Spirakis Expected Parallel Time and Sequential
Space Complexity of Graph and Digraph
Problems . . . . . . . . . . . . . . . . 597--630
Joan M. Lucas and
Marian Gunsher Sackrowitz Efficient Parallel Algorithms for Path
Problems in Directed Graphs . . . . . . 631--648
Jacob T. Schwartz and
Micha Sharir Finding effective ``force targets'' for
two-dimensional, multifinger frictional
grips . . . . . . . . . . . . . . . . . 1--20
Sanguthevar Rajasekaran and
Thanasis Tsantilas Optimal Routing Algorithms for
Mesh-Connected Processor Arrays . . . . 21--38
Robert E. Webber and
Hanan Samet Linear-Time Border-Tracing Algorithms
for Quadtrees . . . . . . . . . . . . . 39--54
Joseph S. B. Mitchell $ L_1 $ Shortest Paths Among Polygonal
Obstacles in the Plane . . . . . . . . . 55--88
Sun Wu and
Udi Manber Path-Matching Problems . . . . . . . . . 89--101
Dan Gusfield and
Leonard Pitt A bounded approximation for the minimum
cost $2$-sat problem . . . . . . . . . . 103--117
Christine Rüb Line-Segment Intersection Reporting in
Parallel . . . . . . . . . . . . . . . . 119--144
Donald Goldfarb and
Jianxiu Hao Polynomial-Time Primal Simplex
Algorithms for the Minimum Cost Network
Flow Problem . . . . . . . . . . . . . . 145--160
Ilan Adler and
Renato D. C. Monteiro A Geometric View of Parametric Linear
Programming . . . . . . . . . . . . . . 161--176
M. S. Chang and
C. Y. Tang and
R. C. T. Lee Solving the Euclidean bottleneck
matching problem by $k$-relative
neighborhood graphs . . . . . . . . . . 177--194
Amy J. Briggs An Efficient Algorithm for One-Step
Planar Compliant Motion Planning with
Uncertainty . . . . . . . . . . . . . . 195--208
Mikhail J. Atallah and
Jyh Jong Tsay On the Parallel-Decomposability of
Geometric Problems . . . . . . . . . . . 209--231
C. K. Cheng and
T. C. Hu Maximum Concurrent Flows and Minimum
Cuts . . . . . . . . . . . . . . . . . . 233--249
Christos Levcopoulos and
Andrzej Lingas There Are Planar Graphs Almost as Good
as the Complete Graphs and Almost as
Cheap as Minimum Spanning Trees . . . . 251--256
Franco P. Preparata and
Jeffrey Scott Vitter and
Mariette Yvinec Output-Sensitive Generation of the
Perspective View of Isothetic
Parallelepipeds . . . . . . . . . . . . 257--283
Alberto Apostolico Optimal Parallel Detection of Squares in
Strings . . . . . . . . . . . . . . . . 285--319
Jean-Daniel Boissonnat and
Mariette Yvinec Probing a Scene of Nonconvex Polyhedra 321--342
Mikhail J. Atallah Editor's Foreword: Special Issue on the
Sixth Annual Symposium on Computational
Geometry . . . . . . . . . . . . . . . . 343--344
Zhenyu Li and
Victor Milenkovic Constructing Strongly Convex Hulls Using
Exact or Rounded Arithmetic . . . . . . 345--364
Rudolf Fleischer and
Kurt Mehlhorn and
Günter Rote and
Emo Welzl and
Chee K. Yap Simultaneous Inner and Outer
Approximation of Shapes . . . . . . . . 365--389
Helmut Alt and
Rudolf Fleischer and
Michael Kaufmann and
Kurt Mehlhorn and
Stefan Näher and
Stefan Schirra and
Christian Uhrig Approximate Motion Planning and the
Complexity of the Boundary of the Union
of Simple Geometric Figures . . . . . . 391--406
Bernard Chazelle and
Micha Sharir and
Emo Welzl Quasi-Optimal Upper Bounds for Simplex
Range Searching and New Zone Theorems 407--429
Joseph S. B. Mitchell and
Günter Rote and
Gerhard J. Woeginger Minimum-Link Paths Among Obstacles in
the Plane . . . . . . . . . . . . . . . 431--459
Michael T. Goodrich and
Steven B. Shauck and
Sumanta Guha Parallel Methods for Visibility and
Shortest-Path Problems in Simple
Polygons . . . . . . . . . . . . . . . . 461--486
R. Z. Hwang and
Richard C. T. Lee and
R. C. Chang The slab dividing approach to solve the
Euclidean $P$-center problem . . . . . . 1--22
Philip N. Klein and
Clifford Stein A Parallel Algorithm for Approximating
the Minimum Cycle Cover . . . . . . . . 23--31
Manfred Kunde Packet Routing on Grids of Processors 32--46
Michael Kaufmann and
F. Miller Maley Parity Conditions in Homotopic
Knock-Knee Routing . . . . . . . . . . . 47--63
Michael J. Todd and
Yu Fei Wang On combined phase $1$--phase $2$
projective methods for linear
programming . . . . . . . . . . . . . . 64--83
Majid Sarrafzadeh and
Ruey-Der Lou Maximum $k$-covering of weighted
transitive graphs with applications . . 84--100
T. Berger and
A. Hekstra and
Alon Orlitsky Asymptotic Component Densities in
Programmable Gate Arrays Realizing All
Circuits of a Given Size . . . . . . . . 101--127
Michael T. Goodrich and
Colm Ó'Dúnlaing and
Chee K. Yap Constructing the Vorono\u\i Diagram of a
Set of Line Segments in Parallel . . . . 128--141
Barry Joe and
Cao An Wang Duality of Constrained Vorono\u\i
Diagrams and Delaunay Triangulations . . 142--155
Mikhail J. Atallah A Faster Parallel Algorithm for a Matrix
Searching Problem . . . . . . . . . . . 156--167
Jon Louis Bentley and
Kenneth L. Clarkson and
David B. Levine Fast Linear Expected-Time Algorithms for
Computing Maxima and Convex Hulls . . . 168--183
Robert A. Bosch and
Kurt M. Anstreicher On partial updating in a potential
reduction linear programming algorithm
of Kojima, Mizuno, and Yoshise . . . . . 184--197
P. B. Ramprasad and
C. Pandu Rangan A Linear Algorithm for the
All-Bidirectional-Edges Problem on
Planar Graphs . . . . . . . . . . . . . 199--216
Lin Chen Efficient Parallel Recognition of Some
Circular Arc Graphs, I . . . . . . . . . 217--238
Richard J. Lipton and
Jeffrey F. Naughton Clocked Adversaries for Hashing . . . . 239--252
Edward G. Coffman, Jr. and
Peter W. Shor Packings in Two Dimensions: Asymptotic
Average-Case Analysis of Algorithms . . 253--277
Walter Meyer Seven Fingers Allow Force-Torque Closure
Grasps on Any Convex Polyhedron . . . . 278--292
Richard Anderson and
Simon Kahan and
Martine D. F. Schlag Single-Layer Cylindrical Compaction . . 293--312
Eric Bach and
Jonathan Sorenson Sieve Algorithms for Perfect Power
Testing . . . . . . . . . . . . . . . . 313--328
Jean-Daniel Boissonnat and
Olivier Devillers and
Monique Teillaud A Semidynamic Construction of
Higher-Order Vorono\u\i Diagrams and Its
Randomized Analysis . . . . . . . . . . 329--356
Shaunak Pawagi and
Owen Kaser Optimal Parallel Algorithms for Multiple
Updates of Minimum Spanning Trees . . . 357--381
Richard Kenyon Tiling a Polygon with Parallelograms . . 382--397
R. Z. Hwang and
R. C. Chang and
Richard C. T. Lee The Searching over Separators Strategy
To Solve Some NP-Hard Problems in
Subexponential Time . . . . . . . . . . 398--423
M. Y. Chan and
Francis Chin Schedulers for Larger Classes of
Pinwheel Instances . . . . . . . . . . . 425--462
Alexander Z. Zelikovsky An $ 11 / 6 $-approximation algorithm
for the network Steiner problem . . . . 463--470
Marco Pellegrini Ray shooting on triangles in $3$-space 471--494
Pankaj K. Agarwal and
Boris Aronov and
Micha Sharir and
Subhash Suri Selecting Distances in the Plane . . . . 495--514
Michael T. Goodrich and
Steven B. Shauck and
Sumanta Guha An addendum to: ``Parallel methods for
visibility and shortest-path problems in
simple polygons'' . . . . . . . . . . . 515--516
David P. Dobkin and
John Hershberger and
David G. Kirkpatrick and
Subhash Suri Computing the Intersection-Depth of
Polyhedra . . . . . . . . . . . . . . . 518--533
Leonidas J. Guibas and
David Salesin and
Jorge Stolfi Constructing Strongly Convex Approximate
Hulls with Inaccurate Primitives . . . . 534--560
János Pach and
Richard Pollack and
Emo Welzl Weaving Patterns of Lines and Line
Segments in Space . . . . . . . . . . . 561--571
Tetsuo Asano and
Takeshi Tokuyama Algorithms for Projecting Points to Give
the Most Uniform Distribution with
Applications to Hashing . . . . . . . . 572--590
Feng Gao and
Leonidas J. Guibas and
David G. Kirkpatrick and
William T. Laaser and
James B. Saxe Finding Extrema with Unary Predicates 591--600
Kuo-Hui Tsai and
Wen Lian Hsu Fast Algorithms for the Dominating Set
Problem on Permutation Graphs . . . . . 601--614
Tak Wah Lam and
Kwong-fai Chan Finding Least-Weight Subsequences with
Fewer Processors . . . . . . . . . . . . 615--628
Svante Carlsson and
Christos Levcopoulos and
Ola Petersson Sublinear Merging and Natural Mergesort 629--648
Kazumiti Numata and
Takeshi Tokuyama Splitting a Configuration in a Simplex 649--668
David P. Dobkin and
Leonidas J. Guibas and
John Hershberger and
Jack Snoeyink An Efficient Algorithm for Finding the
CSG Representation of a Simple Polygon 1--23
Juraj Hromkovi\vc and
Claus-Dieter Jeschke and
Burkhard Monien Optimal Algorithms for Dissemination of
Information in Some Interconnection
Networks . . . . . . . . . . . . . . . . 24--40
Kikuo Fujimura and
Hanan Samet Planning a Time-Minimal Motion Among
Moving Obstacles . . . . . . . . . . . . 41--63
Dan Gusfield and
Dalit Naor Extracting Maximal Information About
Sets of Minimum Cuts . . . . . . . . . . 64--89
Bruce Randall Donald Special Issue on Computational Robotics:
The Geometric Theory of Manipulation,
Planning, and Control . . . . . . . . . 91--101
John F. Canny and
Ming C. Lin An Opportunistic Global Path Planner . . 102--120
Jérôme Barraquand and
Jean-Claude Latombe Nonholonomic Multibody Mobile Robots:
Controllability and Motion Planning in
the Presence of Obstacles . . . . . . . 121--155
John H. Reif and
Stephen R. Tate Continuous Alternation: The Complexity
of Pursuit in Continuous Domains . . . . 156--181
Christian Icking and
Günter Rote and
Emo Welzl and
Chee K. Yap Shortest Paths for Line Segments . . . . 182--200
Kenneth Y. Goldberg Orienting Polygonal Parts Without
Sensors . . . . . . . . . . . . . . . . 201--225
Michael Erdmann and
Matthew T. Mason and
George Van\ve\vcek, Jr. Mechanical Parts Orienting: The Case of
a Polyhedron on a Table . . . . . . . . 226--247
Michael Erdmann Randomization for Robot Tasks: Using
Dynamic Programming in the Space of
Knowledge States . . . . . . . . . . . . 248--291
David Baraff Issues in Computing Contact Forces for
Non-Penetrating Rigid Bodies . . . . . . 292--352
Esko Ukkonen and
Derick Wood Approximate String Matching with Suffix
Automata . . . . . . . . . . . . . . . . 353--364
Kurt M. Anstreicher and
D. den Hertog and
C. Roos and
T. Terlaky A Long-Step Barrier Method for Convex
Quadratic Programming . . . . . . . . . 365--382
Yossi Malka and
Shlomo Moran and
Shmuel Zaks A Lower Bound on the Period Length of a
Distributed Scheduler . . . . . . . . . 383--398
Esther M. Arkin and
Samir Khuller and
Joseph S. B. Mitchell Geometric Knapsack Problems . . . . . . 399--427
Yachyang Sun and
Majid Sarrafzadeh Floorplanning by Graph Dualization:
L-shaped modules . . . . . . . . . . . . 429--456
Jerzy W. Jaromczyk and
G. W. Wasilkowski Numerical Stability of a Convex Hull
Algorithm for Simple Polygons . . . . . 457--472
Philippe Flajolet and
Gaston H. Gonnet and
Claude Puech and
J. M. Robson Analytic Variations on Quadtrees . . . . 473--500
S. L. Mantzaris Comment on: ``An improved algorithm for
finding the median distributively''
[Algorithmica \bf 2 (1987), no.\ 2,
235--249] by F. Chin and H. F. Ting . . 501--504
Prabhakar Raghavan Guest Editor's Foreword: Special Issue
on On-Line Algorithms . . . . . . . . . 1
Shai Ben-David and
Allan Borodin and
R. Karp and
Gábor Tardos and
Avi Wigderson On the Power of Randomization in On-Line
Algorithms . . . . . . . . . . . . . . . 2--14
Nick Reingold and
Jeffery Westbrook and
Daniel Dominic Sleator Randomized Competitive Algorithms for
the List Update Problem . . . . . . . . 15--32
Marshall W. Bern and
Daniel H. Greene and
Arvind Raghunathan and
Madhu Sudan On-Line Algorithms for Locating
Checkpoints . . . . . . . . . . . . . . 33--52
Sandy Irani Coloring Inductive Graphs On-Line . . . 53--72
Shai Ben-David and
Allan Borodin A New Measure for the Study of On-Line
Algorithms . . . . . . . . . . . . . . . 73--91
Vladimir Batagelj and
Simona Korenjak-\vCerne and
Sandi Klav\vzar Dynamic Programming and Convex
Clustering . . . . . . . . . . . . . . . 93--103
Rudolf Fleischer A tight lower bound for the worst case
of Bottom-Up-Heapsort . . . . . . . . . 104--115
Bernard Chazelle and
Herbert Edelsbrunner and
Leonidas J. Guibas and
Micha Sharir Algorithms for Bichromatic Line-Segment
Problems and Polyhedral Terrains . . . . 116--132
Reuven Bar-Yehuda and
Sergio Fogel Variations on Ray Shooting . . . . . . . 133--145
Johan Jeuring The Derivation of On-Line Algorithms,
with an Application To Finding
Palindromes . . . . . . . . . . . . . . 146--184
Pankaj K. Agarwal and
Micha Sharir Planar Geometric Location Problems . . . 185--195
Harold N. Gabow Editor's Foreword: Special Issur on
Network Flow Algorithms . . . . . . . . 197--199
Samir Khuller and
Joseph Naor Flow in Planar Graphs with Vertex
Capacities . . . . . . . . . . . . . . . 200--225
Tomasz Radzik and
Andrew V. Goldberg Tight Bounds on the Number of
Minimum-Mean Cycle Cancellations and
Related Results . . . . . . . . . . . . 226--242
Kazuo Iwano and
Shinji Misono and
Shu Tezuka and
Satoru Fujishige A New Scaling Algorithm for the Maximum
Mean Cut Problem . . . . . . . . . . . . 243--255
Yaron Pinto and
Ron Shamir Efficient Algorithms for Minimum-Cost
Flow Problems with Piecewise-Linear
Convex Costs . . . . . . . . . . . . . . 256--277
Dan Gusfield and
Éva Tardos A Faster Parametric Minimum-Cut
Algorithm . . . . . . . . . . . . . . . 278--290
Tomás Feder Network flow and $2$-satisfiability . . 291--319
Edith Cohen and
Nimrod Megiddo Algorithms and Complexity Analysis for
Some Flow Problems . . . . . . . . . . . 320--340
Heather Booth and
Jeffery Westbrook A Linear Algorithm for Analysis of
Minimum Spanning and Shortest-Path Trees
of Planar Graphs . . . . . . . . . . . . 341--352
Levent Tunçel On the Complexity of Preflow-Push
Algorithms for Maximum-Flow Problems . . 353--359
Marshall W. Bern and
David P. Dobkin and
David Eppstein and
Robert L. Grossman Visibility with a Moving Point of View 360--378
Peter Eades and
Nicholas C. Wormald Edge Crossings in Drawings of Bipartite
Graphs . . . . . . . . . . . . . . . . . 379--403
Peter Epstein and
J. Kavanagh and
A. Knight and
J. May and
T. Nguyen and
Jörg-Rüdiger Sack A Workbench for Computational Geometry 404--428
Thomas H. Spencer Provably Good Pattern Generators for a
Random Pattern Test . . . . . . . . . . 429--442
Vijaya Ramachandran and
Honghua Yang Finding the Closed Partition of a Planar
Graph . . . . . . . . . . . . . . . . . 443--468
Mark H. Overmars and
Micha Sharir An Improved Technique for
Output-Sensitive Hidden Surface Removal 469--484
Christos H. Papadimitriou and
P. Venkat Rangan and
Martha Sideri Designing Secure Communication Protocols
from Trust Specifications . . . . . . . 485--499
Mordecai J. Golin A Provably Fast Linear-Expected-Time
Maxima-Finding Algorithm . . . . . . . . 501--524
Neal E. Young The $k$-server dual and loose
competitiveness for paging . . . . . . . 525--541
Anna R. Karlin and
Mark S. Manasse and
Lyle A. McGeoch and
Susan S. Owicki Competitive Randomized Algorithms for
Nonuniform Problems . . . . . . . . . . 542--571
Amos Fiat and
Yuval Rabani and
Yiftach Ravid and
Baruch Schieber A Deterministic $ O(k^3) $-Competitive
$k$-Server Algorithm for the Circle . . 572--578
Lee R. Nackman and
V. Srinivasan Point Placement Algorithms for Delaunay
Triangulation of Polygonal Domains . . . 1--17
Christian Schwarz and
Michiel H. M. Smid and
Jack Snoeyink An Optimal Algorithm for the On-Line
Closest-Pair Problem . . . . . . . . . . 18--29
Mark de Berg and
Dan Halperin and
Mark H. Overmars and
Jack Snoeyink and
Marc J. van Kreveld Efficient Ray Shooting and Hidden
Surface Removal . . . . . . . . . . . . 30--53
Bernard Chazelle and
Herbert Edelsbrunner and
Michelangelo Grigni and
Leonidas J. Guibas and
John Hershberger and
Micha Sharir and
Jack Snoeyink Ray Shooting in Polygons Using Geodesic
Triangulations . . . . . . . . . . . . . 54--68
Jeffrey Scott Vitter Guest Editor's Introduction: Special
Issue on Large-Scale Memories . . . . . 69--71
Bowen Alpern and
Larry Carter and
Ephraim Feig and
Ted Selker The Uniform Memory Hierarchy Model of
Computation . . . . . . . . . . . . . . 72--109
Jeffrey Scott Vitter and
Elizabeth A. M. Shriver Algorithms for parallel memory. I.
Two-level memories . . . . . . . . . . . 110--147
Jeffrey Scott Vitter and
Elizabeth A. M. Shriver Algorithms for parallel memory. II.
Hierarchical multilevel memories . . . . 148--169
A. Chin Locality-Preserving Hash Functions for
General Purpose Parallel Computation . . 170--181
Lisa Hellerstein and
Garth A. Gibson and
Richard M. Karp and
Randy H. Katz and
David A. Patterson Coding Techniques for Handling Failures
in Large Disk Arrays . . . . . . . . . . 182--208
L. Newberg and
D. Wolfe String Layouts for a Redundant Array of
Inexpensive Disks . . . . . . . . . . . 209--224
Manuel Blum and
William S. Evans and
Peter Gemmell and
Sampath Kannan and
Moni Naor Checking the Correctness of Memories . . 225--244
Alberto Apostolico Guest Editor's Foreword: Special Issue
on String Algorithmics and Its
Applications . . . . . . . . . . . . . . 245--246
Maxime Crochemore and
Artur Czumaj and
Leszek G\kasieniec and
Stefan Jarominek and
Thierry Lecroq and
Wojciech Plandowski and
Wojciech Rytter Speeding Up Two String-Matching
Algorithms . . . . . . . . . . . . . . . 247--267
Ricardo A. Baeza-Yates and
Christian Choffrut and
Gaston H. Gonnet On Boyer--Moore automata . . . . . . . . 268--292
F. Chin and
C. K. Poon Performance Analysis of Some Simple
Heuristics for Computing Longest Common
Subsequences . . . . . . . . . . . . . . 293--311
Dan Gusfield and
K. Balasubramanian and
Dalit Naor Parametric Optimization of Sequence
Alignment . . . . . . . . . . . . . . . 312--326
William I. Chang and
Eugene L. Lawler Sublinear Approximate String Matching
and Biological Applications . . . . . . 327--344
Eugene W. Myers A Sublinear Algorithm for Approximate
Keyword Searching . . . . . . . . . . . 345--374
Gad M. Landau and
Uzi Vishkin Pattern Matching in a Digitized Image 375--408
Aviezri S. Fraenkel and
Shmuel T. Klein Complexity Aspects of Guessing Prefix
Codes . . . . . . . . . . . . . . . . . 409--419
Y. C. Wee and
Seth Chaiken and
S. S. Ravi Rectilinear Steiner Tree Heuristics and
Minimum Spanning Tree Algorithms Using
Geographic Nearest Neighbors . . . . . . 421--435
Ilan Adler and
Peter A. Beling Polynomial Algorithms for Linear
Programming over the Algebraic Numbers 436--457
Pang-Chieh Chen Heuristic Sampling on DAGs . . . . . . . 458--475
Paola Bertolazzi and
Giuseppe Di Battista and
Giuseppe Liotta and
Carlo Mannino Upward Drawings of Triconnected Digraphs 476--497
Gabriele Blankenagel and
Ralf Hartmut Güting External Segment Trees . . . . . . . . . 498--532
Lenwood S. Heath and
Sriram V. Pemmaraju New Results for the Minimum Weight
Triangulation Problem . . . . . . . . . 533--552
Eugene W. Myers Guest Editor's Foreword: Special Issue
on Computational Molecular Biology . . . 1--6
John D. Kececioglu and
Eugene W. Myers Combinatorial Algorithms for DNA
Sequence Assembly . . . . . . . . . . . 7--51
Farid Alizadeh and
Richard M. Karp and
L. A. Newberg and
Deborah K. Weisser Physical Mapping of Chromosomes: a
Combinatorial Problem in Molecular
Biology . . . . . . . . . . . . . . . . 52--76
Pavel A. Pevzner DNA physical mapping and alternating
Eulerian cycles in colored graphs . . . 77--105
Kun-Mao Chao and
Webb Miller Linear-Space Algorithms that Build Local
Alignments from Fragments . . . . . . . 106--134
Pavel A. Pevzner and
M. S. Waterman Multiple Filtration and Approximate
Pattern Matching . . . . . . . . . . . . 135--154
Martin Farach and
Sampath Kannan and
Tandy Warnow A Robust Model for Finding Optimal
Evolutionary Trees . . . . . . . . . . . 155--179
John D. Kececioglu and
David Sankoff Exact and Approximation Algorithms for
Sorting by Reversals, with Application
to Genome Rearrangement . . . . . . . . 180--210
James R. Knight and
Eugene W. Myers Super-Pattern Matching . . . . . . . . . 211--243
Robert F. Cohen and
Roberto Tamassia Dynamic Expression Trees . . . . . . . . 245--265
Michael R. Fellows and
Jan Kratochvíl and
Martin Middendorf and
F. Pfeiffer The Complexity of Induced Minors and
Related Problems . . . . . . . . . . . . 266--282
Keith E. Humenik and
P. Matthews and
A. B. Stephens and
Yelena Yesha A Lower Bound on the Probability of
Conflict Under Nonuniform Access in
Database Systems . . . . . . . . . . . . 283--300
Hans-Peter Lenhof and
Michiel H. M. Smid Maintaining the Visibility Map of
Spheres While Moving the Viewpoint on a
Circle at Infinity . . . . . . . . . . . 301--312
Hosam M. Mahmoud The Joint Distribution of the Three
Types of Nodes in Uniform Binary Trees 313--323
Pankaj K. Agarwal and
Ji\vrí Matou\vsek Dynamic Half-Space Range Reporting and
Its Applications . . . . . . . . . . . . 325--345
Danilo Bruschi and
F. Ravasio Random Parallel Algorithms for Finding
Exact Branchings, Perfect Matchings, and
Cycles . . . . . . . . . . . . . . . . . 346--356
Michael Jünger and
William R. Pulleyblank New Primal and Dual Matching Heuristics 357--380
Ding Zhu Du On Greedy Heuristics for Steiner Minimum
Trees . . . . . . . . . . . . . . . . . 381--386
P. J. de Rezende and
D. T. Lee Point set pattern matching in
$d$-dimensions . . . . . . . . . . . . . 387--404
Maxime Crochemore and
Wojciech Rytter Squares, Cubes, and Time-Space Efficient
String Searching . . . . . . . . . . . . 405--425
Catherine C. McGeoch All-Pairs Shortest Paths and the
Essential Subgraph . . . . . . . . . . . 426--441
D. S. Atkinson and
Pravin M. Vaidya Using Geometry To Solve the
Transportation Problem in the Plane . . 442--461
David Eppstein Asymptotic Speed-Ups in Constructive
Solid Geometry . . . . . . . . . . . . . 462--471
Anthony Lazanas and
Jean-Claude Latombe Landmark-Based Robot Navigation . . . . 472--501
Monika Rauch Henzinger Fully Dynamic Biconnectivity in Graphs 503--538
Achim Schweikard and
R. H. Wilson Assembly Sequences for Polyhedra . . . . 539--552
Xin He An Efficient Parallel Algorithm for
Finding Rectangular Duals of Plane
Triangular Graphs . . . . . . . . . . . 553--572
Michel Habib and
Marianne Huchard and
Jeremy Spinrad A Linear Algorithm To Decompose
Inheritance Graphs Into Modules . . . . 573--591
Pilar de la Torre and
Raymond Greenlaw and
Alejandro A. Schäffer Optimal Edge Ranking of Trees in
Polynomial Time . . . . . . . . . . . . 592--618
Sven Schuierer and
D. Wood Staircase Visibility and Computation of
Kernels . . . . . . . . . . . . . . . . 1--26
Seung-Hak Choi and
Sung Yong Shin and
Kyung-Yong Chwa Characterizing and Recognizing the
Visibility Graph of a Funnel-Shaped
Polygon . . . . . . . . . . . . . . . . 27--51
Bogdan S. Chlebus and
Krzysztof Diks and
Miroslaw Kowaluk $ O(\log \log n) $-time integer geometry
on the CRCW PRAM . . . . . . . . . . . . 52--69
Sally A. Goldman and
Robert H. Sloan Can PAC Learning Algorithms Tolerate
Random Attribute Noise? . . . . . . . . 70--84
James R. Knight and
Eugene W. Myers Approximate Regular Expression Pattern
Matching with Concave Gap Penalties . . 85--121
Richard B. Borie Generation of Polynomial-Time Algorithms
for Some Optimization Problems on
Tree-Decomposable Graphs . . . . . . . . 123--137
L. Cai and
Derek G. Corneil Isomorphic Tree Spanner Problems . . . . 138--153
P. Dietz and
Kurt Mehlhorn and
Rajeev Raman and
Christian Uhrig Lower Bounds for Set Intersection
Queries . . . . . . . . . . . . . . . . 154--168
Nancy M. Amato and
Franco P. Preparata A Time-Optimal Parallel Algorithm for
Three-Dimensional Convex Hulls . . . . . 169--182
Nancy M. Amato Finding a Closest Visible Vertex Pair
Between Two Polygons . . . . . . . . . . 183--201
Shuo-Yan Chou and
R. C. Woo A Linear-Time Algorithm for Constructing
a Circular Visibility Diagram . . . . . 203--228
Ross M. McConnell An $ O(n^2) $ Incremental Algorithm for
Modular Decomposition of Graphs and
$2$-Structures . . . . . . . . . . . . . 229--248
Esko Ukkonen On-Line Construction of Suffix Trees . . 249--260
Andrzej Lingas and
Anil Maheshwari and
Jörg-Rüdiger Sack Optimal Parallel Algorithms for
Rectilinear Link-Distance Problems . . . 261--289
Frank Thomson Leighton and
Fillia Makedon and
Ioannis G. Tollis A $ 2 n - 2 $ Step Algorithm for Routing
in an $ n \times n $ Array with
Constant-Size Queues . . . . . . . . . . 291--304
Samir Khuller and
Balaji Raghavachari and
Neal E. Young Balancing Minimum Spanning Trees and
Shortest-Path Trees . . . . . . . . . . 305--321
Sairam Subramanian and
Roberto Tamassia and
Jeffrey Scott Vitter An Efficient Parallel Algorithm for
Shortest Paths in Planar Layered
Digraphs . . . . . . . . . . . . . . . . 322--339
W. Panny and
Helmut Prodinger Bottom-Up Mergesort---a Detailed
Analysis . . . . . . . . . . . . . . . . 340--354
Dany Breslauer and
Zvi Galil Finding All Periods and Initial
Palindromes of a String in Parallel . . 355--366
Yui-Bin Chen and
Doug J. Ierardi The Complexity of Oblivious Plans for
Orienting and Distinguishing Polygonal
Parts . . . . . . . . . . . . . . . . . 367--397
Ming-Yang Kao and
Shang-Hua Teng and
Kentaro Toyama An Optimal Parallel Algorithm for Planar
Cycle Separators . . . . . . . . . . . . 398--408
Andrew Chi-Chih Yao Minimean Optimal Key Arrangements in
Hash Tables . . . . . . . . . . . . . . 409--428
Mikhail J. Atallah and
Danny Z. Chen and
D. T. Lee An Optimal Algorithm for Shortest Paths
on Weighted Interval and Circular-Arc
Graphs, with Applications . . . . . . . 429--441
Bruce Randall Donald and
Patrick G. Xavier Provably Good Approximation Algorithms
for Optimal Kinodynamic Planning: Robots
with Decoupled Dynamics Bounds . . . . . 443--479
Bruce Randall Donald and
Patrick G. Xavier Provably Good Approximation Algorithms
for Optimal Kinodynamic Planning for
Cartesian Robots and Open-Chain
Manipulators . . . . . . . . . . . . . . 480--530
F. Miller Maley Testing Homotopic Routability Under
Polygonal Wiring Rules . . . . . . . . . 1--16
G. N. Srinivasa Prasanna and
Bruce R. Musicus The Optimal Control Approach to
Generalized Multiprocessor Scheduling 17--49
Sun Wu and
Udi Manber and
Eugene W. Myers A Subquadratic Algorithm for Approximate
Limited Expression Matching . . . . . . 50--67
Shou Wen Tang and
Kaizhong Zhang and
Xiaolin Wu Fast Algorithms for Minimum Matrix Norm
with Application in Computer Graphics 68--81
Michael B. Dillencourt and
Hanan Samet Using Topological Sweep to Extract the
Boundaries of Regions in Maps
Represented by Region Quadtrees . . . . 82--102
Richard Anderson and
Paul Beame and
Erik Brisson Parallel Algorithms for Arrangements . . 104--125
Michael T. Goodrich and
Mujtaba R. Ghouse and
J. Bright Sweep Methods for Parallel Computational
Geometry . . . . . . . . . . . . . . . . 126--153
Roberto Tamassia and
Jeffrey Scott Vitter Optimal Cooperative Search in Fractional
Cascaded Data Structures . . . . . . . . 154--171
David G. Kirkpatrick and
Teresa M. Przytycka Parallel Construction of Binary Trees
with Near Optimal Weighted Path Length 172--192
Björn Lisper Preconditioning Index Set
Transformations for Time-Optimal Affine
Scheduling . . . . . . . . . . . . . . . 193--203
Kaizhong Zhang A Constrained Edit Distance Between
Unordered Labeled Trees . . . . . . . . 205--222
Herbert Edelsbrunner and
Nimish R. Shah Incremental Topological Flipping Works
for Regular Triangulations . . . . . . . 223--241
K. S. Easwarakumar and
S. V. Krishnan and
C. Pandu Rangan and
S. Seshadri Optimal parallel algorithm for finding $
s t $-ambitus of a planar biconnected
graph . . . . . . . . . . . . . . . . . 242--255
B. Mishra Bidirectional Edges Problem: Part I---A
Simple Algorithm . . . . . . . . . . . . 256--286
Ronitt Rubinfeld Designing Checkers for Programs that Run
in Parallel . . . . . . . . . . . . . . 287--301
Giuseppe Di Battista and
Roberto Tamassia On-Line Maintenance of Triconnected
Components with SPQR-Trees . . . . . . . 302--318
Danny Krizanc and
Lata Narayanan and
Rajeev Raman Fast Deterministic Selection on
Mesh-Connected Processor Arrays . . . . 319--331
J. L. Nazareth The Implementation of Linear Programming
Algorithms Based on Homotopies . . . . . 332--350
J. Scott Provan and
D. R. Shier A paradigm for listing $ (s, t) $-cuts
in graphs . . . . . . . . . . . . . . . 351--372
Konstantinos Kalpakis and
Y. Yesha Scheduling Tree DAGs on Parallel
Architectures . . . . . . . . . . . . . 373--396
Egon Balas and
Jue Xue Weighted and Unweighted Maximum Clique
Algorithms with Upper Bounds from
Fractional Coloring . . . . . . . . . . 397--412
Friedhelm Meyer auf der Heide and
Brigitte Oesterdiekhoff and
Rolf Wanka Strongly Adaptive Token Distribution . . 413--427
Bernard Chazelle and
Herbert Edelsbrunner and
Leonidas J. Guibas and
Micha Sharir and
Jorge Stolfi Lines in Space: Combinatorics and
Algorithms . . . . . . . . . . . . . . . 428--447
Greg N. Frederickson Searching Among Intervals and Compact
Routing Tables . . . . . . . . . . . . . 448--466
Renzo Sprugnoli Recurrence Relations on Heaps . . . . . 467--480
Alberto Apostolico and
Franco P. Preparata Data Structures and Algorithms for the
String Statistics Problem . . . . . . . 481--494
Ruth Kuchem and
Dorothea Wagner and
Frank Wagner Optimizing Area for Three-Layer
Knock-Knee Channel Routing . . . . . . . 495--519
Joseph Cheriyan and
Kurt Mehlhorn Algorithms for Dense Graphs and Networks
on the Random Access Computer . . . . . 521--549
Peichen Pan and
Weiping Shi and
C. L. Liu Area Minimization for Hierarchical
Floorplans . . . . . . . . . . . . . . . 550--571
Yang Cai and
M. C. Kong Nonpreemptive Scheduling of Periodic
Tasks in Uni- and Multiprocessor Systems 572--599
Sanjoy K. Baruah and
N. K. Cohen and
C. Greg Plaxton and
Donald A. Varvel Proportionate Progress: a Notion of
Fairness in Resource Allocation . . . . 600--625
Pankaj K. Agarwal and
Marc J. van Kreveld Connected Component and Simple Polygon
Intersection Searching . . . . . . . . . 626--660
Giuseppe Di Battista and
Roberto Tamassia Guest Editors' Introduction to the
Special Issue on Graph Drwaing . . . . . 1--3
Goos Kant Drawing Planar Graphs Using the
Canonical Ordering . . . . . . . . . . . 4--32
Michael Jünger and
Petra Mutzel Maximum Planar Subgraphs and Nice
Embeddings: Practical Layout Tools . . . 33--59
Peter Eades and
Sue Whitesides The Realization Problem for Euclidean
Minimum Spanning Trees is NP-Hard . . . 60--82
Prosenjit Bose and
William Lenhart and
Giuseppe Liotta Characterizing Proximity Trees . . . . . 83--110
János Pach and
Farhad Shahrokhi and
Mario Szegedy Applications of the Crossing Number . . 111--117
Farhad Shahrokhi and
László A. Székely and
Ondrej Sýkora and
Imrich Vr\softto Drawings of Graphs on Surfaces with Few
Crossings . . . . . . . . . . . . . . . 118--131
Xiaotie Deng and
Christos H. Papadimitriou Competitive Distributed Decision-Making 133--150
J. Ian Munro and
Venkatesh Raman Fast Stable In-Place Sorting with $ O(n)
$ Data Moves . . . . . . . . . . . . . . 151--160
Shou-Hsuan Stephen Huang and
Hongfei Liu and
Rakesh M. Verma A New Combinatorial Approach to Optimal
Embeddings of Rectangles . . . . . . . . 161--180
Mark H. Nodine and
Michael T. Goodrich and
Jeffrey Scott Vitter Blocking for External Graph Searching 181--214
David M. Choy and
Ronald Fagin and
Larry J. Stockmeyer Efficiently Extendible Mappings for
Balanced Data Distribution . . . . . . . 215--232
Kurt Mehlhorn and
Petra Mutzel On the Embedding Phase of the Hopcroft
and Tarjan Planarity Testing Algorithm 233--242
Sivaprakasam Sunder and
Xin He An NC algorithm for finding a minimum
weighted completion time schedule on
series parallel graphs . . . . . . . . . 243--262
Dora Giammarresi and
Giuseppe F. Italiano Decremental $2$- and $3$-connectivity on
planar graphs . . . . . . . . . . . . . 263--287
Costas S. Iliopoulos and
D. W. G. Moore and
Kunsoo Park Covering a String . . . . . . . . . . . 288--297
Andris Ambainis Communication complexity in a
$3$-computer model . . . . . . . . . . . 298--301
Lusheng Wang and
Tao Jiang and
Eugene L. Lawler Approximation Algorithms for Tree
Alignment with a Given Phylogeny . . . . 302--315
Masato Edahiro Equispreading Tree in Manhattan Distance 316--338
Jun-ya Takahashi and
Hitoshi Suzuki and
Takao Nishizeki Shortest Noncrossing Paths in Plane
Graphs . . . . . . . . . . . . . . . . . 339--357
Michael Luby Introduction to Special Issue on
Randomized and Derandomized Algorithms 359--366
David Zuckerman Simulating BPP Using a General Weak
Random Source . . . . . . . . . . . . . 367--391
Mark Jerrum and
Umesh V. Vazirani A Mildly Exponential Approximation
Algorithm for the Permanent . . . . . . 392--401
Milena Mihail and
Peter Winkler On the Number of Eulerian Orientations
of a Graph . . . . . . . . . . . . . . . 402--414
Michael Luby and
Boban Veli\vckovi\'c On Deterministic Approximation of DNF 415--433
Noga Alon and
Moni Naor Derandomization, Witnesses for Boolean
Matrix Multiplication and Construction
of Perfect Hash Functions . . . . . . . 434--449
Ketan Mulmuley Randomized Geometric Algorithms and
Pseudorandom Generators . . . . . . . . 450--463
Raimund Seidel and
Cecilia R. Aragon Randomized Search Trees . . . . . . . . 464--497
Ji\vrí Matou\vsek and
Micha Sharir and
Emo Welzl A Subexponential Bound for Linear
Programming . . . . . . . . . . . . . . 498--516
Richard M. Karp and
Michael Luby and
Friedhelm Meyer auf der Heide Efficient PRAM Simulation on a
Distributed Memory Machine . . . . . . . 517--542
Helmut Alt and
Leonidas J. Guibas and
Kurt Mehlhorn and
Richard M. Karp and
Avi Wigderson A Method for Obtaining Randomized
Algorithms with Small Tail Probabilities 543--547
Michele Flammini and
Giorgio Gambosi and
Sandro Salomone Interval Routing Schemes . . . . . . . . 549--568
Richard Cole and
Michael T. Goodrich and
Colm Ó'Dúnlaing A Nearly Optimal Deterministic Parallel
Vorono\u\i Diagram Algorithm . . . . . . 569--617
David Avis Generating Rooted Triangulations Without
Repetitions . . . . . . . . . . . . . . 618--632
Donald B. Johnson and
Panagiotis Takis Metaxas Optimal Algorithms for the Single and
Multiple Vertex Updating Problems of a
Minimum Spanning Tree . . . . . . . . . 633--648
Mark Allen Weiss Shellsort with a Constant Number of
Increments . . . . . . . . . . . . . . . 649--654
Theodore H. Romer and
Louis E. Rosier An Algorithm Reminiscent of
Euclidean-gcd for Computing a Function
Related to Pinwheel Scheduling . . . . . 1--10
Brandon Dixon and
Robert Endre Tarjan Optimal Parallel Verification of Minimum
Spanning Trees in Logarithmic Time . . . 11--18
Frank K. H. A. Dehne and
Rolf Klein ``The Big Sweep'': On the Power of the
Wavefront Approach to Vorono\u\i
Diagrams . . . . . . . . . . . . . . . . 19--32
Sunil Arya and
Michiel H. M. Smid Efficient Construction of a
Bounded-Degree Spanner with Low Weight 33--54
Torben Hagerup and
Miroslaw Kuty\lowski Fast integer merging on the EREW PRAM 55--66
Jòrgen Bang-Jensen and
M. El Haddad and
Yannis Manoussakis and
Teresa M. Przytycka Parallel Algorithms for the Hamiltonian
Cycle and Hamiltonian Path Problems in
Semicomplete Bipartite Digraphs . . . . 67--87
Ronald I. Greenberg and
Jau-Der Shih Minimizing Channel Density with Movable
Terminals . . . . . . . . . . . . . . . 89--99
F. Granot and
J. Skorin-Kapov and
Amir Tamir Using Quadratic Programming to Solve
High Multiplicity Scheduling Problems on
Parallel Machines . . . . . . . . . . . 100--110
Francis Avnaim and
Jean-Daniel Boissonnat and
Olivier Devillers and
Franco P. Preparata and
Mariette Yvinec Evaluating Signs of Determinants Using
Single-Precision Arithmetic . . . . . . 111--132
Jay N. Bhuyan and
Jitender S. Deogun and
Vijay V. Raghavan Algorithms for the Boundary Selection
Problem . . . . . . . . . . . . . . . . 133--161
Laurent Alonso and
Jean-Luc Rémy and
René Schott A Linear-Time Algorithm for the
Generation of Trees . . . . . . . . . . 162--182
Kurt Mehlhorn and
R. Sundar and
Christian Uhrig Maintaining Dynamic Sequences under
Equality Tests in Polylogarithmic Time 183--198
Robert F. Cohen and
Peter Eades and
Tao Lin and
Frank Ruskey Three-Dimensional Graph Drawing . . . . 199--208
Noga Alon and
Raphy Yuster and
Uri Zwick Finding and Counting Given Length Cycles 209--223
Michael Kaufmann and
Jop F. Sibeyn Randomized Multipacket Routing and
Sorting on Meshes . . . . . . . . . . . 224--244
Bernard Chazelle and
Leonidas Palios Decomposing the Boundary of a Nonconvex
Polyhedron . . . . . . . . . . . . . . . 245--265
Lin Chen Efficient Parallel Recognition of Some
Circular Arc Graphs, II . . . . . . . . 266--280
S. Guha and
I. Suzuki Proximity Problems for Points on a
Rectilinear Plane with Rectangular
Obstacles . . . . . . . . . . . . . . . 281--307
Rida A. Bazzi and
Gil Neiger The Complexity of Almost-Optimal
Simultaneous Coordination . . . . . . . 308--321
Rephael Wenger Randomized Quickhull . . . . . . . . . . 322--329
Piotr Berman and
Bhaskar Dasgupta Complexities of Efficient Solutions of
Rectilinear Polygon Cover Problems . . . 331--356
E. Rimon Construction of $C$-space roadmaps from
local sensory data. What should the
sensors look for? . . . . . . . . . . . 357--379
Marco Pellegrini On Counting Pairs of Intersecting
Segments and Off-Line Triangle Range
Searching . . . . . . . . . . . . . . . 380--398
Yijie Han and
Victor Y. Pan and
John H. Reif Efficient Parallel Algorithms for
Computing All Pair Shortest Paths in
Directed Graphs . . . . . . . . . . . . 399--415
Sergio De Agostino and
Rossella Petreschi and
Andrea Sterbini An $ O(n^3) $ Recognition Algorithm for
Bithreshold Graphs . . . . . . . . . . . 416--425
Susanne E. Hambrusch and
Hung-Yi Tu New Algorithms for Minimizing the
Longest Wire Length During Circuit
Compaction . . . . . . . . . . . . . . . 426--448
Noga Alon and
Aravind Srinivasan Improved Parallel Approximation of a
Class of Integer Programming Problems 449--462
Anonymous Guest Editor's Foreword . . . . . . . . 1--2
Naveen Garg and
Vijay V. Vazirani and
Mihalis Yannakakis Primal---Dual Approximation Algorithms
for Integral Flow and Multicut in Trees 3--20
R. Ravi and
David P. Williamson An Approximation Algorithm for
Minimum-Cost Vertex-Connectivity
Problems . . . . . . . . . . . . . . . . 21--43
David Peleg and
Gideon Schechtman and
Avishai Wool Randomized Approximation of Bounded
Multicovering Problems . . . . . . . . . 44--66
Alan M. Frieze and
Mark Jerrum Improved approximation algorithms for
MAX $k$-CUT and MAX BISECTION . . . . . 67--81
David R. Karger and
Rajeev Motwani and
G. D. S. Ramkumar On Approximating the Longest Path in a
Graph . . . . . . . . . . . . . . . . . 82--98
Alexander Zelikovsky A Series of Approximation Algorithms for
the Acyclic Directed Steiner Tree
Problem . . . . . . . . . . . . . . . . 99--110
Naveen Garg and
Dorit S. Hochbaum An $ O(\log k) $-approximation algorithm
for the $k$ minimum spanning tree
problem in the plane . . . . . . . . . . 111--121
F. K. Miyazawa and
Y. Wakabayashi An Algorithm for the Three-Dimensional
Packing Problem with Asymptotic
Performance Analysis . . . . . . . . . . 122--144
Magnús M. Halldórsson and
Jaikumar Radhakrishnan Greed is Good: Approximating Independent
Sets in Sparse and Bounded-Degree Graphs 145--163
Yui-Bin Chen and
Doug Ierardi Time-Optimal Trajectories of a Rod in
the Plane Subject to Velocity
Constraints . . . . . . . . . . . . . . 165--197
Kuo-Hui H. Tsai and
D. T. Lee $k$ best cuts for circular-arc graphs 198--216
L. Paul Chew and
Steven Fortune Sorting Helps for Vorono\u\i Diagrams 217--228
Takeshi Tokuyama Orthogonal Queries in Segments . . . . . 229--245
Mark H. Overmars and
Nicola Santoro Improved Bounds for Electing a Leader in
a Synchronous Ring . . . . . . . . . . . 246--262
Valerie King A Simpler Minimum Spanning Tree
Verification Algorithm . . . . . . . . . 263--270
S. V. Rice and
H. Bunke and
T. A. Nartker Classes of Cost Functions for String
Edit Distance . . . . . . . . . . . . . 271--280
T. Lengauer Foreword . . . . . . . . . . . . . . . . 281--282
Susanne Albers On the Influence of Lookahead in
Competitive Paging Algorithms . . . . . 283--305
Mark de Berg and
Marc J. van Kreveld Trekking in the Alps Without Freezing or
Getting Tired . . . . . . . . . . . . . 306--323
Robert F. Cohen and
Roberto Tamassia Combine and Conquer . . . . . . . . . . 324--362
Karsten Weihe Multicommodity Flows in Even, Planar
Networks . . . . . . . . . . . . . . . . 363--383
Vijaya Ramachandran and
Honghua Yang An Efficient Parallel Algorithm for the
Layered Planar Monotone Circuit Value
Problem . . . . . . . . . . . . . . . . 384--404
Ornan Gerstel and
Shmuel Zaks The Bit Complexity of Distributed
Sorting . . . . . . . . . . . . . . . . 405--416
Michael Kaufmann and
Rajeev Raman and
Jop F. Sibeyn Routing on Meshes with Buses . . . . . . 417--444
Ernst W. Mayr and
Ralph Werchner Optimal Tree Contraction and Term
Matching on the Hypercube and Related
Networks . . . . . . . . . . . . . . . . 445--460
William R. Burley and
Sandy Irani On Algorithm Design for Metrical Task
Systems . . . . . . . . . . . . . . . . 461--485
Shlomi Dolev and
Jennifer L. Welch Wait-Free Clock Synchronization . . . . 486--511
S. Muthukrishnan Detecting False Matches in
String-Matching Algorithms . . . . . . . 512--520
Robert Beals Equivalence of Binary and Ternary
Algebraic Decision Trees . . . . . . . . 521--523
S. N. Bespamyatnikh On Constructing Minimum Spanning Trees
in $ R^k_l $ . . . . . . . . . . . . . . 524--529
T. Matsui A Flexible Algorithm for Generating All
the Spanning Trees in Undirected Graphs 530--543
Celina Imieli\'nska and
Bahman Kalantari A General Class of Heuristics for
Minimum Weight Perfect Matching and Fast
Special Cases with Doubly and Triply
Logarithmic Errors . . . . . . . . . . . 544--559
Peichen Pan and
Sai-keung Dong and
C. L. Liu Optimal Graph Constraint Reduction for
Symbolic Layout Compaction . . . . . . . 560--574
J. S. B. Mitchell Guest Editor's Introduction . . . . . . 1--3
David Baraff and
R. Mattikalli and
P. Khosla Minimal Fixturing of Frictionless
Assemblies: Complexity and Algorithms 4--39
A. S. Wallack and
John F. Canny Planning for Modular and Hybrid Fixtures 40--60
Boudewijn Asberg and
Gregoria Blanco and
Prosenjit Bose and
Jesus Garcia-Lopez and
Mark H. Overmars and
Godfried T. Toussaint and
Gordon T. Wilfong and
Binhai Zhu Feasibility of Design in
Stereolithography . . . . . . . . . . . 61--83
Prosenjit Bose and
David Bremner and
Marc J. van Kreveld Determining the Castability of Simple
Polyhedra . . . . . . . . . . . . . . . 84--113
M. S. Karasick and
D. Lieber and
Lee R. Nackman and
V. T. Rajan Visualization of Three-Dimensional
Delaunay Meshes . . . . . . . . . . . . 114--128
Daniela Rus Coordinated Manipulation of Objects in a
Plane . . . . . . . . . . . . . . . . . 129--147
Karen Daniels and
Victor J. Milenkovic Multiple Translational Containment. Part
I: An Approximate Algorithm . . . . . . 148--182
Victor Milenkovic Multiple Translational Containment. Part
II: Exact Algorithms . . . . . . . . . . 183--218
Ioannis Z. Emiris and
John F. Canny and
Raimund Seidel Efficient Perturbations for Handling
Geometric Degeneracies . . . . . . . . . 219--242
Chandrajit L. Bajaj and
Fausto Bernardini and
Guoliang Xu Reconstructing Surfaces and Functions on
Surfaces from Unorganized
Three-Dimensional Data . . . . . . . . . 243--261
Martin L. Brady and
Donna J. Brown and
K. D. Powers Hexagonal Models for Channel Routing . . 263--290
Alok Aggarwal and
Dina Kravets and
James K. Park and
S. Sen Parallel Searching in Generalized Monge
Arrays . . . . . . . . . . . . . . . . . 291--317
J. F. Weng Expansion of Linear Steiner Trees . . . 318--330
Robert Giegerich and
Stefan Kurtz From Ukkonen to McCreight and Weiner: a
unifying view of linear-time suffix tree
construction . . . . . . . . . . . . . . 331--353
Zhi-Zhong Chen and
Xin He Parallel Algorithms for Maximal Acyclic
Sets . . . . . . . . . . . . . . . . . . 354--367
Gary L. Miller and
Shang-Hua Teng Tree-Based Parallel Algorithm Design . . 369--389
Boris V. Cherkassky and
Andrew V. Goldberg On Implementing the Push---Relabel
Method for the Maximum Flow Problem . . 390--410
Shun-Shii Lin and
Kwei-Jay Lin A Pinwheel Scheduler for Three Distinct
Numbers with a Tight Schedulability
Bound . . . . . . . . . . . . . . . . . 411--426
Therese C. Biedl and
Goos Kant and
Michael Kaufmann On Triangulating Planar Graphs Under the
Four-Connectivity Constraint . . . . . . 427--446
Gautam Das and
Sanjiv Kapoor and
Michiel H. M. Smid On the Complexity of Approximating
Euclidean Traveling Salesman Tours and
Minimum Spanning Trees . . . . . . . . . 447--460
Anne Condon and
Lata Narayanan Upper and Lower Bounds for Selection on
the Mesh . . . . . . . . . . . . . . . . 1--30
David Alberts and
Monika Rauch Henzinger Average-Case Analysis of Dynamic Graph
Algorithms . . . . . . . . . . . . . . . 31--60
Franz Aurenhammer and
F. Hoffmann and
Boris Aronov Minkowski-Type Theorems and
Least-Squares Clustering . . . . . . . . 61--76
Nader H. Bshouty and
Christino Tamon and
David K. Wilson On Learning Decision Trees with Large
Output Domains . . . . . . . . . . . . . 77--100
Joseph Y.-T.-T. Leung and
Tommy W. Tam and
C. S. Wong and
Gilbert H. Young Minimizing Mean Flow Time with Error
Constraint . . . . . . . . . . . . . . . 101--118
David Harel and
Meir Sardas An Algorithm for Straight-Line Drawing
of Planar Graphs . . . . . . . . . . . . 119--135
Ji\vrí Matou\vsek and
David M. Mount and
Nathan S. Netanyahu Efficient Randomized Algorithms for the
Repeated Median Line Estimator . . . . . 136--150
Guy Even and
Joseph Naor and
Baruch Schieber and
Madhu Sudan Approximating Minimum Feedback Sets and
Multicuts in Directed Graphs . . . . . . 151--174
Eric Torng A Unified Analysis of Paging and Caching 175--200
Dae Seoung Kim and
Kwan-Hee Yoo and
Kyung-Yong Chwa and
Sung Yong Shin Efficient Algorithms for Computing a
Complete Visibility Region in
Three-Dimensional Space . . . . . . . . 201--225
Kwan-Hee Yoo and
Dae Seoung Kim and
Sung Yong Shin and
Kyung-Yong Chwa Linear-Time Algorithms for Finding the
Shadow Volumes from a Convex Area Light
Source . . . . . . . . . . . . . . . . . 227--241
Yefim Dinitz and
Jeffery Westbrook Maintaining the classes of
$4$-edge-connectivity in a graph on-line 242--276
A. Gräf and
M. Stumpf and
G. Weißenfels On Coloring Unit Disk Graphs . . . . . . 277--293
Siu-Wing Cheng and
Michael Kaminski and
Shmuel Zaks Minimum Dominating Sets of Intervals on
Lines . . . . . . . . . . . . . . . . . 294--308
Tadao Takaoka Subcubic Cost Algorithms for the All
Pairs Shortest Path Problem . . . . . . 309--318
Evanthia Papadopoulou and
D. T. Lee A New Approach for the Geodesic
Vorono\u\i Diagram of Points in a Simple
Polygon and Other Restricted Polygonal
Domains . . . . . . . . . . . . . . . . 319--352
Maxime Crochemore and
Costas S. Iliopoulos and
M. Korda Two-Dimensional Prefix String Matching
and Covering on Square Matrices . . . . 353--373
Sudipto Guha and
Samir Khuller Approximation Algorithms for Connected
Dominating Sets . . . . . . . . . . . . 374--387
Martin Farach and
Mikkel Thorup String Matching in Lempel--Ziv
Compressed Strings . . . . . . . . . . . 388--404
Artur Czumaj and
Przemys\lawa Kanarek and
Miros\law Kuty\lowski and
Krzysztof Lory\'s Fast Generation of Random Permutations
Via Networks Simulation . . . . . . . . 2--20
Alan M. Frieze and
Wojciech Szpankowski Greedy Algorithms for the Shortest
Common Superstring That Are
Asymptotically Optimal . . . . . . . . . 21--36
Alfredo Viola and
Patricio V. Poblete The Analysis of Linear Probing Hashing
with Buckets . . . . . . . . . . . . . . 37--71
Luca Trevisan Parallel Approximation Algorithms by
Positive Linear Programming . . . . . . 72--88
Helmut Alt and
Ulrich Fuchs and
Günter Rote and
Gerald Weber Matching Convex Shapes with Respect to
the Symmetric Difference . . . . . . . . 89--103
Noga Alon and
Yossi Azar and
János Csirik and
Leah Epstein and
Sergey V. Sevastianov and
Arjen P. A. Vestjens and
Gerhard J. Woeginger On-Line and Off-Line Approximation
Algorithms for Vector Covering Problems 104--118
Esther M. Arkin and
Yi-Jen Chiang and
Martin Held and
Joseph S. B. Mitchell and
Vera Sacristan and
Steven Skiena and
Tae-Heng Yang On Minimum-Area Hulls . . . . . . . . . 119--136
Juha Kärkkäinen and
Erkki Sutinen Lempel--Ziv index for $q$-grams . . . . 137--154
J. Díaz and
M. J. Serna Introduction . . . . . . . . . . . . . . ??
Pierre Fraigniaud and
Cyril Gavoille Interval Routing Schemes . . . . . . . . 155--182
Arvind Gupta and
Naomi Nishimura Finding Largest Subtrees and Smallest
Supertrees . . . . . . . . . . . . . . . 183--210
Liang-Fang Chao and
Andrea S. LaPaugh Finding All Minimal Shapes in a Routing
Channel . . . . . . . . . . . . . . . . 211--244
Steven J. Phillips and
Jeffery Westbrook On-Line Load Balancing and Network Flow 245--261
Tao Jiang and
Richard M. Karp Mapping Clones with a Given Ordering or
Interleaving . . . . . . . . . . . . . . 262--284
Christos Levcopoulos and
Drago Krznaric A Linear-Time Approximation Scheme for
Minimum, Weight Triangulation of Convex
Polygons . . . . . . . . . . . . . . . . 285--311
Susanne Albers and
Michael Mitzenmacher Average Case Analyses of List Update
Algorithms, with Applications to Data
Compression . . . . . . . . . . . . . . 312--329
J. Friedman Computing Betti Numbers via
Combinatorial Laplacians . . . . . . . . 331--346
Ishai Ben-Aroya and
Donald D. Chinn and
Assaf Schuster A Lower Bound for Nearly Minimal
Adaptive and Hot Potato Algorithms . . . 347--376
Sanjeev Khanna and
Rajeev Motwani and
Randall H. Wilson On Certificates and Lookahead in Dynamic
Graph Problems . . . . . . . . . . . . . 377--394
Ka Wong Chong and
Tak Wah Lam Approximating Biconnectivity in Parallel 395--410
P. Auer and
W. Maass Introduction . . . . . . . . . . . . . . 1--2
Shai Ben-David Can Finite Samples Detect Singularities
of Real-Valued Functions? . . . . . . . 3--17
Douglas A. Cenzer and
William R. Moser A Good Oracle Is Hard to Beat . . . . . 18--34
Avrim Blum and
Alan M. Frieze and
Ravi Kannan and
Santosh Vempala A Polynomial-Time Algorithm for Learning
Noisy Linear Threshold Functions . . . . 35--52
Stephen Kwek and
Leonard Pitt PAC learning intersections of halfspaces
with membership queries . . . . . . . . 53--75
Amos Beimel and
Eyal Kushilevitz Learning Boxes in High Dimension . . . . 76--90
Nader H. Bshouty and
Christino Tamon and
David K. Wilson Learning Matrix Functions over Rings . . 91--111
Nicol\`o Cesa-Bianchi and
David P. Helmbold and
Sandra Panizza On Bayes Methods for On-Line Boolean
Prediction . . . . . . . . . . . . . . . 112--137
K. Hiraoka and
S. Amari Strategy Under the Unknown Stochastic
Environment: the Nonparametric
Lob---Pass Problem . . . . . . . . . . . 138--156
John Shawe-Taylor Classification Accuracy Based on
Observed Margin . . . . . . . . . . . . 157--172
R. Kamimura Minimizing $ \alpha $-Information for
Generalization and Interpretation . . . 173--197
S. M. Rüger A Class of Asymptotically Stable
Algorithms for Lea rning-Rate Adaptation 198--210
Alex J. Smola and
Bernhard Schölkopf On a Kernel-Based Method for Pattern
Recognition, Regression, Approximation,
and Operator Inversion . . . . . . . . . 211--231
D. Eppstein Guest Editor's Foreword . . . . . . . . 233--234
Philip N. Klein and
Sairam Subramanian A Fully Dynamic Approximation Scheme for
Shortest Paths in Planar Graphs . . . . 235--249
Daniele Frigioni and
Alberto Marchetti-Spaccamela and
Umberto Nanni Semidynamic Algorithms for Maintaining
Single-Source Shortest Path Trees . . . 250--274
Giuseppe F. Italiano and
Rajiv Ramaswami Maintaining Spanning Trees of Small
Diameter . . . . . . . . . . . . . . . . 275--304
Bala Swaminathan and
Kenneth J. Goldman An Incremental Distributed Algorithm for
Computing Biconnected Components in
Dynamic Graphs . . . . . . . . . . . . . 305--329
Greg N. Frederickson Maintaining regular properties
dynamically in $k$-terminal graphs . . . 330--350
Monika Rauch Henzinger and
Michael L. Fredman Lower Bounds for Fully Dynamic
Connectivity Problems in Graphs . . . . 351--362
H. Prodinger Preface . . . . . . . . . . . . . . . . 363--365
Helmut Prodinger and
Wojciech Szpankowski Philippe Flajolet's Research in Analysis
of Algorithms and Combinatorics . . . . 366--387
David Aldous A Metropolis-Type Optimization Algorithm
on the Infinite Tree . . . . . . . . . . 388--412
F. T. Bruss and
Michael Drmota and
Guy Louchard The Complete Solution of the Competitive
Rank Selection Problem . . . . . . . . . 413--447
Edward G. Coffman, Jr. and
Leopold Flatto and
P. Jelenkovi\'c and
Bjorn Poonen Packing Random Intervals On-Line . . . . 448--476
Luc Devroye and
Ernst P. Mücke and
Binhai Zhu A Note on Point Location in Delaunay
Triangulations of Random Points . . . . 477--482
Wenceslas Fernandez de la Vega and
Alan M. Frieze and
Miklos Santha Average-case analysis of the merging
algorithm of Hwang and Lin . . . . . . . 483--489
Philippe Flajolet and
Patricio V. Poblete and
Alfredo Viola On the Analysis of Linear Probing
Hashing . . . . . . . . . . . . . . . . 490--515
Micha Hofri and
Philippe Jacquet Saddle Points in Random Matrices:
Analysis of Knuth Search Algorithms . . 516--528
Hsien-Kuei Hwang Asymptotics of Divide-and-Conquer
Recurrences: Batcher's Sorting Algorithm
and a Minimum Euclidean Matching
Heuristic . . . . . . . . . . . . . . . 529--546
Charles Knessl A Note on the Asymptotic Behavior of the
Depth of Tries . . . . . . . . . . . . . 547--560
Donald E. Knuth Linear Probing and Graphs . . . . . . . 561--568
Hosam M. Mahmoud and
Robert T. Smythe Probabilistic analysis of Multiple Quick
Select . . . . . . . . . . . . . . . . . 569--584
Donatella Merlini and
Renzo Sprugnoli and
M. Cecilia Verri Average-Case Analysis for a Simple
Compression Algorithm . . . . . . . . . 585--599
Alois Panholzer and
Helmut Prodinger Average-Case Analysis of Priority Trees:
a Structure for Priority Queue
Administration . . . . . . . . . . . . . 600--630
Mireille Régnier and
Wojciech Szpankowski On Pattern Frequency Occurrences in a
Markovian Sequence . . . . . . . . . . . 631--649
Hadas Shachnai and
Micha Hofri The List Update Problem: Improved Bounds
for the Counter Scheme . . . . . . . . . 650--659
Brigitte Vallée Dynamics of the Binary Euclidean
Algorithm: Functional Analysis and
Operators . . . . . . . . . . . . . . . 660--685
Dennis Moore and
W. F. Smyth and
D. Miller Counting Distinct Strings . . . . . . . 1--13
Xiaotie Deng and
Elias Koutsoupias and
Philip D. MacKenzie Competitive Implementation of Parallel
Programs . . . . . . . . . . . . . . . . 14--30
P. Krishnan and
Philip M. Long and
Jeffrey Scott Vitter Adaptive Disk Spindown via Optimal
Rent-to-Buy in Probabilistic
Environments . . . . . . . . . . . . . . 31--56
Hristo N. Djidjev and
John R. Gilbert Separators in Graphs with Negative and
Multiple Vertex Weights . . . . . . . . 57--71
Lata Narayanan and
Jaroslav Opatrny Compact routing on chordal rings of
degree $4$ . . . . . . . . . . . . . . . 72--96
Luc Devroye A Note on the Expected Time for Finding
Maxima by List Algorithms . . . . . . . 97--108
S. Nicoloso and
Majid Sarrafzadeh and
X. Song On the Sum Coloring Problem on Interval
Graphs . . . . . . . . . . . . . . . . . 109--126
Ricardo A. Baeza-Yates and
Gonzalo Navarro Faster Approximate String Matching . . . 127--158
Konstantinos Kalpakis and
Yaacov Yesha Upper and Lower Bounds on the Makespan
of Schedules for Tree Dags on Linear
Arrays . . . . . . . . . . . . . . . . . 159--179
Marek Chrobak and
John Noga LRU is better than FIFO . . . . . . . . 180--185
Amir H. Farrahi and
D.-T. T. Lee and
Majid Sarrafzadeh Two-Way and Multiway Partitioning of a
Set of Intervals for Clique-Width
Maximization . . . . . . . . . . . . . . 187--210
Panos M. Pardalos and
G. Xue Algorithms for a Class of Isotonic
Regression Problems . . . . . . . . . . 211--222
Vincenzo Auletta and
Angelo Monti and
Mimmo Parente and
Pino Persiano A Linear-Time Algorithm for the
Feasibility of Pebble Motion on Trees 223--245
Arne Andersson and
N. Jesper Larsson and
Kurt Swanson Suffix Trees on Words . . . . . . . . . 246--260
G. Ramalingam and
J. Song and
Leo Joskowicz and
R. E. Miller Solving Systems of Difference
Constraints Incrementally . . . . . . . 261--275
Jin-yi Cai and
C. K. Wong Foreword . . . . . . . . . . . . . . . . 277
Matthew Andrews and
Michel X. Goemans and
Lisa Zhang Improved Bounds for On-Line Load
Balancing . . . . . . . . . . . . . . . 278--301
Giuseppe Di Battista and
Roberto Tamassia and
Luca Vismara Output-Sensitive Reporting of Disjoint
Paths . . . . . . . . . . . . . . . . . 302--340
Vince Grolmusz Harmonic Analysis, Real Approximation,
and the Communication Complexity of
Boolean Functions . . . . . . . . . . . 341--353
Guoliang Xue and
Ding-Zhu Du An $ O(n \log n) $ Average Time
Algorithm for Computing the Shortest
Network under a Given Topology . . . . . 354--362
Jay Belanger and
Aduri Pavan and
J. Wang Reductions Do Not Preserve Fast
Convergence Rates in Average Time . . . 363--373
Monika Rauch Henzinger and
Valerie King and
Tandy Warnow Constructing a Tree from Homeomorphic
Subtrees, with Applications to
Computational Evolutionary Biology . . . 1--13
Yanjun Zhang and
A. Ortynski Efficiency of Randomized Parallel
Backtrack Search . . . . . . . . . . . . 14--28
Stefano Leonardi and
Alberto Marchetti-Spaccamela On-Line Resource Management with
Application to Routing and Scheduling 29--49
Svante Carlsson and
B. J. Nilsson Computing Vision Points in Polygons . . 50--75
Paul Pritchard A Fast Bit-Parallel Algorithm for
Computing the Subset Partial Order . . . 76--86
Bin Fu and
Richard Beigel A Comparison of Resource-Bounded
Molecular Computation Models . . . . . . 87--95
Haim Kaplan and
Ron Shamir Bounded Degree Interval Sandwich
Problems . . . . . . . . . . . . . . . . 96--104
Koichi Yamazaki and
Hans L. Bodlaender and
Babette de Fluiter and
Dimitrios M. Thilikos Isomorphism for Graphs of Bounded
Distance Width . . . . . . . . . . . . . 105--127
S. Ravi Kumar and
A. Russell and
Ravi Sundaram Approximating Latin Square Extensions 128--138
Frank Thomson Leighton and
Eric J. Schwabe Efficient Algorithms for Dynamic
Allocation of Distributed Memory . . . . 139--171
Frank K. H. A. Dehne Guest Editor's Introduction . . . . . . 173--176
Paolo Ferragina and
Fabrizio Luccio String Search in Coarse-Grained Parallel
Computers . . . . . . . . . . . . . . . 177--194
Afonso Ferreira and
Claire Kenyon and
Andrew Rau-Chaplin and
Stéphane Ubéda $d$-dimensional range search on
multicomputers . . . . . . . . . . . . . 195--208
Armin Bäumker and
Wolfgang Dittrich and
Andrea Pietracaprina The Complexity of Parallel Multisearch
on Coarse-Grained Machines . . . . . . . 209--242
Guy E. Blelloch and
G. L. Miller and
Jonathan C. Hardwick and
Dafna Talmor Design and Implementation of a Practical
Parallel Delaunay Algorithm . . . . . . 243--269
Xiaotie Deng and
Binhai Zhu A Randomized Algorithm for the
Vorono\u\i Diagram of Line Segments on
Coarse-Grained Multiprocessors . . . . . 270--286
William F. McColl and
Alexandre Tiskin Memory-Efficient Matrix Multiplication
in the BSP Model . . . . . . . . . . . . 287--297
Yong Won Lim and
Prashanth B. Bhat and
Viktor K. Prasanna Efficient Algorithms for Block-Cyclic
Redistribution of Arrays . . . . . . . . 298--330
Erich Kaltofen and
A. Lobo Distributed Matrix-Free Solution of
Large Sparse Linear Systems over Finite
Fields . . . . . . . . . . . . . . . . . 331--348
Thomas H. Cormen and
James C. Clippinger Performing BMMC Permutations Efficiently
on Distributed-Memory Multiprocessors
with MPI . . . . . . . . . . . . . . . . 349--370
E. L. G. Saukas and
S. W. Song A Note on Parallel Selection on
Coarse-Grained Multicomputers . . . . . 371--380
M. Adler and
Phillip B. Gibbons and
Yossi Matias and
Vijaya Ramachandran Modeling Parallel Bandwidth: Local
versus Global Restrictions . . . . . . . 381--404
Gianfranco Bilardi and
Andrea Pietracaprina and
Geppino Pucci and
Kieran T. Herley and
Paul G. Spirakis BSP versus LogP . . . . . . . . . . . . 405--421
Ming-Yang Kao and
A. S. Kyle and
P. Lakner Guest Editors' Foreword . . . . . . . . 1
Prasad Chalasani and
Somesh Jha and
Isaac Saias Approximate Option Pricing . . . . . . . 2--21
Yossi Azar and
Yair Bartal and
Esteban Feuerstein and
Amos Fiat and
Stefano Leonardi and
Adi Rosén On Capital Investment . . . . . . . . . 22--36
C. G. Lambert and
S. E. Harrington and
C. R. Harvey and
A. Glodjo Efficient On-Line Nonparametric Kernel
Density Estimation . . . . . . . . . . . 37--57
E. J. Kontoghiorghes Parallel Strategies for Computing the
Orthogonal Factorizations Used in the
Estimation of Econometric Models . . . . 58--74
L. N. Coyle and
J. J. Yang Analysis of the SSAP Method for the
Numerical Valuation of High-Dimensional
Multivariate American Securities . . . . 75--98
Sabah al-Binali A Risk-Reward Framework for the
Competitive Analysis of Financial Games 99--115
Ran El-Yaniv and
R. Kaniel and
Nathan Linial Competitive Optimal On-Line Leasing . . 116--140
Dan Gusfield and
Ming-Yang Kao Guest Editors' Foreword . . . . . . . . 141
John H. Reif Parallel Biomolecular Computation:
Models and Simulations . . . . . . . . . 142--175
B. DasGupta and
X. He and
Tao Jiang and
Ming Li and
John Tromp On the Linear-Cost Subtree-Transfer
Distance between Phylogenetic Trees . . 176--195
Paul E. Kearney and
Ryan B. Hayward and
Henk Meijer Evolutionary Trees and Ordinal
Assertions . . . . . . . . . . . . . . . 196--221
Richard Beigel and
Bin Fu Molecular Computing, Bounded
Nondeterminism, and Efficient Recursion 222--238
Mitsunori Ogihara and
Animesh Ray Simulating Boolean Circuits on a DNA
Computer . . . . . . . . . . . . . . . . 239--250
Kevin Atteson The Performance of Neighbor-Joining
Methods of Phylogenetic Reconstruction 251--278
John Atkins and
William E. Hart On the Intractability of Protein Folding
with a Finite Alphabet of Amino Acids 279--294
Laxmi Parida and
Dan Geiger Mass Estimation of DNA Molecules and
Extraction of Ordered Restriction Maps
in Optical Mapping Imagery . . . . . . . 295--310
Mary Cryan and
Leslie Ann Goldberg and
Cynthia A. Phillips Approximation Algorithms for the
Fixed-Topology Phylogenetic Number
Problem . . . . . . . . . . . . . . . . 311--329
T. C. Ip and
Vincemt A. Fischetti and
Jeanette P. Schmidt An Algorithm for Identifying Similar
Amino Acid Clusters among Different
Alpha-Helical Coiled-Coil Proteins Using
Their Secondary Structure . . . . . . . 330--346
Paul W. Finn and
Lydia E. Kavraki Computational Approaches to Drug Design 347--371
Ioannis Z. Emiris and
Bernard Mourrain Computer Algebra Methods for Studying
and Computing Molecular Conformations 372--402
Joan Boyar and
Kim S. Larsen The Seat Reservation Problem . . . . . . 403--417
Martin Zachariasen and
Pawel Winter Concatenation-based greedy heuristics
for the Euclidean Steiner tree problem 418--437
Manfred Kunde and
Rolf Niedermeier and
Klaus Reinhardt and
Peter Rossmanith Optimal Deterministic Sorting and
Routing on Grids and Tori with Diagonals 438--458
Takao Nishizeki and
Roberto Tamassia and
Dorothea Wagner Foreword . . . . . . . . . . . . . . . . 1--2
Xiao Zhou and
Syurei Tamura and
Takao Nishizeki Finding edge-disjoint paths in partial
$k$-trees . . . . . . . . . . . . . . . 3--30
Shiva Chaudhuri and
K. V. Subrahmanyam and
Frank Wagner and
Christos D. Zaroliagis Computing Mimicking Networks . . . . . . 31--49
Hiroshi Nagamochi and
S. Nakamura and
Toshihide Ibaraki A Simplified $ \tilde {O}(n m) $ Time
Edge-Splitting Algorithm in Undirected
Graphs . . . . . . . . . . . . . . . . . 50--67
Ulrich Fößmeier and
Michael Kaufmann On Exact Solutions for the Rectilinear
Steiner Tree Problem. Part I:
Theoretical Results . . . . . . . . . . 68--99
Achilleas Papakostas and
Ioannis G. Tollis Efficient Orthogonal Drawings of High
Degree Graphs . . . . . . . . . . . . . 100--125
Karsten Weihe and
Thomas Willhalm Reconstructing the Topology of a CAD
Model --- a Discrete Approach . . . . . 126--147
Rolf H. Möhring and
Matthias Müller-Hannemann Complexity and Modeling Aspects of Mesh
Refinement into Quadrilaterals . . . . . 148--171
Michael Jünger and
G. Rinaldi and
S. Thienel Practical Performance of Efficient
Minimum Cut Algorithms . . . . . . . . . 172--195
Esther M. Arkin and
Martin Held and
Christopher L. Smith Optimization Problems Related to Zigzag
Pocket Machining . . . . . . . . . . . . 197--236
Pascal Berthomé and
Afonso Ferreira and
Bruce M. Maggs and
Stéphane Perennes and
C. Greg Plaxton Sorting-Based Selection Algorithms for
Hypercubic Networks . . . . . . . . . . 237--254
Ee-Chien Chang and
Chee K. Yap A Simultaneous Search Problem . . . . . 255--262
M. G. Andrews and
Mikhail J. Atallah and
Danny Z. Chen and
D. T. Lee Parallel Algorithms for Maximum Matching
in Complements of Interval Graphs and
Related Problems . . . . . . . . . . . . 263--289
Takeaki Uno and
Mutsunori Yagiura Fast Algorithms to Enumerate All Common
Intervals of Two Permutations . . . . . 290--309
Rajeev Motwani and
P. Raghavan Guest Editors' Foreword . . . . . . . . 311--312
S. Akella and
Wes H. Huang and
Kevin M. Lynch and
Matthew T. Mason Parts Feeding on a Conveyor with a One
Joint Robot . . . . . . . . . . . . . . 313--344
Marek Teichmann and
Bud Mishra Probabilistic Algorithms for Efficient
Grasping and Fixturing . . . . . . . . . 345--363
Amy J. Briggs and
Bruce Randall Donald Visibility-Based Planning of Sensor
Control Strategies . . . . . . . . . . . 364--388
Karl-Friedrich Böhringer and
V. Bhatt and
Bruce Randall Donald and
Ken Goldberg Algorithms for Sensorless Manipulation
Using a Vibrating Surface . . . . . . . 389--429
Steven M. LaValle Robot Motion Planning: a Game-Theoretic
Foundation . . . . . . . . . . . . . . . 430--465
A. Sudsang and
J. Ponce and
N. Srinivasa Grasping and In-Hand Manipulation:
Geometry and Algorithms . . . . . . . . 466--493
A. Frank van der Stappen and
Ken Goldberg and
M. H. Overmars Geometric Eccentricity and the
Complexity of Manipulation Plans . . . . 494--514
R. G. Brown and
Bruce Randall Donald Mobile Robot Self-Localization without
Explicit Landmarks . . . . . . . . . . . 515--559
A. Marigo and
Marco Ceccarelli and
S. Piccinocchi and
A. Bicchi Planning Motions of Polyhedral Parts by
Rolling . . . . . . . . . . . . . . . . 560--576
Dan Halperin and
Jean-Claude Latombe and
Randall H. Wilson A General Framework for Assembly
Planning: The Motion Space Approach . . 577--601
Steven Fortune Introduction . . . . . . . . . . . . . . 1--4
Kokichi Sugihara and
Masao Iri and
Hiroshi Inagaki and
T. Imai Topology-Oriented Implementation --- An
Approach to Robust Geometric Algorithms 5--20
Hervé Brönnimann and
Mariette Yvinec Efficient Exact Evaluation of Signs of
Determinants . . . . . . . . . . . . . . 21--56
Victor J. Milenkovic Shortest Path Geometric Rounding . . . . 57--86
Christoph Burnikel and
Rudolf Fleischer and
Kurt Mehlhorn and
Stefan Schirra A Strong and Easily Computable
Separation Bound for Arithmetic
Expressions Involving Radicals . . . . . 87--99
Chandrajit L. Bajaj and
Andrew V. Royappa Parameterization in Finite Precision . . 100--114
Luca Trevisan Erratum: ``Parallel approximation
algorithms by positive linear
programming'' [Algorithmica \bf 21
(1998), no. 1, 72--88; MR1612219
(99a:90130)] . . . . . . . . . . . . . . 115--119
Sanjiv Kapoor and
H. Ramesh An Algorithm for Enumerating All
Spanning Trees of a Directed Graph . . . 120--130
Reuven Bar-Yehuda One for the Price of Two: a Unified
Approach for Approximating Covering
Problems . . . . . . . . . . . . . . . . 131--144
Gonzalo Navarro and
Eduardo F. Barbosa and
Ricardo A. Baeza-Yates and
Walter Cunto and
Nivio Ziviani Binary Searching with Nonuniform Costs
and Its Application to Text Retrieval 145--169
Elmar Schömer and
Jürgen Sellen and
Marek Teichmann and
Chee K. Yap Smallest Enclosing Cylinders . . . . . . 170--186
G. Sajith and
Sanjeev Saxena Optimal Sublogarithmic Time Parallel
Algorithms on Rooted Forests . . . . . . 187--197
Nili Guttmann-Beck and
Refael Hassin Approximation Algorithms for Minimum
$K$-Cut . . . . . . . . . . . . . . . . 198--207
Hans L. Bodlaender Introduction . . . . . . . . . . . . . . 209--211
Shiva Chaudhuri and
Christos D. Zaroliagis Shortest Paths in Digraphs of Small
Treewidth. Part I: Sequential Algorithms 212--226
Xiao Zhou and
K. Fuse and
Takao Nishizeki A Linear Algorithm for Finding [$g$,
$f$]-Colorings of Partial $k$-Trees . . 227--243
Stephen Alstrup and
Peter W. Lauridsen and
Mikkel Thorup Generalized Dominators for Structured
Programs . . . . . . . . . . . . . . . . 244--253
Arvind Gupta and
Damon Kaller and
Thomas C. Shermer Linear-Time Algorithms for Partial
$k$-Tree Complements . . . . . . . . . . 254--274
David Eppstein Diameter and Treewidth in Minor-Closed
Graph Families . . . . . . . . . . . . . 275--291
Torben Hagerup Dynamic Algorithms for Graphs of Bounded
Treewidth . . . . . . . . . . . . . . . 292--315
C. Lucet and
J.-F. Manouvrier and
J. Carlier Evaluating Network Reliability and
2-Edge-Connected Reliability in Linear
Time for Bounded Pathwidth Graphs . . . 316--336
Anders Dessmark and
Andrzej Lingas and
Andrzej Proskurowski Faster algorithms for subgraph
isomorphism of $k$-connected partial
$k$-trees . . . . . . . . . . . . . . . 337--347
Damon Kaller Definability equals recognizability of
partial $3$-trees and $k$-connected
partial $k$-trees . . . . . . . . . . . 348--381
Bengt Aspvall and
Andrzej Proskurowski and
Jan Arne Telle Memory requirements for table
computations in partial $k$-tree
algorithms . . . . . . . . . . . . . . . 382--394
Sheng-Lung Peng and
Ming-Tat Ko and
Chin-Wen Ho and
Tsan-sheng Hsu and
Chuan Yi Tang Graph Searching on Some Subclasses of
Chordal Graphs . . . . . . . . . . . . . 395--426
Gerhard J. Woeginger Introduction . . . . . . . . . . . . . . 1
Johannes Blömer Denesting by Bounded Degree Radicals . . 2--15
Ulrik Brandes and
Dorothea Wagner A Linear Time Algorithm for the Arc
Disjoint Menger Problem in Planar
Directed Graphs . . . . . . . . . . . . 16--36
Krzysztof Diks and
Andrzej Pelc Optimal Adaptive Broadcasting with a
Bounded Fraction of Faulty Nodes . . . . 37--50
Hristo N. Djidjev Partitioning Planar Graphs with Vertex
Costs: Algorithms and Applications . . . 51--75
Daniele Frigioni and
Giuseppe F. Italiano Dynamically Switching Vertices in Planar
Graphs . . . . . . . . . . . . . . . . . 76--103
Vladimir Grebinski and
Gregory Kucherov Optimal Reconstruction of Graphs under
the Additive Model . . . . . . . . . . . 104--124
Bala Kalyanasundaram and
Kirk Pruhs Fault-Tolerant Real-Time Scheduling . . 125--144
Luca Trevisan Approximating Satisfiable Satisfiability
Problems . . . . . . . . . . . . . . . . 145--172
Steven S. Seiden Online Randomized Multiprocessor
Scheduling . . . . . . . . . . . . . . . 173--216
Danny Z. Chen and
Wei Chen and
Koichi Wada and
Kimio Kawaguchi Parallel Algorithms for Partitioning
Sorted Sets and Related Problems . . . . 217--241
Eric Ruppert Finding the $k$ shortest paths in
parallel . . . . . . . . . . . . . . . . 242--254
Teofilo F. Gonzalez Simple Algorithms for the On-Line
Multidimensional Dictionary and Related
Problems . . . . . . . . . . . . . . . . 255--267
Bala Kalyanasundaram and
Kirk R. Pruhs and
Eric Torng Errata: ``A new algorithm for scheduling
periodic, real-time tasks''
[Algorithmica \bf 4 (1989), no. 4,
209--219; MR0988726 (90k:68017)] by J.
Y.-T. Leung . . . . . . . . . . . . . . 269--270
John H. Reif and
S. R. Tate Fast Spatial Decomposition and Closest
Pair Computation for Limited Precision
Input . . . . . . . . . . . . . . . . . 271--287
Desh Ranjan and
Enrico Pontelli and
Gopal Gupta and
Luc Longpré The Temporal Precedence Problem . . . . 288--306
J. García-López and
P. A. Ramos A Unified Approach to Conic Visibility 307--322
Lenwood S. Heath and
J. P. C. Vergara Sorting by Short Block-Moves . . . . . . 323--352
Mark de Berg Linear Size Binary Space Partitions for
Uncluttered Scenes . . . . . . . . . . . 353--366
Hristo N. Djidjev and
Grammati E. Pantziou and
Christos D. Zaroliagis Improved Algorithms for Dynamic Shortest
Paths . . . . . . . . . . . . . . . . . 367--389
Hsiao-Feng Steven Chen and
D. T. Lee A Faster One-Dimensional Topological
Compaction Algorithm with Jog Insertion 390--421
Nili Guttmann-Beck and
Refael Hassin and
Samir Khuller and
Balaji Raghavachari Approximation Algorithms with Bounded
Performance Guarantees for the Clustered
Traveling Salesman Problem . . . . . . . 422--437
Bruce M. Maggs and
Berthold Vöcking Improved Routing and Sorting on
Multibutterflies . . . . . . . . . . . . 438--464
Helmut Prodinger and
Wojciech Szpankowski Average-Case Analysis of Algorithms ---
Preface . . . . . . . . . . . . . . . . 1--2
U. Rösler and
L. Rüschendorf The Contraction Method for Recursive
Algorithms . . . . . . . . . . . . . . . 3--33
George E. Andrews and
Arnold Knopfmacher An algorithmic approach to discovering
and proving $q$-series identities . . . 34--43
H.-H. Chern and
Hsien-Kuei Hwang Transitional behaviors of the average
cost of Quicksort with median-of-$ (2 t
+ 1) $ . . . . . . . . . . . . . . . . . 44--69
Edward G. Coffman, Jr. and
Alexander L. Stolyar Bandwidth Packing . . . . . . . . . . . 70--88
Michael Drmota An Analytic Approach to the Height of
Binary Search Trees . . . . . . . . . . 89--119
Michael Drmota and
Dani\`ele Gardy and
B. Gittenberger A Unified Presentation of Some Urn
Models . . . . . . . . . . . . . . . . . 120--147
J. C. Hansen and
E. Schmutz Near-Optimal Bounded-Degree Spanning
Trees . . . . . . . . . . . . . . . . . 148--180
Conrado Martínez and
Alois Panholzer and
Helmut Prodinger Partial Match Queries in Relaxed
Multidimensional Search Trees . . . . . 181--204
Daniel Panario and
B. Richmond Smallest Components in Decomposable
Structures: Exp-Log Class . . . . . . . 205--226
Patricio V. Poblete Analysis of an Adaptive Algorithm to
Find the Two Nearest Neighbors . . . . . 227--237
U. Rösler On the Analysis of Stochastic Divide and
Conquer Algorithms . . . . . . . . . . . 238--261
Brigitte Vallée Dynamical Sources in Information Theory:
Fundamental Intervals and Word Prefixes 262--306
Julien Clément and
Philippe Flajolet and
Brigitte Vallée Dynamical Sources in Information Theory:
a General Analysis of Trie Structures 307--369
S. Mahajan and
E. A. Ramos and
K. V. Subrahmanyam Solving Some Discrepancy Problems in NC 371--395
L. Narayanan and
S. M. Shende Static Frequency Assignment in Cellular
Networks . . . . . . . . . . . . . . . . 396--409
U. Feige and
G. Kortsarz and
D. Peleg The dense $k$-subgraph problem . . . . . 410--421
A. Avidor and
Y. Azar and
J. Sgall Ancient and New Algorithms for Load
Balancing in the $ l_p $ Norm . . . . . 422--441
H. Shachnai and
T. Tamir On Two Class-Constrained Versions of the
Multiple Knapsack Problem . . . . . . . 442--467
M. J. Atallah and
F. Chyzak and
P. Dumas A Randomized Algorithm for Approximate
String Matching . . . . . . . . . . . . 468--486
J. H. Reif Efficient Parallel Computation of the
Characteristic Polynomial of a Sparse,
Separable Matrix . . . . . . . . . . . . 487--510
T. F. Gonzalez Simple Algorithms for Multimessage
Multicasting with Forwarding . . . . . . 511--533
H. L. Bodlaender and
B. van Antwerpen--de Fluiter Parallel Algorithms for Series Parallel
Graphs and Graphs with Treewidth Two . . 534--559
G. Ausiello and
E. Feuerstein and
S. Leonardi and
L. Stougie and
M. Talamo Algorithms for the On-Line Travelling
Salesman . . . . . . . . . . . . . . . . 560--581
S. N. Kabadi and
Y. P. Aneja Equivalence of $ \epsilon $-Approximate
Separation and Optimization in Fixed
Dimensions . . . . . . . . . . . . . . . 582--594
R. Bar-Yehuda and
D. Rawitz Efficient Algorithms for Integer
Programs with Two Variables per
Constraint . . . . . . . . . . . . . . . 595--609
R. Battiti and
M. Protasi Reactive Local Search for the Maximum
Clique Problem . . . . . . . . . . . . . 610--637
J. F. Weng and
J. MacGregor Smith Steiner Minimal Trees with One Polygonal
Obstacle . . . . . . . . . . . . . . . . 638--648
D. Fernández-Baca On Nonlinear Parametric Search . . . . . 1--11
T. W. Lam and
F. L. Yue Optimal Edge Ranking of Trees in Linear
Time . . . . . . . . . . . . . . . . . . 12--33
A. M. Ben-Amram and
Z. Galil A Generalization of a Lower Bound
Technique due to Fredman and Saks . . . 34--66
J.-D. Boissonnat and
J. Czyzowicz and
O. Devillers and
M. Yvinec Circular Separability of Polygons . . . 67--82
D. J. Rosenkrantz and
L. Yu and
S. S. Ravi Efficient Construction of Minimum
Makespan Schedules for Tasks with a
Fixed Number of Distinct Execution Times 83--100
R. El-Yaniv and
A. Fiat and
R. M. Karp and
G. Turpin Optimal Search and One-Way Trading
Online Algorithms . . . . . . . . . . . 101--139
M. van Kreveld Guest Editor's Foreword . . . . . . . . 141--143
C. Gold and
J. Snoeyink A One-Step Crust and Skeleton Extraction
Algorithm . . . . . . . . . . . . . . . 144--163
A. Amir and
A. Efrat and
P. Indyk and
H. Samet Efficient Regular Data Structures and
Algorithms for Dilation, Location, and
Proximity Problems . . . . . . . . . . . 164--187
D. Papadias and
N. Mamoulis and
Y. Theodoridis Constraint-Based Processing of Multiway
Spatial Joins . . . . . . . . . . . . . 188--215
V. Estivill-Castro and
M. E. Houle Robust Distance-Based Clustering with
Applications to Spatial Data Mining . . 216--242
J. J. Little and
P. Shi Structural Lines, TINs, and DEMs . . . . 243--263
W. Evans and
D. Kirkpatrick and
G. Townsend Right-Triangulated Irregular Networks 264--286
M. Lonergan and
C. B. Jones An Iterative Displacement Method for
Conflict Resolution in Map
Generalization . . . . . . . . . . . . . 287--301
W. A. Mackaness and
R. S. Purves Automated Displacement for Large Numbers
of Discrete Map Objects . . . . . . . . 302--311
N. Regnauld Contextual Building Typification in
Automated Map Generalization . . . . . . 312--333
F. Wagner and
A. Wolff and
V. Kapoor and
T. Strijk Three Rules Suffice for Good Label
Placement . . . . . . . . . . . . . . . 334--349
K. Jansen and
J. Rolim Guest Editors' Introduction . . . . . . 351--352
J. Cheriyan and
T. Jordán and
Z. Nutov On Rooted Node-Connectivity Problems . . 353--375
P. Tetali and
S. Vempala Random Sampling of Euler Tours . . . . . 376--385
M. Karpinski Polynomial Time Approximation Schemes
for Some Dense Instances of NP-Hard
Optimization Problems . . . . . . . . . 386--397
M. I. Sviridenko Best possible approximation algorithm
for MAX SAT with cardinality constraint 398--405
V. Kumar An Approximation Algorithm for Circular
Arc Colouring . . . . . . . . . . . . . 406--417
M. Saks and
S. Zhou Sample Spaces with Small Bias on
Neighborhoods and Error-Correcting
Communication Protocols . . . . . . . . 418--431
G. Kortsarz On the Hardness of Approximating
Spanners . . . . . . . . . . . . . . . . 432--450
C. Baur and
S. P. Fekete Approximation of Geometric Dispersion
Problems . . . . . . . . . . . . . . . . 451--470
G. F. Italiano Guest Editor's Introduction . . . . . . 471--472
G. Navarro and
R. Baeza-Yates Improving an Algorithm for Approximate
Pattern Matching . . . . . . . . . . . . 473--502
A. L. Buchsbaum and
R. Giancarlo and
J. R. Westbrook An Approximate Determinization Algorithm
for Weighted Finite-State Automata . . . 503--526
M. Lanthier and
A. Maheshwari and
J.-R. Sack Approximating Shortest Paths on Weighted
Polyhedral Surfaces . . . . . . . . . . 527--562
M. Held FIST: fast industrial-strength
triangulation of polygons . . . . . . . 563--596
T. Christof and
G. Reinelt Algorithmic Aspects of Using Small
Instance Relaxations in Parallel
Branch-and-Cut . . . . . . . . . . . . . 597--629
B. de Jager and
J. Banens VISOR: vast independence system
optimization routine . . . . . . . . . . 630--644
M. Lee and
W. Liu and
V. K. Prasanna Parallel Implementation of a Class of
Adaptive Signal Processing Applications 645--684
B. Codenotti and
M. Leoncini and
F. P. Preparata The Role of Arithmetic in Fast Parallel
Matrix Inversion . . . . . . . . . . . . 685--707
V. Y. Pan and
Y. Yu Certification of Numerical Computation
of the Sign of the Determinant of a
Matrix . . . . . . . . . . . . . . . . . 708--724
A. Efrat and
A. Itai and
M. J. Katz Geometry Helps in Bottleneck Matching
and Related Problems . . . . . . . . . . 1--28
B. Awerbuch and
Y. Azar and
A. Fiat and
S. Leonardi and
A. Rosén On-Line Competitive Algorithms for Call
Admission in Optical Networks . . . . . 29--43
J. C. Cogolludo and
S. Rajasekaran Permutation Routing on Reconfigurable
Meshes . . . . . . . . . . . . . . . . . 44--57
R. Ravi and
M. V. Marathe and
S. S. Ravi and
D. J. Rosenkrantz and
H. B. Hunt, III Approximation Algorithms for
Degree-Constrained Minimum-Cost
Network-Design Problems . . . . . . . . 58--78
S. Eidenbenz and
C. Stamm and
P. Widmayer Inapproximability Results for Guarding
Polygons and Terrains . . . . . . . . . 79--113
J. Csirik and
D. S. Johnson Bounded Space On-Line Bin Packing: Best
Is Better than First . . . . . . . . . . 115--138
M. C. Golumbic and
T. Hirst and
M. Lewenstein Uniquely Restricted Matchings . . . . . 139--154
L. Narayanan and
J. Opatrny and
D. Sotteau All-to-All Optical Routing in Chordal
Rings of Degree 4 . . . . . . . . . . . 155--178
N. Gupta and
S. Sen An Efficient Output-Size Sensitive
Parallel Algorithm for Hidden-Surface
Removal for Terrains . . . . . . . . . . 179--207
M. Yamashita and
H. Umemoto and
I. Suzuki and
T. Kameda Searching for Mobile Intruders in a
Polygonal Region by a Group of Mobile
Searchers . . . . . . . . . . . . . . . 208--236
R. Kemp and
H. Prodinger Preface . . . . . . . . . . . . . . . . 237--239
V. Choi and
M. J. Golin Lopsided trees. I. Analyses . . . . . . 240--290
L. Devroye On the Probabilistic Worst-Case Time of
``Find'' . . . . . . . . . . . . . . . . 291--303
M. Drmota The Asymptotic Number of Leftist Trees 304--317
P. Jacquet and
W. Szpankowski and
J. Tang Average profile of the Lempel--Ziv
parsing scheme for a Markovian source 318--360
P. Flajolet and
G. Louchard Analytic Variations on the Airy
Distribution . . . . . . . . . . . . . . 361--377
M. Hofri and
H. Shachnai Efficient Reorganization of Binary
Search Trees . . . . . . . . . . . . . . 378--402
T. Tsukiji and
H. Mahmoud A Limit Law for Outputs in Random
Recursive Circuits . . . . . . . . . . . 403--412
D. Panario and
B. Richmond Exact Largest and Smallest Size of
Components . . . . . . . . . . . . . . . 413--432
H. Prodinger A $q$-analogue of the path length of
binary search trees . . . . . . . . . . 433--441
R. T. Smythe and
J. Wellner Stochastic Analysis of Shell Sort . . . 442--457
P. A. Beling Exact Algorithms for Linear Programming
over Algebraic Extensions . . . . . . . 459--478
G. Xue and
G.-H. Lin and
D.-Z. Du Grade of Service Steiner Minimum Trees
in the Euclidean Plane . . . . . . . . . 479--500
K. S. Larsen and
E. Soisalon-Soininen and
P. Widmayer Relaxed Balance Using Standard Rotations 501--512
R. L. Milidiú and
E. S. Laber Bounding the Inefficiency of
Length-Restricted Prefix Codes . . . . . 513--529
B. Das and
M. C. Loui Reconstructing a Minimum Spanning Tree
after Deletion of Any Node . . . . . . . 530--547
A. Crauser and
P. Ferragina A Theoretical and Experimental Study on
the Construction of Suffix Arrays in
External Memory . . . . . . . . . . . . 1--35
E. Feuerstein and
A. Strejilevich de Loma On-Line Multi-Threaded Paging . . . . . 36--60
J. G. Del Greco and
C. N. Sekharan and
R. Sridhar Fast parallel reordering and isomorphism
testing of $k$-trees . . . . . . . . . . 61--72
D. Gusfield and
C. Martel The Structure and Complexity of Sports
Elimination Numbers . . . . . . . . . . 73--86
D. Eppstein and
M. W. Bern and
B. Hutchings Algorithms for Coloring Quadtrees . . . 87--94
Y. Li and
W. F. Smyth Computing the Cover Array in Linear Time 95--106
T. Kimbrel Interleaved Prefetching . . . . . . . . 107--122
S. Albers and
K. Kursawe and
S. Schuierer Exploring Unknown Environments with
Obstacles . . . . . . . . . . . . . . . 123--143
C. Levcopoulos and
G. Narasimhan and
M. Smid Improved Algorithms for Constructing
Fault-Tolerant Spanners . . . . . . . . 144--156
E. Bax and
J. Franklin A Permanent Algorithm with $ \exp
[\Omega (n^{1 / 3} / 2 \ln n)] $
Expected Speedup for $0$--$1$ Matrices 157--162
C. A. Phillips and
C. Stein and
E. Torng and
J. Wein Optimal Time-Critical Scheduling via
Resource Augmentation . . . . . . . . . 163--200
R. Bachrach and
R. El-Yaniv and
M. Reinstädtler On the Competitive Theory and Practice
of Online List Accessing Algorithms . . 201--246
A. K. Amoura and
E. Bampis and
C. Kenyon and
Y. Manoussakis Scheduling Independent Multiprocessor
Tasks . . . . . . . . . . . . . . . . . 247--261
Y. Kamidoi and
S. Wakabayashi and
N. Yoshida A divide-and-conquer approach to the
minimum $k$-way cut problem . . . . . . 262--276
M. Andrews and
M. A. Bender and
L. Zhang New Algorithms for Disk Scheduling . . . 277--301
O. Goldreich and
D. Ron Property Testing in Bounded Degree
Graphs . . . . . . . . . . . . . . . . . 302--343
J. F. Sibeyn One-by-One Cleaning for Practical
Parallel List Ranking . . . . . . . . . 345--363
A. M. Ben-Amram and
Z. Galil Lower Bounds for Dynamic Data Structures
on Algebraic RAMs . . . . . . . . . . . 364--395
D. A. Fotakis and
P. G. Spirakis Minimum Congestion Redundant Assignments
to Tolerate Random Faults . . . . . . . 396--422
S. Landau and
N. Immerman Embedding Linkages on an Integer Lattice 423--436
J. Abello and
A. L. Buchsbaum and
J. R. Westbrook A Functional Approach to External Graph
Algorithms . . . . . . . . . . . . . . . 437--458
E. Cohen and
H. Kaplan Caching Documents with Variable Sizes
and Fetching Costs: An LP-Based Approach 459--466
T. Erlebach and
T. Hagerup Routing Flow Through a Strongly
Connected Graph . . . . . . . . . . . . 467--473
P. Bertolazzi and
G. Di Battista and
W. Didimo Quasi-Upward Planarity . . . . . . . . . 474--506
K. Jansen and
L. Porkolab Linear-Time Approximation Schemes for
Scheduling Malleable Parallel Tasks . . 507--520
P. K. Agarwal and
B. K. Bhattacharya and
S. Sen Improved Algorithms for Uniform
Partitions of Points . . . . . . . . . . 521--539
B. Awerbuch and
T. Singh An Online Algorithm for the Dynamic
Maximal Dense Tree Problem . . . . . . . 540--553
L. Wang and
D.-Z. Du Approximations for a Bottleneck Steiner
Tree Problem . . . . . . . . . . . . . . 554--561
Tzuoo-Hawn Yeh and
Cheng-Ming Kuo and
Chin-Laung Lei and
Hsu-Chun Yen Distributed and On-Line Routing on Tori 562--593
H. J. Broersma and
T. Kloks and
D. Kratsch and
H. Müller A Generalization of AT-Free Graphs and a
Generic Algorithm for Solving
Triangulation Problems . . . . . . . . . 594--610
N. Alon and
A. Zaks Algorithmic Aspects of Acyclic Edge
Colorings . . . . . . . . . . . . . . . 611--614
U. Schöning A probabilistic algorithm for $k$-SAT
based on limited local search and
restart . . . . . . . . . . . . . . . . 615--623
S. Irani Randomized Weighted Caching with Two
Page Weights . . . . . . . . . . . . . . 624--640
A. Ambainis and
S. A. Bloch and
D. L. Schweizer Delayed binary search, or playing twenty
questions with a procrastinator . . . . 641--650
H. Shachnai and
T. Tamir Multiprocessor Scheduling with Machine
Allotment and Parallelism Constraints 651--678
L. Narayanan and
S. Shende Corrigendum: ``Static frequency
assignment in cellular networks''
[Algorithmica \bf 29 (2001), no. 3,
396--409; MR1799267 (2001i:68016)] . . . 679--679
R. Battiti and
A. Bertossi Foreword . . . . . . . . . . . . . . . . 1--2
L. A. Sanchis Experimental Analysis of Heuristic
Algorithms for the Dominating Set
Problem . . . . . . . . . . . . . . . . 3--18
S. Nilsson and
M. Tikkanen An Experimental Study of Compression
Methods for Dynamic Tries . . . . . . . 19--33
I. D. Baev and
W. M. Meleis and
A. Eichenberger An Experimental Study of Algorithms for
Weighted Completion Time Scheduling . . 34--51
V. Kapoor and
D. Kühl and
A. Wolff A Tutorial for Designing Flexible
Geometric Algorithms . . . . . . . . . . 52--70
A. Bertoni and
P. Campadelli and
G. Grossi A Neural Algorithm for the Maximum
Clique Problem: Analysis, Experiments,
and Circuit Implementation . . . . . . . 71--88
R. N. Wright and
S. Spalding Experimental Performance of Shared RSA
Modulus Generation . . . . . . . . . . . 89--103
L. Arge and
K. H. Hinrichs and
J. Vahrenhold and
J. S. Vitter Efficient Bulk Operations on Dynamic
R-Trees . . . . . . . . . . . . . . . . 104--128
B. Ayeb Fault Identification in System-Level
Diagnosis: a Logic-Based Framework and
an $ O(n^2 \sqrt \tau / \sqrt {\log n})
$ Algorithm . . . . . . . . . . . . . . 129--149
G. Barequet and
D. Z. Chen and
O. Daescu and
M. T. Goodrich and
J. Snoeyink Efficiently Approximating Polygonal
Paths in Three and Higher Dimensions . . 150--167
M. R. Korupolu and
V. Ramachandran Quasi-Fully Dynamic Algorithms for
Two-Connectivity and Cycle Equivalence 168--182
F. Dehne and
A. Ferreira and
E. Cáceres and
S. W. Song and
A. Roncato Efficient Parallel Graph Algorithms for
Coarse-Grained Multicomputers and BSP 183--200
P. K. Agarwal and
C. M. Procopiuc Exact and Approximation Algorithms for
Clustering . . . . . . . . . . . . . . . 201--226
P. K. Agarwal and
S. Har-Peled and
M. Karia Computing Approximate Shortest Paths on
Convex Polytopes . . . . . . . . . . . . 227--242
V. Chepoi and
Y. Vaxes Augmenting Trees to Meet Biconnectivity
and Diameter Constraints . . . . . . . . 243--262
S. Bespamyatnikh and
M. Segal Fast Algorithms for Approximating
Distances . . . . . . . . . . . . . . . 263--269
Y. Bartal and
M. Farach-Colton and
S. Yooseph and
L. Zhang Fast, Fair and Frugal Bandwidth
Allocation in ATM Networks . . . . . . . 272--286
H. Kawazoe and
T. Shibuya and
T. Tokuyama Optimal Online Algorithms for an
Electronic Commerce Money Distribution
System . . . . . . . . . . . . . . . . . 287--299
E. Cohen and
H. Kaplan Exploiting Regularities in Web Traffic
Patterns for Cache Replacement . . . . . 300--334
A. Goel and
K. Munagala Extending Greedy Multicast Routing to
Delay Sensitive Applications . . . . . . 335--352
B. Kalyanasundaram and
J. Noga and
K. R. Pruhs and
G. J. Woeginger Caching for Web Searching . . . . . . . 353--370
N. E. Young On-Line File Caching . . . . . . . . . . 371--383
S. Irani Page Replacement with Multi-Size Pages
and Applications to Web Caching . . . . 384--409
Michael T. Goodrich Guest Editor's Foreword . . . . . . . . ??
P. Bose and
F. Hurtado-Diaz and
E. Omaña-Pulido and
J. Snoeyink and
G. T. Toussaint Some Aperture-Angle Optimization
Problems . . . . . . . . . . . . . . . . 411--435
S. Rajasekaran and
S. Ramaswami Optimal Parallel Randomized Algorithms
for the Vorono\u\i Diagram of Line
Segments in the Plane . . . . . . . . . 436--460
J. Alber and
H. L. Bodlaender and
H. Fernau and
T. Kloks and
R. Niedermeier Fixed Parameter Algorithms for
DOMINATING SET and Related Problems on
Planar Graphs . . . . . . . . . . . . . 461--493
G. S. Brodal and
C. Makris and
S. Sioutas and
A. Tsakalidis and
K. Tsichlas Optimal Solutions for the Temporal
Precedence Problem . . . . . . . . . . . 494--510
E. Cohen and
H. Kaplan and
U. Zwick Competitive Analysis of the LRFU Paging
Algorithm . . . . . . . . . . . . . . . 511--516
T. M. Chan A Near-Linear Area Bound for Drawing
Binary Trees . . . . . . . . . . . . . . 1--13
P. C. Fishburn and
J. C. Lagarias Pinwheel Scheduling: Achievable
Densities . . . . . . . . . . . . . . . 14--38
B. Chazelle and
O. Devillers and
F. Hurtado and
M. Mora and
V. Sacristán and
M. Teillaud Splitting a Delaunay Triangulation in
Linear Time . . . . . . . . . . . . . . 39--46
T. Jansen and
I. Wegener The Analysis of Evolutionary
Algorithms--A Proof That Crossover
Really Can Help . . . . . . . . . . . . 47--66
J. Feigenbaum and
S. Kannan and
M. Strauss and
M. Viswanathan Testing and Spot-Checking of Data
Streams . . . . . . . . . . . . . . . . 67--80
Mark de Berg and
Matthew J. Katz and
A. Frank van der Stappen and
Jules Vleugels Realistic Input Models for Geometric
Algorithms . . . . . . . . . . . . . . . 81--97
R. Ravi and
D. P. Williamson Erratum: ``An approximation algorithm
for minimum-cost vertex-connectivity
problems'' [Algorithmica \bf 18 (1997),
no. 1, 21--43; MR1432027 (98a:90126)] 98--107
J.-D. Boissonnat and
S. K. Ghosh and
T. Kavitha and
S. Lazard An Algorithm for Computing a Convex and
Simple Path of Bounded Curvature in a
Simple Polygon . . . . . . . . . . . . . 109--156
Nadia Pisanti and
Marie-France Sagot Further Thoughts on the Syntenic
Distance between Genomes . . . . . . . . 157--180
Yossi Azar and
Joan Boyar and
Leah Epstein and
Lene M. Favrholdt and
Kim S. Larsen and
Morten N. Nielsen Fair versus Unrestricted Bin Packing . . 181--196
Matthew Andrews and
Lisa Zhang Approximation Algorithms for Access
Network Design . . . . . . . . . . . . . 197--215
Olivier Beaumont and
Vincent Boudet and
Fabrice Rastello and
Yves Robert Partitioning a Square into Rectangles:
NP-Completeness and Approximation
Algorithms . . . . . . . . . . . . . . . 217--239
Kazuhisa Makino and
Masafumi Yamashita and
Tiko Kameda Max- and Min-Neighborhood Monopolies . . 240--260
Chunhong Chen and
Elaheh Bozorgzadeh and
Ankur Srivastava and
Majid Sarrafzadeh Budget Management with Applications . . 261--275
Adnan Agbaria and
Yosi Ben-Asher and
Ilan Newman Communication--Processor Tradeoffs in a
Limited Resources PRAM . . . . . . . . . 276--297
Surender Baswana and
Sandeep Sen Planar Graph Blocking for External
Searching . . . . . . . . . . . . . . . 298--308
Michele Mosca and
Alain Tapp Introduction . . . . . . . . . . . . . . 309--313
Gerald Gilbert and
Michael Hamrick Secrecy, Computational Loads and Rates
in Practical Quantum Cryptography . . . 314--339
Hitoshi Inamori Security of Practical Time-Reversed EPR
Quantum Key Distribution . . . . . . . . 340--365
Hitoshi Inamori Security of Practical BB84 Quantum Key
Distribution . . . . . . . . . . . . . . 366--371
Eli Biham and
Michel Boyer and
Gilles Brassard and
Jeroen van de Graaf and
Tal Mor Security of Quantum Key Distribution
against All Collective Attacks . . . . . 372--388
Nicolas Gisin and
Renato Renner and
Stefan Wolf Linking Classical and Quantum Key
Agreement: Is There a Classical Analog
to Bound Entanglement? . . . . . . . . . 389--412
Wim van Dam Quantum Algorithms for Weighing Matrices
and Quadratic Residues . . . . . . . . . 413--428
Peter Hòyer and
Jan Neerbek and
Yaoyun Shi Quantum Complexities of Ordered
Searching, Sorting, and Element
Distinctness . . . . . . . . . . . . . . 429--448
J. Niel de Beaudrap and
Richard Cleve and
John Watrous Sharp Quantum versus Classical Query
Complexity Separations . . . . . . . . . 449--461
Jaikumar Radhakrishnan and
Pranab Sen and
S. Venkatesh The Quantum Complexity of Set Membership 462--479
Thomas P. Hayes and
Samuel Kutin and
Dieter van Melkebeek The Quantum Black-Box Complexity of
Majority . . . . . . . . . . . . . . . . 480--501
Todd A. Brun Remotely Prepared Entanglement: a
Quantum Web Page . . . . . . . . . . . . 502--511
Somshubhro Bandyopadhyay and
P. Oscar Boykin and
Vwani Roychowdhury and
Farrokh Vatan A New Proof for the Existence of
Mutually Unbiased Bases . . . . . . . . 512--528
Paul Benioff The Representation of Numbers in Quantum
Mechanics . . . . . . . . . . . . . . . 529--559
Julien Basch and
Leonidas J. Guibas and
G. D. Ramkumar Reporting Red--Blue Intersections
between Two Sets of Connected Line
Segments . . . . . . . . . . . . . . . . 1--20
Peter Sanders and
Sebastian Egner and
Jan Korst Fast Concurrent Access to Parallel Disks 21--55
Enrico Nardelli and
Guido Proietti and
Peter Widmayer Swapping a Failing Edge of a Single
Source Shortest Paths Tree Is Good and
Fast . . . . . . . . . . . . . . . . . . 56--74
Kurt Mehlhorn and
Peter Sanders Scanning Multiple Sequences via Cache
Memory . . . . . . . . . . . . . . . . . 75--93
Andrea E. F. Clementi and
Afonso Ferreira and
Paolo Penna and
Stéphane Perennes and
Riccardo Silvestri The Minimum Range Assignment Problem on
Linear Radio Networks . . . . . . . . . 95--110
Abraham Punnen and
François Margot and
Santosh Kabadi TSP Heuristics: Domination Analysis and
Complexity . . . . . . . . . . . . . . . 111--127
David Pisinger Dynamic Programming on the Word RAM . . 128--145
Claire Kenyon and
Nicolas Schabanel The Data Broadcast Problem with
Non-Uniform Transmission Times . . . . . 146--175
Lene Monrad Favrholdt and
Morten Nyhave Nielsen On-Line Edge-Coloring with a Fixed
Number of Colors . . . . . . . . . . . . 176--191
Mikhail J. Atallah and
Danny Z. Chen and
Ovidiu Daescu Efficient parallel algorithms for planar
$ s t $-graphs . . . . . . . . . . . . . 194--215
Kazuyoshi Hidaka and
Hiroyuki Okano An Approximation Algorithm for a
Large-Scale Facility Location Problem 216--224
Yoshiyuki Kusakari and
Takao Nishizeki Finding a Region with the Minimum Total
$ L_1 $ Distance from Prescribed
Terminals . . . . . . . . . . . . . . . 225--256
Chung Keung Poon and
Vijaya Ramachandran A Randomized Linear-Work EREW PRAM
Algorithm to Find a Minimum Spanning
Forest . . . . . . . . . . . . . . . . . 257--268
Hisao Tamaki and
Takeshi Tokuyama A Characterization of Planar Graphs by
Pseudo-Line Arrangements . . . . . . . . 269--285
Hon Wai Leong and
Hiroshi Imai Guest Editors' Foreword . . . . . . . . ??
Subhash Suri and
Tuomas Sandholm and
Priyank Warkhede Compressing Two-Dimensional Routing
Tables . . . . . . . . . . . . . . . . . 287--300
Lars Engebretsen An Explicit Lower Bound for TSP with
Distances One and Two . . . . . . . . . 301--319
Philip N. Klein and
Hsueh-I Lu and
Robert H. B. Netzer Detecting Race Conditions in Parallel
Programs that Use Semaphores . . . . . . 321--345
Veli Mäkinen and
Gonzalo Navarro and
Esko Ukkonen Approximate Matching of Run-Length
Compressed Strings . . . . . . . . . . . 347--369
Pascal Ferraro and
Christophe Godin An Edit Distance between Quotiented
Trees . . . . . . . . . . . . . . . . . 1--39
Louay Bazzi and
Sanjoy Mitter The Solution of Linear Probabilistic
Recurrence Relations . . . . . . . . . . 41--57
Matthew J. Katz and
Frank Nielsen and
Michael Segal Maintenance of a Piercing Set for
Intervals with Applications . . . . . . 59--73
Holger Bast and
Kurt Mehlhorn and
Guido Schäfer and
Hisao Tamaki A Heuristic for Dijkstra's Algorithm
with Many Targets and Its Use in
Weighted Matching Algorithms . . . . . . 75--88
Xiaoming Sun A $3$-Party Simultaneous Protocol for
SUM-INDEX . . . . . . . . . . . . . . . 89--91
Ying Xu An $ O(n^{1.5}) $ Deterministic
Gossiping Algorithm for Radio Networks 93--96
Frank Dehne and
Wolfgang Dittrich and
David Hutchinson Efficient External Memory Algorithms by
Simulating Coarse-Grained Parallel
Algorithms . . . . . . . . . . . . . . . 97--122
Micah Adler and
Sanjeev Khanna and
Rajmohan Rajaraman and
Adi Rosén Time-Constrained Scheduling of Weighted
Packets on Trees and Meshes . . . . . . 123--152
Seok-Hee Hong and
Peter Eades Drawing Trees Symmetrically in Three
Dimensions . . . . . . . . . . . . . . . 153--178
Gruia C\ualinescu and
Cristina G. Fernandes and
Howard Karloff and
Alexander Zelikovsky A New Approximation Algorithm for
Finding Heavy Planar Subgraphs . . . . . 179--205
Susanne Albers Foreword . . . . . . . . . . . . . . . . 207--208
Anna R. Karlin and
Claire Kenyon and
Dana Randall Dynamic TCP Acknowledgment and Other
Stories about $ e / (e - 1) $ . . . . . 209--224
Amotz Bar-Noy and
Ari Freund and
Shimon Landa and
Joseph (Seffi) Naor Competitive On-Line Switching Policies 225--247
Avrim Blum and
Shuchi Chawla and
Adam Kalai Static Optimality and Dynamic
Search-Optimality in Lists and Trees . . 249--260
Steven S. Seiden and
Rob van Stee New Bounds for Multidimensional Packing 261--293
Amitai Armon and
Yossi Azar and
Leah Epstein and
Oded Regev Temporary Tasks Assignment Resolved . . 295--314
Jeff Edmonds and
Kirk Pruhs Multicast Pull Scheduling: When Fairness
Is Fine . . . . . . . . . . . . . . . . 315--330
Satoru Iwata Computing the Maximum Degree of Minors
in Matrix Pencils via Combinatorial
Relaxation . . . . . . . . . . . . . . . 331--341
Wun-Tat Chan and
Francis Y. L. Chin and
Hing-Fung Ting Escaping a Grid by Edge-Disjoint Paths 343--359
Anna Galluccio and
Guido Proietti Polynomial Time Algorithms for
$2$-Edge-Connectivity Augmentation
Problems . . . . . . . . . . . . . . . . 361--374
Hans L. Bodlaender and
Udi Rotics Computing the Treewidth and the Minimum
Fill-In with the Modular Decomposition 375--408
Lars Arge The Buffer Tree: a Technique for
Designing Batched External Data
Structures . . . . . . . . . . . . . . . 1--24
Jens Gramm and
Rolf Niedermeier and
Peter Rossmanith Fixed-Parameter Algorithms for CLOSEST
STRING and Related Problems . . . . . . 25--42
Moritz G. Maaß Linear Bidirectional On-Line
Construction of Affix Trees . . . . . . 43--74
Guy Kortsarz and
Zeev Nutov Approximating Node Connectivity Problems
via Set Covers . . . . . . . . . . . . . 75--92
Ross M. McConnell Linear-Time Recognition of Circular-Arc
Graphs . . . . . . . . . . . . . . . . . 93--147
Francis Y. L. Chin and
Stanley P. Y. Fung Online Scheduling with Partial Job
Values: Does Timesharing or
Randomization Help? . . . . . . . . . . 149--164
Vladimir Yanovski and
Israel A. Wagner and
Alfred M. Bruckstein A Distributed Ant Algorithm for
Efficiently Patrolling a Network . . . . 165--186
Magnús M. Halldórsson and
Guy Kortsarz and
Hadas Shachnai Sum coloring interval and $k$-claw free
graphs with application to scheduling
dependent jobs . . . . . . . . . . . . . 187--209
Sergio Cabello and
Marc van Kreveld Approximation Algorithms for Aligning
Points . . . . . . . . . . . . . . . . . 211--232
Mauricio Ayala-Rincón and
Paulo D. Conejo A linear time lower bound on McCreight
and general updating algorithms for
suffix trees . . . . . . . . . . . . . . 233--241
Enrico Angelelli and
Maria Grazia Speranza and
Zsolt Tuza Semi-On-line Scheduling on Two Parallel
Processors with an Upper Bound on the
Items . . . . . . . . . . . . . . . . . 243--262
Naoki Abe and
Alan W. Biermann and
Philip M. Long Reinforcement Learning with Immediate
Rewards and Linear Hypotheses . . . . . 263--293
Allan Borodin and
Morten N. Nielsen and
Charles Rackoff (Incremental) priority algorithms . . . 295--326
Daniel Kobler and
Udi Rotics Finding Maximum Induced Matchings in
Subclasses of Claw-Free and $ P_5 $-Free
Graphs, and in Graphs with Matching and
Induced Matching of Equal Maximum Size 327--346
Remco C. Veltkamp Shape Algorithmics . . . . . . . . . . . 1--4
Ulrich Eckhardt and
Helene Reiter Polygonal Representations of Digital
Sets . . . . . . . . . . . . . . . . . . 5--23
Isabelle Sivignon and
Florent Dupont and
Jean-Marc Chassery Decomposition of a Three-Dimensional
Discrete Object Surface into Discrete
Plane Pieces . . . . . . . . . . . . . . 25--43
Helmut Alt and
Christian Knauer and
Carola Wenk Comparison of Distance Measures for
Planar Curves . . . . . . . . . . . . . 45--58
Martin Gavrilov and
Piotr Indyk and
Rajeev Motwani and
Suresh Venkatasubramanian Combinatorial and Experimental Methods
for Approximate Point Pattern Matching 59--90
Bodo Rosenhahn and
Christian Perwass and
Gerald Sommer Free-Form Pose Estimation by Using Twist
Representations . . . . . . . . . . . . 91--113
L. Paul Chew and
Klara Kedem Finding the Consensus Shape for a
Protein Family . . . . . . . . . . . . . 115--129
Ovidiu Daescu New Results on Path Approximation . . . 131--143
Alon Efrat and
Frank Hoffmann and
Christian Knauer and
Klaus Kriegel and
Günter Rote and
Carola Wenk Covering with Ellipses . . . . . . . . . 145--160
Prosenjit Bose and
Pat Morin Testing the Quality of Manufactured
Disks and Balls . . . . . . . . . . . . 161--177
Tamal K. Dey and
Wulue Zhao Approximating the Medial Axis from the
Vorono\u\i Diagram with a Convergence
Guarantee . . . . . . . . . . . . . . . 179--200
Michael Kazhdan and
Bernard Chazelle and
David Dobkin and
Thomas Funkhouser and
Szymon Rusinkiewicz A Reflective Symmetry Descriptor for 3D
Models . . . . . . . . . . . . . . . . . 201--225
Michela Mortara and
Giuseppe Patan\`e and
Michela Spagnuolo and
Bianca Falcidieno and
Jarek Rossignac Blowing Bubbles for Multi-Scale Analysis
and Decomposition of Triangle Meshes . . 227--248
Valerio Pascucci and
Kree Cole-McLaughlin Parallel Computation of the Topology of
Level Sets . . . . . . . . . . . . . . . 249--268
Tadao Takaoka Foreword . . . . . . . . . . . . . . . . 269--270
Xiao Zhou and
Takao Nishizeki Multicolorings of Series-Parallel Graphs 271--297
Danny Z. Chen and
Xiaodong Wu Efficient algorithms for $k$-terminal
cuts on planar graphs . . . . . . . . . 299--316
David Bremner and
Ferran Hurtado and
Suneeta Ramaswami and
Vera Sacristán Small Strictly Convex Quadrilateral
Meshes of Point Sets . . . . . . . . . . 317--339
Sheung-Hung Poon and
Chan-Su Shin and
Tycho Strijk and
Takeaki Uno and
Alexander Wolff Labeling Points with Weights . . . . . . 341--362
Rudolf Fleischer and
Hisashi Koga Balanced Scheduling toward Loss-Free
Packet Queuing and Delay Fairness . . . 363--376
Gerth Stòlting Brodal and
Rolf Fagerberg and
Christian N. S. Pedersen Computing the Quartet Distance between
Evolutionary Trees in Time $ O(n \log n)
$ . . . . . . . . . . . . . . . . . . . 377--395
Xuemin Lin Delay Optimization in Quorum Consensus 397--413
Klaus Jansen and
Samir Khuller Guest Editors' Introduction . . . . . . 415--416
Refael Hassin and
R. Ravi and
F. Sibel Salman Approximation Algorithms for a
Capacitated Network Design Problem . . . 417--431
Kamal Jain and
Vijay V. Vazirani An Approximation Algorithm for the Fault
Tolerant Metric Facility Location
Problem . . . . . . . . . . . . . . . . 433--439
Jochen Könemann and
Goran Konjevod and
Ojas Parekh and
Amitabh Sinha Improved Approximations for Tour and
Tree Covers . . . . . . . . . . . . . . 441--449
Venkatesan Guruswami Inapproximability Results for Set
Splitting and Satisfiability Problems
with No Mixed Clauses . . . . . . . . . 451--469
Martin Dyer and
Leslie Ann Goldberg and
Catherine Greenhill and
Mark Jerrum The Relative Complexity of Approximate
Counting Problems . . . . . . . . . . . 471--500
Sándor P. Fekete and
Henk Meijer Maximum Dispersion and Geometric Maximum
Weight Cliques . . . . . . . . . . . . . 501--511
Xiaotie Deng and
Haodi Feng and
Pixing Zhang and
Yuzhong Zhang and
Hong Zhu Minimizing Mean Completion Time in a
Batch Processing System . . . . . . . . 513--528
Mao-cheng Cai and
Xiaotie Deng and
Lusheng Wang Minimum $k$ arborescences with bandwidth
constraints . . . . . . . . . . . . . . 529--537
Zhi-Zhong Chen and
Xin He Disk Embeddings of Planar Graphs . . . . 539--576
Michael J. Spriggs and
J. Mark Keil and
Sergei Bespamyatnikh and
Michael Segal and
Jack Snoeyink Computing a $ (1 + \epsilon)
$-Approximate Geometric Minimum-Diameter
Spanning Tree . . . . . . . . . . . . . 577--589
Fréderic Chazal and
Véronique Maume-Deschamps and
Brigitte Vallée Erratum to: ``Dynamical sources in
information theory: fundamental
intervals and word prefixes''
[Algorithmica \bf 29 (2001), no. 1--2,
262--306; MR1887307] by Vallée . . . . . 591--596
Rajiv Gandhi and
Samir Khuller and
Yoo-Ah Kim and
Yung-Chun (Justin) Wan Algorithms for Minimizing Response Time
in Broadcast Scheduling . . . . . . . . 597--608
Tetsuo Shibuya Generalization of a Suffix Tree for RNA
Structural Pattern Matching . . . . . . 1--19
Charles Martel and
Glen Nuckolls and
Premkumar Devanbu and
Michael Gertz and
April Kwong and
Stuart G. Stubblebine A General Model for Authenticated Data
Structures . . . . . . . . . . . . . . . 21--41
Leah Epstein and
Ji\vríSgall Approximation Schemes for Scheduling on
Uniformly Related and Identical Parallel
Machines . . . . . . . . . . . . . . . . 43--57
Klaus Jansen Scheduling Malleable Parallel Tasks: An
Asymptotic Fully Polynomial Time
Approximation Scheme . . . . . . . . . . 59--81
Petko Yanev and
Paolo Foschi and
Erricos John Kontoghiorghes Algorithms for Computing the QR
Decomposition of a Set of Matrices with
Common Columns . . . . . . . . . . . . . 83--93
Stavros D. Nikolopoulos and
Leonidas Palios Algorithms for $ P_4 $-Comparability
Graph Recognition and Acyclic $ P_4
$-Transitive Orientation . . . . . . . . 95--126
John H. Reif and
Zheng Sun Movement Planning in the Presence of
Flows . . . . . . . . . . . . . . . . . 127--153
Chung Keung Poon and
Pixing Zhang Minimizing Makespan in Batch Machine
Scheduling . . . . . . . . . . . . . . . 155--174
Esther M. Arkin and
Refael Hassin and
Shlomi Rubinstein and
Maxim Sviridenko Approximations for Maximum
Transportation with Permutable Supply
Vector and Other Capacitated Star
Packing Problems . . . . . . . . . . . . 175--187
Ravindra K. Ahuja and
Dorit S. Hochbaum and
James B. Orlin A Cut-Based Algorithm for the Nonlinear
Dual of the Minimum Cost Network Flow
Problem . . . . . . . . . . . . . . . . 189--208
Petr Kolman and
Christian Scheideler Simple On-Line Algorithms for the
Maximum Disjoint Paths Problem . . . . . 209--233
David R. Wood Minimising the Number of Bends and
Volume in $3$-Dimensional Orthogonal
Graph Drawings with a Diagonal Vertex
Layout . . . . . . . . . . . . . . . . . 235--253
Jianjun Zhou and
Martin Müller Solving Systems of Difference
Constraints Incrementally with
Bidirectional Search . . . . . . . . . . 255--274
Adam L. Buchsbaum and
Michael T. Goodrich Three-Dimensional Layers of Maxima . . . 275--286
Anne Berry and
Jean R. S. Blair and
Pinar Heggernes and
Barry W. Peyton Maximum Cardinality Search for Computing
Minimal Triangulations of Graphs . . . . 287--298
Björn Brodén and
Mikael Hammar and
Bengt J. Nilsson Online and Offline Algorithms for the
Time-Dependent TSP with Time Zones . . . 299--319
Jens Gramm and
Jiong Guo and
Falk Hüffner and
Rolf Niedermeier Automated Generation of Search Tree
Algorithms for Hard Graph Modification
Problems . . . . . . . . . . . . . . . . 321--347
Mirela Damian and
Sriram V. Pemmaraju Computing Optimal Diameter-Bounded
Polygon Partitions . . . . . . . . . . . 1--14
Vida Dujmovi\'c and
Sue Whitesides An Efficient Fixed Parameter Tractable
Algorithm for $1$-Sided Crossing
Minimization . . . . . . . . . . . . . . 15--31
Giovanni Manzini and
Paolo Ferragina Engineering a Lightweight Suffix Array
Construction Algorithm . . . . . . . . . 33--50
Franziska Berger and
Peter Gritzmann and
Sven de Vries Minimum Cycle Bases for Network Graphs 51--62
Evanthia Papadopoulou The Hausdorff Voronoi diagram of point
clusters in the plane . . . . . . . . . 63--82
Jianer Chen and
Donald K. Friesen and
Weijia Jia and
Iyad A. Kanj Using Nondeterminism to Design Efficient
Deterministic Algorithms . . . . . . . . 83--97
Yih-En Andrew Ban and
Sergey Bereg and
Nabil H. Mustafa A Conjecture on Wiener Indices in
Combinatorial Chemistry . . . . . . . . 99--117
Enrico Nardelli and
Guido Proietti and
Peter Widmayer Nearly Linear Time Minimum Spanning Tree
Maintenance for Transient Node Failures 119--132
Marcin Peczarski New Results in Minimum-Comparison
Sorting . . . . . . . . . . . . . . . . 133--145
Alon Efrat and
Piotr Indyk and
Suresh Venkatasubramanian Pattern Matching for Sets of Segments 147--160
Jianbo Qian and
Cao An Wang A Linear-Time Approximation Scheme for
Maximum Weight Triangulation of Convex
Polygons . . . . . . . . . . . . . . . . 161--172
Yoshiharu Kohayakawa and
Flavio Keidi Miyazawa and
Prabhakar Raghavan and
Yoshiko Wakabayashi Multidimensional Cube Packing . . . . . 173--187
Sanjeev Arora and
Kevin Chang Approximation Schemes for
Degree-Restricted MST and Red--Blue
Separation Problems . . . . . . . . . . 189--210
Erik D. Demaine and
Mohammad Taghi Hajiaghayi Diameter and Treewidth in Minor-Closed
Graph Families, Revisited . . . . . . . 211--215
Stefano Leonardi Special issue: Selected papers from the
5th international workshop on
approximation algorithms for
combinatorial optimization and 10th
annual European symposium on algorithms,
Rome, Italy, September 16--21, 2002, and
20th annual symposium on theoretical
aspects of computer science (STAC 2003),
Berlin, Germany, February 27--March 1,
2003 . . . . . . . . . . . . . . . . . . 217--218
Uriel Feige and
László Lovász and
Prasad Tetali Approximating Min Sum Set Cover . . . . 219--234
Micha\l Ma\lafiejski and
Krzysztof Giaro and
Robert Janczewski and
Marek Kubale Sum Coloring of Bipartite Graphs with
Bounded Degree . . . . . . . . . . . . . 235--244
Chaitanya Swamy and
Amit Kumar Primal--Dual Algorithms for Connected
Facility Location Problems . . . . . . . 245--269
Spyros Angelopoulos and
Allan Borodin The Power of Priority Algorithms for
Facility Location and Set Cover . . . . 271--291
Liane Lewin-Eytan and
Joseph (Seffi) Naor and
Ariel Orda Admission Control in Networks with
Advance Reservations . . . . . . . . . . 293--304
Nikhil Bansal and
Kedar Dhamdhere and
Jochen Könemann and
Amitabh Sinha Non-Clairvoyant Scheduling for
Minimizing Mean Slowdown . . . . . . . . 305--318
Maarten Lipmann and
Xiwen Lu and
Willem E. de Paepe and
Rene A. Sitters and
Leen Stougie On-Line Dial-a-Ride Problems Under a
Restricted Information Model . . . . . . 319--329
Irene Finocchi and
Alessandro Panconesi and
Riccardo Silvestri An Experimental Analysis of Simple,
Distributed Vertex Coloring Algorithms 1--23
Joan Feigenbaum and
Sampath Kannan and
Jian Zhang Computing Diameter in the Streaming and
Sliding-Window Models . . . . . . . . . 25--41
Refael Hassin and
Asaf Levin Approximation Algorithms for Quickest
Spanning Tree Problems . . . . . . . . . 43--52
Guoliang Xue and
Wei Xiao A Polynomial Time Approximation Scheme
for Minimum Cost Delay-Constrained
Multicast Tree under a Steiner Topology 53--72
Fedor V. Fomin and
Pinar Heggernes and
Jan Arne Telle Graph Searching, Elimination Trees, and
a Generalization of Bandwidth . . . . . 73--87
Gonzalo Navarro and
Mathieu Raffinot New Techniques for Regular Expression
Searching . . . . . . . . . . . . . . . 89--116
Jochen Könemann and
Asaf Levin and
Amitabh Sinha Approximating the Degree-Bounded Minimum
Diameter Spanning Tree Problem . . . . . 117--129
Cees Duin A Branch-Checking Algorithm for
All-Pairs Shortest Paths . . . . . . . . 131--145
Sariel Har-Peled and
Soham Mazumdar Fast algorithms for computing the
smallest $k$-enclosing circle . . . . . 147--157
Vladlen Koltun and
Carola Wenk Matching Polyhedral Terrains Using
Overlays of Envelopes . . . . . . . . . 159--183
Sariel Har-Peled and
Bardia Sadri How fast is the $k$-means method? . . . 185--202
Heikki Hyyrö and
Gonzalo Navarro Bit-Parallel Witnesses and Their
Applications to Approximate String
Matching . . . . . . . . . . . . . . . . 203--231
Paz Carmi and
Shlomi Dolev and
Sariel Har-Peled and
Matthew J. Katz and
Michael Segal Geographic Quorum System Approximations 233--244
Erik D. Demaine and
Mohammadtaghi Hajiaghayi and
Dimitrios M. Thilikos Exponential Speedup of Fixed-Parameter
Algorithms for Classes of Graphs
Excluding Single-Crossing Graphs as
Minors . . . . . . . . . . . . . . . . . 245--267
Sorina Dumitrescu and
Xiaolin Wu Optimal Two-Description Scalar Quantizer
Design . . . . . . . . . . . . . . . . . 269--287
Carsten Gutwenger and
Petra Mutzel and
René Weiskircher Inserting an Edge into a Planar Graph 289--308
Yi-Jen Chiang New Approximation Results for the
Maximum Scatter TSP . . . . . . . . . . 309--341
Prosenjit Bose and
Pat Morin Guest Editors' Foreword . . . . . . . . 1--2
John Iacono Key-Independent Optimality . . . . . . . 3--10
Luc Devroye Universal Asymptotics for Random Tries
and PATRICIA Trees . . . . . . . . . . . 11--29
Amitabha Bagchi and
Adam L. Buchsbaum and
Michael T. Goodrich Biased Skip Lists . . . . . . . . . . . 31--48
John Iacono and
Stefan Langerman Queaps . . . . . . . . . . . . . . . . . 49--56
Jason D. Hartline and
Edwin S. Hong and
Alexander E. Mohr and
William R. Pentney and
Emily C. Rocke Characterizing History Independent Data
Structures . . . . . . . . . . . . . . . 57--74
Sumanta Guha and
Son Dinh Tran Reconstructing Curves without Delaunay
Computation . . . . . . . . . . . . . . 75--94
Hiroshi Fujiwara and
Kazuo Iwama Average-Case Competitive Analyses for
Ski-Rental Problems . . . . . . . . . . 95--107
Marek Karpinski and
Ion I. M\uandoiu and
Alexander Olshevsky and
Alexander Zelikovsky Improved Approximation Algorithms for
the Quality of Service Multicast Tree
Problem . . . . . . . . . . . . . . . . 109--120
Markus Bläser and
Bodo Manthey Approximating Maximum Weight Cycle
Covers in Directed Graphs with Weights
Zero and One . . . . . . . . . . . . . . 121--139
Ken'ichiro Ohta and
Kunihiko Sadakane and
Akiyoshi Shioura and
Takeshi Tokuyama A fast, accurate, and simple method for
pricing European-Asian and saving-Asian
options . . . . . . . . . . . . . . . . 141--158
Seok-Hee Hong and
Peter Eades Drawing planar graphs symmetrically. II.
Biconnected planar graphs . . . . . . . 159--197
Rolf Mohring and
Rajeev Raman Preface . . . . . . . . . . . . . . . . 199--201
Pankaj K. Agarwal and
Sariel Har-Peled and
Nabil H. Mustafa and
Yusu Wang Near-Linear Time Approximation
Algorithms for Curve Simplification . . 203--219
Pankaj K. Agarwal and
Cecilia M. Procopiuc and
Kasturi R. Varadarajan Approximation algorithms for a $k$-line
center . . . . . . . . . . . . . . . . . 221--230
Georg Baier and
Ekkehard Köhler and
Martin Skutella The $k$-splittable flow problem . . . . 231--248
Prosenjit Bose and
Joachim Gudmundsson and
Michiel Smid Constructing Plane Spanners of Bounded
Degree and Low Weight . . . . . . . . . 249--264
Danny Z. Chen and
Xiaobo S. Hu and
Shuang Luan and
Xiaodong Wu and
Cedric X. Yu Optimal Terrain Construction Problems
and Applications in Intensity-Modulated
Radiation Therapy . . . . . . . . . . . 265--288
Kirk R. Pruhs and
Patchrawat Uthaisombut A Comparison of Multicast Pull Models 289--307
Hadas Shachnai and
Tami Tamir and
Gerhard J. Woeginger Minimizing Makespan and Preemption Costs
on a System of Uniform Machines . . . . 309--334
Lisa Zhang Guest Editor's Introduction . . . . . . 1--3
Ashish Goel and
Deborah Estrin Simultaneous Optimization for Concave
Costs: Single Sink Aggregation or Single
Source Buy-at-Bulk . . . . . . . . . . . 5--15
Chandra Chekuri and
A. Gupta and
Amit Kumar and
J. Naor and
Danny Raz Building Edge--Failure Resilient
Networks . . . . . . . . . . . . . . . . 17--41
Thomas Erlebach and
Stamatis Stefanakos Wavelength Conversion in All--Optical
Networks with Shortest--Path Routing . . 43--61
Alex Kesselman and
Yishay Mansour and
Rob van Stee Improved Competitive Guarantees for QoS
Buffering . . . . . . . . . . . . . . . 63--80
Yossi Azar and
Yossi Richter Management of Multi--Queue Switches in
QoS Networks . . . . . . . . . . . . . . 81--96
Alex Kesselman and
Yishay Mansour Adaptive AIMD Congestion Control . . . . 97--111
Jessica H. Fong and
Anna C. Gilbert and
Sampath Kannan and
Martin J. Strauss Better Alternatives to OSPF Routing . . 113--131
Jay Sethuraman and
Chung-Piaw Teo Effective Routing and Scheduling in
Adversarial Queueing Networks . . . . . 133--146
Zhi-Zhong Chen and
Mitsuharu Kouno A Linear-Time Algorithm for $7$-Coloring
$1$-Plane Graphs . . . . . . . . . . . . 147--177
Nadav Efraty and
Gad M. Landau Sparse Normalized Local Alignment . . . 179--194
Ho Kyung Kim and
Leonidas J. Guibas and
Sung Yong Shin Efficient Collision Detection among
Moving Spheres with Unknown Trajectories 195--210
Olgica Milenkovic and
Kevin J. Compton Average Case Analysis of Gosper's
Algorithm for a Class of Urn Model
Inputs . . . . . . . . . . . . . . . . . 211--244
Jianer Chen and
Iyad A. Kanj and
Ge Xia Labeled Search Trees and Amortized
Analysis: Improved Upper Bounds for
NP-Hard Problems . . . . . . . . . . . . 245--273
David Benoit and
Erik D. Demaine and
J. Ian Munro and
Rajeev Raman and
Venkatesh Raman and
S. Srinivasa Rao Representing Trees of Higher Degree . . 275--292
Jesper Jansson and
Joseph H.-K. Ng and
Kunihiko Sadakane and
Wing-Kin Sung Rooted Maximum Agreement Supertrees . . 293--307
Mahesh Kallahalla and
Peter J. Varman Optimal Read-Once Parallel Disk
Scheduling . . . . . . . . . . . . . . . 309--343
Peter Eades and
Qingwen Feng and
Xuemin Lin and
Hiroshi Nagamochi Straight-Line Drawing Algorithms for
Hierarchical Graphs and Clustered Graphs 1--32
Peter Damaschke Multiple Spin-Block Decisions . . . . . 33--48
Yossi Azar and
Oded Regev Combinatorial Algorithms for the
Unsplittable Flow Problem . . . . . . . 49--66
Seok-Hee Hong and
Peter Eades Drawing Planar Graphs Symmetrically,
III: Oneconnected Planar Graphs . . . . 67--100
Naoki Katoh Foreword . . . . . . . . . . . . . . . . 101--101
Jinhee Chun and
Kunihiko Sadakane and
Takeshi Tokuyama Linear Time Algorithm for Approximating
a Curve by a Single-Peaked Curve . . . . 103--115
Jae-Sook Cheong and
Herman J. Haverkort and
A. Frank van der Stappen Computing All Immobilizing Grasps of a
Simple Polygon with Few Contacts . . . . 117--136
Annette Ebbers-Baumann and
Ansgar Grune and
Rolf Klein The Geometric Dilation of Finite Point
Sets . . . . . . . . . . . . . . . . . . 137--149
Anil Maheshwari and
Michiel Smid A Dynamic Dictionary for Priced
Information with Application . . . . . . 151--165
Erik D. Demaine and
Stefan Langerman and
Joseph O'Rourke Geometric Restrictions on Producible
Polygonal Protein Chains . . . . . . . . 167--181
Mark Huber Exact Sampling from Perfect Matchings of
Dense Regular Bipartite Graphs . . . . . 183--193
Xujin Chen and
Wenan Zang An Efficient Algorithm for Finding
Maximum Cycle Packings in Reducible Flow
Graphs . . . . . . . . . . . . . . . . . 195--211
Zeev Nutov Approximating Rooted Connectivity
Augmentation Problems . . . . . . . . . 213--231
Therese Biedl and
Torsten Thiele and
David R. Wood Three-Dimensional Orthogonal Graph
Drawing with Optimal Volume . . . . . . 233--255
Toshimasa Ishii and
Hiroshi Nagamochi and
Toshihide Ibaraki Augmenting a $ (k - 1)
$-Vertex-Connected Multigraph
$l$-Edge-Connected and
$k$-Vertex-Connected Multigraph . . . . 257--280
M. Brazil and
D. A. Thomas and
J. F. Weng and
M. Zachariasen Canonical Forms and Algorithms for
Steiner Trees in Uniform Orientation
Metrics . . . . . . . . . . . . . . . . 281--300
Ashish Goel and
Adam Meyerson Simultaneous Optimization via
Approximate Majorization for Concave
Profits or Convex Costs . . . . . . . . 301--323
Hee-Kap Ahn and
Siu-Wing Cheng and
Otfried Cheong Casting with Skewed Ejection Direction 325--342
Hajo Broersma and
Fedor V. Fomin and
Jan Kratochvil and
Gerhard J. Woeginger Planar Graph Coloring Avoiding
Monochromatic Subgraphs: Trees and Paths
Make It Difficult . . . . . . . . . . . 343--361
Michael Dom and
Jiong Guo and
Falk Huffner and
Rolf Niedermeier Error Compensation in Leaf Power
Problems . . . . . . . . . . . . . . . . 363--381
Susanne Albers and
Tomasz Radzik Foreword . . . . . . . . . . . . . . . . 1--2
Marcin Mucha and
Piotr Sankowski Maximum matchings in planar graphs via
Gaussian elimination . . . . . . . . . . 3--20
Joseph Cheriyan and
Mohammad R. Salavatipour Hardness and approximation results for
packing Steiner trees . . . . . . . . . 21--43
Costas Busch and
Malik Magdon-Ismail and
Marios Mavronicolas and
Paul Spirakis Direct routing: Algorithms and
complexity . . . . . . . . . . . . . . . 45--68
Yossi Azar and
Arik Litichevskey Maximizing throughput in multi-queue
switches . . . . . . . . . . . . . . . . 69--90
Marc van Kreveld and
A. Frank van der Stappen Approximate unions of lines and
Minkowski sums . . . . . . . . . . . . . 91--107
Amihood Amir and
Estrella Eisenberg and
Ely Porat Swap and mismatch edit distance . . . . 109--120
Rene Beier and
Berthold Vöcking An experimental study of random knapsack
problems . . . . . . . . . . . . . . . . 121--136
Leana Golubchik and
Samir Khuller and
Yoo-Ah Kim and
Svetlana Shargorodskaya and
Yung-Chun (Justin) Wan Data migration on parallel disks:
Algorithms and evaluation . . . . . . . 137--158
Vida Dujmovic and
Michael Fellows and
Michael Hallett and
Matthew Kitching and
Giuseppe Liotta and
Catherine McCartin and
Naomi Nishimura and
Prabhakar Ragde and
Fran Rosamond and
Matthew Suderman and
Sue Whitesides and
David R. Wood A Fixed-Parameter Approach to 2-Layer
Planarization . . . . . . . . . . . . . 159--182
Zvika Brakerski and
Aviv Nisgav and
Boaz Patt-Shamir General Perfectly Periodic Scheduling 183--208
Victor Chepoi and
Bertrand Estellon and
Karim Nouioua and
Yann Vaxes Mixed Covering of Trees and the
Augmentation Problem with Odd Diameter
Constraints . . . . . . . . . . . . . . 209--226
Zhi-Zhong Chen and
Michelangelo Grigni and
Christos H. Papadimitriou Recognizing Hole-Free 4-Map Graphs in
Cubic Time . . . . . . . . . . . . . . . 227--262
Frank Dehne Guest Editor's Introduction . . . . . . 263--267
Faisal N. Abu-Khzam and
Michael A. Langston and
Pushkar Shanbhag and
Christopher T. Symons Scalable Parallel Algorithms for FPT
Problems . . . . . . . . . . . . . . . . 269--284
Thomas M. Keane and
Andrew J. Page and
Thomas J. Naughton and
Simon A. A. Travers and
James O. McInerney Building Large Phylogenetic Trees on
Coarse-Grained Parallel Machines . . . . 285--300
Carlos E. R. Alves and
Edson N. Caceres and
Siang Wun Song A Coarse-Grained Parallel Algorithm for
the All-Substrings Longest Common
Subsequence Problem . . . . . . . . . . 301--335
Adrian Driga and
Paul Lu and
Jonathan Schaeffer and
Duane Szafron and
Kevin Charter and
Ian Parsons FastLSA: a Fast, Linear-Space, Parallel
and Sequential Algorithm for Sequence
Alignment . . . . . . . . . . . . . . . 337--375
Jie Chi and
Mehmet Koyuturk and
Ananth Grama \sc ConQuest: a Coarse-Grained Algorithm
for Constructing Summaries of
Distributed Discrete Datasets . . . . . 377--401
James Chilson and
Raymond Ng and
Alan Wagner and
Ruben Zamar Parallel Computation of High-Dimensional
Robust Correlation and Covariance
Matrices . . . . . . . . . . . . . . . . 403--431
Jerffeson Teixeira de Souza and
Stan Matwin and
Nathalie Japkowicz Parallelizing Feature Selection . . . . 433--456
Mehul Bhatt and
Andrew Flahive and
Carlo Wouters and
Wenny Rahayu and
David Taniar MOVE: a Distributed Framework for
Materialized Ontology View Extraction 457--481
Geeta Chaudhry and
Thomas H. Cormen Slabpose Columnsort: a New Oblivious
Algorithm for Out-of-Core Sorting on
Distributed-Memory Clusters . . . . . . 483--508
Daniel J. Harvey and
Sajal K. Das and
Rupak Biswas Design and Performance of a
Heterogeneous Grid Partitioner . . . . . 509--530
Emilio Di Giacomo and
Walter Didimo and
Giuseppe Liotta and
Stephen K. Wismath Book Embeddability of Series-Parallel
Digraphs . . . . . . . . . . . . . . . . 531--547
Rudolf Fleischer and
Mordecai J. Golin and
Yan Zhang Online Maintenance of $k$-Medians and
$k$-Covers on a Line . . . . . . . . . . 549--567
Michael Elkin and
Guy Kortsarz An Approximation Algorithm for the
Directed Telephone Multicast Problem . . 569--583
Sathish Govindarajan and
Tamas Lukovszki and
Anil Maheshwari and
Norbert Zeh I/O-Efficient Well-Separated Pair
Decomposition and Applications . . . . . 585--614
Rudolf Fleischer Foreword . . . . . . . . . . . . . . . . 1--1
Kazuyuki Amano and
Akira Maruoka The Monotone Circuit Complexity of
Quadratic Boolean Functions . . . . . . 3--14
Amitai Armon and
Uri Zwick Multicriteria Global Minimum Cuts . . . 15--26
Fredrik Bengtsson and
Jingsen Chen Efficient Algorithms for k Maximum Sums 27--41
Jin-Yi Cai and
Osamu Watanabe Random Access to Advice Strings and
Collapsing Results . . . . . . . . . . . 43--57
Qi Cheng and
Ming-Deh Huang Partial Lifting and the Elliptic Curve
Discrete Logarithm Problem . . . . . . . 59--68
Anders Dessmark and
Pierre Fraigniaud and
Dariusz R. Kowalski and
Andrzej Pelc Deterministic Rendezvous in Graphs . . . 69--96
John Hershberger and
Nisheeth Shrivastava and
Subhash Suri and
Csaba D. Toth Adaptive Spatial Partitioning for
Multidimensional Data Streams . . . . . 97--117
Timo von Oertzen Exact Computation of Polynomial Zeros
Expressible by Square Roots . . . . . . 119--136
Joachim von zur Gathen and
Igor E. Shparlinski GCD of Random Linear Combinations . . . 137--148
Celina M. H. de Figueiredo and
Guilherme D. da Fonseca and
Vinicius G. P. de Sa and
Jeremy Spinrad Algorithms for the Homogeneous Set
Sandwich Problem . . . . . . . . . . . . 149--180
Uri Zwick A Slightly Improved Sub-Cubic Algorithm
for the All Pairs Shortest Paths Problem
with Real Edge Lengths . . . . . . . . . 181--192
Esther M. Arkin and
Michael A. Bender and
Sandor P. Fekete and
Joseph S. B. Mitchell and
Martin Skutella The Freeze-Tag Problem: How to Wake Up a
Swarm of Robots . . . . . . . . . . . . 193--221
Jesper Jansson and
See-Kiong Ng and
Wing-Kin Sung and
Hugo Willy A Faster and More Space-Efficient
Algorithm for Inferring Arc-Annotations
of RNA Sequences through Alignment . . . 223--245
Philippe Jacquet and
Daniel Panario and
Wojciech Szpankowski Preface . . . . . . . . . . . . . . . . 247--248
Roberto M. Avanzi and
Clemens Heuberger and
Helmut Prodinger Scalar Multiplication on Koblitz Curves
Using the Frobenius Endomorphism and Its
Combination with Point Halving:
Extensions and Mathematical Analysis . . 249--270
Nicolas Broutin and
Luc Devroye Large Deviations for the Weighted Height
of an Extended Class of Trees . . . . . 271--297
Brigitte Chauvin and
Michael Drmota The Random Multisection Problem,
Travelling Waves and the Distribution of
the Height of $m$-Ary Search Trees . . . 299--327
Sylvie Corteel and
William M. Y. Goh and
Pawel Hitczenko A Local Limit Theorem in the Theory of
Overpartitions . . . . . . . . . . . . . 329--343
James Allen Fill and
Nevin Kapur and
Alois Panholzer Destruction of Very Simple Trees . . . . 345--366
Michael Fuchs and
Hsien-Kuei Hwang and
Ralph Neininger Profiles of Random Trees: Limit Theorems
for Random Recursive Trees and Binary
Search Trees . . . . . . . . . . . . . . 367--407
Jennie C. Hansen and
Eric Schmutz and
Li Sheng The Expected Size of the Rule $k$
Dominating Set . . . . . . . . . . . . . 409--418
Svante Janson Left and Right Pathlengths in Random
Binary Trees . . . . . . . . . . . . . . 419--429
Guy Louchard and
Helmut Prodinger Asymptotics of the Moments of
Extreme-Value Related Distribution
Functions . . . . . . . . . . . . . . . 431--467
Lars Arge and
Darren Erik Vengroff and
Jeffrey Scott Vitter External-Memory Algorithms for
Processing Line Segments in Geographic
Information Systems . . . . . . . . . . 1--25
Andreas Brandstadt and
Feodor F. Dragan and
Hoang-Oanh Le and
Van Bang Le and
Ryuhei Uehara Tree Spanners for Bipartite Graphs and
Probe Interval Graphs . . . . . . . . . 27--51
Amit Chakrabarti and
Chandra Chekuri and
Anupam Gupta and
Amit Kumar Approximation Algorithms for the
Unsplittable Flow Problem . . . . . . . 53--78
Subhash Suri and
Csaba D. Toth and
Yunhong Zhou Selfish Load Balancing and Atomic
Congestion Games . . . . . . . . . . . . 79--96
Leszek Gasieniec and
Aris Pagourtzis and
Igor Potapov and
Tomasz Radzik Deterministic Communication in Radio
Networks with Large Labels . . . . . . . 97--117
Stavros D. Nikolopoulos and
Leonidas Palios Detecting Holes and Antiholes in Graphs 119--138
Frank van den Eijkhof and
Hans L. Bodlaender and
M. C. A. Koster Safe Reduction Rules for Weighted
Treewidth . . . . . . . . . . . . . . . 139--158
Siu-Wing Cheng and
Antoine Vigneron Motorcycle Graphs and Straight Skeletons 159--182
Paz Carmi and
Matthew J. Katz Power Assignment in Radio Networks with
Two Power Levels . . . . . . . . . . . . 183--201
Paolo D'Alberto and
Alexandru Nicolau R-Kleene: a High-Performance
Divide-and-Conquer Algorithm for the
All-Pair Shortest Path for Densely
Connected Networks . . . . . . . . . . . 203--213
Alessandro Panconesi Foreword . . . . . . . . . . . . . . . . 215--215
Udo Adamy and
Christoph Ambuhl and
R. Sai Anand and
Thomas Erlebach Call Control in Rings . . . . . . . . . 217--238
Susanne Albers and
Rob van Stee A Study of Integrated Document and
Connection Caching in the WWW . . . . . 239--252
Nir Avrahami and
Yossi Azar Minimizing Total Flow Time and Total
Completion Time with Immediate
Dispatching . . . . . . . . . . . . . . 253--268
Thomas Erlebach and
Riko Jacob and
Matus Mihalak and
Marc Nunkesser and
Gabor Szabo and
Peter Widmayer An Algorithmic View on OVSF Code
Assignment . . . . . . . . . . . . . . . 269--298
Alex Hall and
Katharina Langkau and
Martin Skutella An FPTAS for Quickest Multicommodity
Flows with Inflow-Dependent Transit
Times . . . . . . . . . . . . . . . . . 299--321
Klaus Jansen and
Guochuan Zhang Maximizing the Total Profit of
Rectangles Packed into a Rectangle . . . 323--342
Joseph (Seffi) Naor and
Hadas Shachnai and
Tami Tamir Real-Time Scheduling with a Budget . . . 343--364
Janos Pach and
Farhad Shahrokhi Guest Editors' Foreword . . . . . . . . 365--365
Greg Aloupis and
Prosenjit Bose and
Pat Morin Reconfiguring Triangulations with Edge
Flips and Point Moves . . . . . . . . . 367--378
Reid Andersen and
Fan Chung and
Linyuan Lu No-Three-in-Line-in-$3$D . . . . . . . . 379--397
Reid Andersen and
Fan Chung and
Linyuan Lu Drawing Power Law Graphs Using a
Local/Global Decomposition . . . . . . . 397--397
Nicolas Bonichon and
Stefan Felsner and
Mohamed Mosbah Convex Drawings of $3$-Connected Plane
Graphs . . . . . . . . . . . . . . . . . 399--420
Robert B. Ellis and
Jeremy L. Martin and
Catherine Yan Random Geometric Graph Diameter in the
Unit Ball . . . . . . . . . . . . . . . 421--438
David Eppstein and
Michael T. Goodrich and
Jeremy Yu Meng Confluent Layered Drawings . . . . . . . 439--452
Hubert de Fraysseix and
Patrice Ossona de Mendez Representations by Contact and
Intersection of Segments . . . . . . . . 453--463
Peter Hui and
Michael J. Pelsmajer and
Marcus Schaefer and
Daniel Stefankovic Train Tracks and Confluent Drawings . . 465--479
Attila Por and
David R. Wood No-Three-in-Line-in-$3$D . . . . . . . . 481--488
Samir Khuller and
Yoo-Ah Kim Broadcasting in Heterogeneous Networks 1--21
Wing-Kai Hon and
Tak-Wah Lam and
Kunihiko Sadakane and
Wing-Kin Sung and
Siu-Ming Yiu A Space and Time Efficient Algorithm for
Constructing Compressed Suffix Arrays 23--36
Sven Verdoolaege and
Rachid Seghir and
Kristof Beyls and
Vincent Loechner and
Maurice Bruynooghe Counting Integer Points in Parametric
Polytopes Using Barvinok's Rational
Functions . . . . . . . . . . . . . . . 37--66
Stefan Dobrev and
Paola Flocchini and
Giuseppe Prencipe and
Nicola Santoro Mobile Search for a Black Hole in an
Anonymous Ring . . . . . . . . . . . . . 67--90
Marios Mavronicolas and
Paul Spirakis The Price of Selfish Routing . . . . . . 91--126
Lusheng Wang Foreword . . . . . . . . . . . . . . . . 127--127
Kamalika Chaudhuri and
Anshul Kothari and
Rudi Pendavingh and
Ram Swaminathan and
Robert Tarjan and
Yunhong Zhou Server Allocation Algorithms for Tiered
Systems . . . . . . . . . . . . . . . . 129--146
Fan Chung and
Ron Graham and
Jia Mao and
Andrew Yao Oblivious and Adaptive Strategies for
the Majority and Plurality Problems . . 147--157
Xiaotie Deng and
Li-Sha Huang and
Minming Li On Walrasian Price of CPU Time . . . . . 159--172
Joong Chae Na and
Raffaele Giancarlo and
Kunsoo Park On-Line Construction of Two-Dimensional
Suffix Trees in $ O(n^2 \log n) $ Time 173--186
Miklos Csuros and
Bin Ma Rapid Homology Search with Neighbor
Seeds . . . . . . . . . . . . . . . . . 187--202
Jinsong Tan and
Kok Seng Chua and
Louxin Zhang and
Song Zhu Algorithmic and Complexity Issues of
Three Clustering Methods in Microarray
Data Analysis . . . . . . . . . . . . . 203--219
Frederic Magniez and
Ashwin Nayak Quantum Complexity of Testing Group
Commutativity . . . . . . . . . . . . . 221--232
Anders Dessmark and
Jesper Jansson and
Andrzej Lingas and
Eva-Marta Lundell Polynomial-Time Algorithms for the
Ordered Maximum Agreement Subtree
Problem . . . . . . . . . . . . . . . . 233--248
Colin Cooper and
Alan Frieze and
Gregory B. Sorkin Random $2$-SAT with Prescribed Literal
Degrees . . . . . . . . . . . . . . . . 249--265
Paola Bonizzoni A Linear-Time Algorithm for the Perfect
Phylogeny Haplotype Problem . . . . . . 267--285
Jinsong Tan and
Louxin Zhang The Consecutive Ones Submatrix Problem
for Sparse Matrices . . . . . . . . . . 287--299
Piotr Berman and
Bhaskar DasGupta and
Jie Liang Foreword . . . . . . . . . . . . . . . . 301--301
Amarda Shehu and
Cecilia Clementi and
Lydia E. Kavraki Sampling Conformation Space to Model
Equilibrium Fluctuations in Proteins . . 303--327
Guojun Li and
Zhijie Liu and
Jun-tao Guo and
Ying Xu An Algorithm for Simultaneous Backbone
Threading and Side-Chain Packing . . . . 329--342
Vicky Choi and
Navin Goyal An Algorithmic Approach to the
Identification of Rigid Domains in
Proteins . . . . . . . . . . . . . . . . 343--362
Songjian Lu and
Fenghui Zhang and
Jianer Chen and
Sing-Hoi Sze Finding Pathway Structures in Protein
Interaction Networks . . . . . . . . . . 363--374
Nidhal Bouaynaya and
Dan Schonfeld Protein Communication System: Evolution
and Genomic Structure . . . . . . . . . 375--397
Bill Jackson and
Tibor Jordan Rigid Components in Molecular Graphs . . 399--412
Sebastian Bocker and
Zsuzsanna Liptak A Fast and Simple Algorithm for the
Money Changing Problem . . . . . . . . . 413--432
Leonidas J. Guibas and
Yusu Wang Toward Unsupervised Segmentation of
Semi-Rigid Low-Resolution Molecular
Surfaces . . . . . . . . . . . . . . . . 433--438
Alexander Grigoriev and
Hans L. Bodlaender Algorithms for Graphs Embeddable with
Few Crossings per Edge . . . . . . . . . 1--11
Rudi Cilibrasi and
Leo van Iersel and
Steven Kelk and
John Tromp The Complexity of the Single Individual
SNP Haplotyping Problem . . . . . . . . 13--36
Nir Halman Simple Stochastic Games, Parity Games,
Mean Payoff Games and Discounted Payoff
Games Are All LP-Type Problems . . . . . 37--50
Leah Epstein and
Asaf Levin SONET ADMs Minimization with Divisible
Paths . . . . . . . . . . . . . . . . . 51--68
Daniil Ryabko Sample Complexity for Computational
Classification Problems . . . . . . . . 69--77
S. Guha and
S. Khuller Approximation Algorithms for Connected
Dominating Sets . . . . . . . . . . . . 79--79
Andrej Taranenko and
Aleksander Vesel Fast Recognition of Fibonacci Cubes . . 81--93
Y. Nekrich Space Efficient Dynamic Orthogonal Range
Reporting . . . . . . . . . . . . . . . 94--108
Gopal Pandurangan and
Gahyun Park Analysis of Randomized Protocols for
Conflict-Free Distributed Access . . . . 109--126
Frédéric Magniez and
Michel de Rougemont Property Testing of Regular Tree
Languages . . . . . . . . . . . . . . . 127--146
Valerie King and
Scott Lewis and
Jared Saia and
Maxwell Young Choosing a Random Peer in Chord . . . . 147--169
Luciano Gual\`a and
Guido Proietti Exact and Approximate Truthful
Mechanisms for the Shortest Paths Tree
Problem . . . . . . . . . . . . . . . . 171--191
Shang-Hua Teng and
Frances F. Yao $k$-Nearest-Neighbor Clustering and
Percolation Theory . . . . . . . . . . . 192--211
Eitan Bachmat Average Case Analysis of Disk
Scheduling, Increasing Subsequences and
Spacetime Geometry . . . . . . . . . . . 212--231
Bernhard Fuchs and
Walter Kern and
Xinhui Wang The Number of Tree Stars Is $
O^*(1.357^k) $ . . . . . . . . . . . . . 232--244
Hervé Fournier and
Antoine Vigneron A Tight Lower Bound for Computing the
Diameter of a $3$D Convex Polytope . . . 245--257
Stefano Basagni and
Cynthia A. Phillips Editors' Foreword to the Special Issue
on Principles of Mobile Communications
and Computing . . . . . . . . . . . . . 259--263
Peng-Jun Wan and
Xiang-Yang Li and
Ophir Frieder OVSF-CDMA Code Assignment in Wireless Ad
Hoc Networks . . . . . . . . . . . . . . 264--285
Petar Popovski and
Frank H. P. Fitzek and
Ramjee Prasad A Class of Algorithms for Collision
Resolution with Multiplicity Estimation 286--317
Michele Flammini and
Ralf Klasing and
Alfredo Navarra and
Stephane Perennes Improved Approximation Results for the
Minimum Energy Broadcasting Problem . . 318--336
András Faragó On the Fundamental Limits of Topology
Control in Ad Hoc Networks . . . . . . . 337--356
Vasundhara Puttagunta and
Konstantinos Kalpakis Accuracy vs. Lifetime: Linear Sketches
for Aggregate Queries in Sensor Networks 357--385
Daniela Tulone On the Feasibility of Time Estimation
under Isolation Conditions in Wireless
Sensor Networks . . . . . . . . . . . . 386--411
Devdatt Dubhashi and
Olle Häggström and
Lorenzo Orecchia and
Alessandro Panconesi and
Chiara Petrioli and
Andrea Vitaletti Localized Techniques for Broadcasting in
Wireless Sensor Networks . . . . . . . . 412--446
Dimitris Fotakis On the Competitive Ratio for Online
Facility Location . . . . . . . . . . . 1--57
Min-Te Sun and
Chih-Wei Yi and
Chuan-Kai Yang and
Ten-Hwang Lai An Optimal Algorithm for the Minimum
Disc Cover Problem . . . . . . . . . . . 58--71
Nir Naaman and
Raphael Rom Average Case Analysis of Bounded Space
Bin Packing Algorithms . . . . . . . . . 72--97
Anupam Gupta and
Aravind Srinivasan and
Éva Tardos Cost-Sharing Mechanisms for Network
Design . . . . . . . . . . . . . . . . . 98--119
Raffaella Gentilini and
Carla Piazza and
Alberto Policriti Symbolic Graphs: Linear Solutions to
Connectivity Related Problems . . . . . 120--158
Leonid Khachiyan and
Endre Boros and
Khaled Elbassioni and
Vladimir Gurvich On Enumerating Minimal Dicuts and
Strongly Connected Subgraphs . . . . . . 159--172
Frank Dehne and
Jörg-Rüdiger Sack Introduction to Special Issue . . . . . 173--174
Minkyoung Cho and
David M. Mount Improved Approximation Bounds for Planar
Point Pattern Matching . . . . . . . . . 175--207
Karim Dou\"\ieb and
Stefan Langerman Dynamic Hotlinks . . . . . . . . . . . . 208--222
Kazuo Iwama and
Andrzej Lingas and
Masaki Okita Max-Stretch Reduction for Tree Spanners 223--235
Timothy M. Chan All-Pairs Shortest Paths with Real
Weights in $ O(n^3 / \log n) $ Time . . 236--243
André Berger and
Ojas Parekh Linear Time Algorithms for Generalized
Edge Dominating Set Problems . . . . . . 244--254
Ilya Baran and
Erik D. Demaine and
Dmitriy A. Katz Optimally Adaptive Integration of
Univariate Lipschitz Functions . . . . . 255--278
Michael A. Bender and
David P. Bunde and
Erik D. Demaine and
Sándor P. Fekete and
Vitus J. Leung and
Henk Meijer and
Cynthia A. Phillips Communication-Aware Processor Allocation
for Supercomputers: Finding Point Sets
of Small Average Distance . . . . . . . 279--298
Bang Ye Wu and
Chih-Yuan Hsiao and
Kun-Mao Chao The Swap Edges of a Multiple-Sources
Routing Tree . . . . . . . . . . . . . . 299--311
Patchrawat `Patch' Uthaisombut Generalization of EDF and LLF:
Identifying All Optimal Online
Algorithms for Minimizing Maximum
Lateness . . . . . . . . . . . . . . . . 312--328
Petra Berenbrink and
Tom Friedetzky and
Russell Martin On the Stability of Dynamic Diffusion
Load Balancing . . . . . . . . . . . . . 329--350
Richard Cole and
Lukasz Kowalik New Linear-Time Algorithms for
Edge-Coloring Planar Graphs . . . . . . 351--368
V. Berry and
Z. S. Peng and
H. F. Ting From Constrained to Unconstrained
Maximum Agreement Subtree in Linear Time 369--385
Iris Reinbacher and
Marc Benkert and
Marc van Kreveld and
Joseph S. B. Mitchell and
Jack Snoeyink and
Alexander Wolff Delineating Boundaries for Imprecise
Regions . . . . . . . . . . . . . . . . 386--414
José R. Correa and
Marcos Kiwi Foreword . . . . . . . . . . . . . . . . 415--417
Nayantara Bhatnagar and
Dana Randall and
Vijay V. Vazirani and
Eric Vigoda Random Bichromatic Matchings . . . . . . 418--445
Béla Bollobás and
Guy Kindler and
Imre Leader and
Ryan O'Donnell Eliminating Cycles in the Discrete Torus 446--454
Marek Chrobak and
Claire Kenyon and
John Noga and
Neal E. Young Incremental Medians via Online Bidding 455--478
Parikshit Gopalan and
Venkatesan Guruswami and
Richard J. Lipton Algorithms for Modular Counting of Roots
of Multivariate Polynomials . . . . . . 479--496
Lo\"\ick Lhote and
Brigitte Vallée Gaussian Laws for the Main Parameters of
the Euclid Algorithms . . . . . . . . . 497--554
Mariko Sakashita and
Kazuhisa Makino and
Satoru Fujishige Minimum Cost Source Location Problems
with Flow Requirements . . . . . . . . . 555--583
Ilya Baran and
Erik D. Demaine and
Mihai P\uatrascu Subquadratic Algorithms for 3SUM . . . . 584--596
Zhi-Zhong Chen Approximation Algorithms for Bounded
Degree Phylogenetic Roots . . . . . . . 1--23
Shirley Halevy and
Eyal Kushilevitz Distribution-Free Connectivity Testing
for Sparse Graphs . . . . . . . . . . . 24--48
Jean Cardinal and
Samuel Fiorini and
Gwenaël Joret Tight Results on Minimum Entropy Set
Cover . . . . . . . . . . . . . . . . . 49--60
Christian Boulinier and
Franck Petit and
Vincent Villain Synchronous vs. Asynchronous Unison . . 61--80
Hans L. Bodlaender and
Alexander Grigoriev and
Arie M. C. A. Koster Treewidth Lower Bounds with Brambles . . 81--98
Iyad A. Kanj and
Luay Nakhleh and
Ge Xia The Compatibility of Binary Characters
on Phylogenetic Networks: Complexity and
Parameterized Algorithms . . . . . . . . 99--128
Réka Albert and
Bhaskar DasGupta and
Riccardo Dondi and
Eduardo Sontag Inferring (Biological) Signal
Transduction Networks via Transitive
Reductions of Directed Graphs . . . . . 129--159
Nir Ailon and
Bernard Chazelle and
Seshadhri Comandur and
Ding Liu Property-Preserving Data Reconstruction 160--182
Aleksei V. Fishkin and
Klaus Jansen and
Monaldo Mastrolilli Grouping Techniques for Scheduling
Problems: Simpler and Faster . . . . . . 183--199
Bernd Gärtner and
Walter D. Morris, Jr. and
Leo Rüst Unique Sink Orientations of Grids . . . 200--235
Xiaotie Deng and
Dingzhu Du Preface . . . . . . . . . . . . . . . . 237--238
Leonid Khachiyan and
Endre Boros and
Konrad Borys and
Khaled Elbassioni and
Vladimir Gurvich and
Kazuhisa Makino Generating Cut Conjunctions in Graphs
and Related Problems . . . . . . . . . . 239--263
Jianxi Fan and
Xiaohua Jia and
Xiaola Lin Embedding of Cycles in Twisted Cubes
with Edge-Pancyclic . . . . . . . . . . 264--282
Lusheng Wang and
Kaizhong Zhang Space Efficient Algorithms for Ordered
Tree Comparison . . . . . . . . . . . . 283--297
Tak-Wah Lam and
Wing-Kin Sung and
Swee-Seong Wong Improved Approximate String Matching
Using Compressed Suffix Data Structures 298--314
Marios Mavronicolas and
Vicky Papadopoulou and
Anna Philippou and
Paul Spirakis A Network Game with Attackers and a
Defender . . . . . . . . . . . . . . . . 315--341
Kazuo Iwama and
Shuichi Miyazaki and
Naoya Yamauchi A $ (2 - c \frac {1}{\sqrt {N}})
$-Approximation Algorithm for the Stable
Marriage Problem . . . . . . . . . . . . 342--356
Li-Sha Huang A Primal-Dual Algorithm for the
Computation of Market Equilibrium with
Logarithmic Utility Functions . . . . . 357--366
Wojciech Jawor and
Marek Chrobak and
Christoph Dürr Competitive Analysis of Scheduling
Algorithms for Aggregated Links . . . . 367--386
Camil Demetrescu and
Giuseppe F. Italiano Mantaining Dynamic Matrices for Fully
Dynamic Transitive Closure . . . . . . . 387--427
Yijie Han An $ O(n^3 (\log \log n / \log n)^{5 /
4}) $ Time Algorithm for All Pairs
Shortest Path . . . . . . . . . . . . . 428--434
Guojun Li and
Zhijie Liu and
Jun-Tao Guo and
Ying Xu An Algorithm for Simultaneous Backbone
Threading and Side-Chain Packing . . . . 435--450
Natalia V. Shakhlevich and
Vitaly A. Strusevich Preemptive Scheduling on Uniform
Parallel Machines with Controllable Job
Processing Times . . . . . . . . . . . . 451--473
Xiaotie Deng and
Yinyu Ye Preface . . . . . . . . . . . . . . . . 1--2
Subhash Khot and
Richard J. Lipton and
Evangelos Markakis and
Aranyak Mehta Inapproximability Results for
Combinatorial Auctions with Submodular
Utility Functions . . . . . . . . . . . 3--18
Marios Mavronicolas and
Panagiota N. Panagopoulou and
Paul G. Spirakis Cost Sharing Mechanisms for Fair Pricing
of Resource Usage . . . . . . . . . . . 19--43
Ning Chen and
Atri Rudra Walrasian Equilibrium: Hardness,
Approximations and Tractable Instances 44--64
Fang Wu and
Li Zhang and
Bernardo A. Huberman Truth-Telling Reservations . . . . . . . 65--79
W.-Y. Ng and
D. M. Chiu and
W. K. Lin Club Formation by Rational Sharing:
Content, Viability and Community
Structure . . . . . . . . . . . . . . . 80--94
Mikolaj Morzy New Algorithms for Mining the Reputation
of Participants of Online Auctions . . . 95--112
Jianer Chen and
Iyad A. Kanj Foreword from the Guest Editors . . . . 113--113
Falk Hüffner and
Sebastian Wernicke and
Thomas Zichner Algorithm Engineering for Color-Coding
with Applications to Signaling Pathway
Detection . . . . . . . . . . . . . . . 114--132
Gregory Gutin and
Stefan Szeider and
Anders Yeo Fixed-Parameter Complexity of Minimum
Profile Problems . . . . . . . . . . . . 133--152
Fedor V. Fomin and
Fabrizio Grandoni and
Dieter Kratsch Solving Connected Dominating Set Faster
than $ 2^n $ . . . . . . . . . . . . . . 153--166
M. R. Fellows and
C. Knauer and
N. Nishimura and
P. Ragde and
F. Rosamond and
others Faster Fixed-Parameter Tractable
Algorithms for Matching and Packing
Problems . . . . . . . . . . . . . . . . 167--176
Jiong Guo and
Rolf Niedermeier and
Daniel Raible Improved Algorithms and Complexity
Results for Power Domination in Graphs 177--202
Venkatesh Raman and
Saket Saurabh Short Cycles Make $W$-hard Problems
Hard: FPT Algorithms for $W$-hard
Problems in Graphs with no Short Cycles 203--225
Andreas Björklund and
Thore Husfeldt Exact Algorithms for Exact
Satisfiability and Number of Perfect
Matchings . . . . . . . . . . . . . . . 226--249
Minzhu Xie and
Jianxin Wang An Improved (and Practical)
Parameterized Algorithm for the
Individual Haplotyping Problem MFR with
Mate-Pairs . . . . . . . . . . . . . . . 250--266
Vida Dujmovi\'c and
Michael R. Fellows and
Matthew Kitching and
Giuseppe Liotta and
Catherine McCartin and
others On the Parameterized Complexity of
Layered Graph Drawing . . . . . . . . . 267--292
Fedor V. Fomin and
Serge Gaspers and
Artem V. Pyatkin and
Igor Razgon On the Minimum Feedback Vertex Set
Problem: Exact and Enumeration
Algorithms . . . . . . . . . . . . . . . 293--307
Irene Finocchi and
Giuseppe F. Italiano Sorting and Searching in Faulty Memories 309--332
Telikepalli Kavitha and
Kurt Mehlhorn and
Dimitrios Michail and
Katarzyna E. Paluch An $ \tilde O(m^2 n) $ Algorithm for
Minimum Cycle Basis of Graphs . . . . . 333--349
Dong Kyue Kim and
Minhwan Kim and
Heejin Park Linearized Suffix Tree: an Efficient
Index Data Structure with the
Capabilities of Suffix Trees and Suffix
Arrays . . . . . . . . . . . . . . . . . 350--377
Hai Yu and
Pankaj K. Agarwal and
Raghunath Poreddy and
Kasturi R. Varadarajan Practical Methods for Shape Fitting and
Kinetic Data Structures using Coresets 378--402
Morten Skaarup Jensen and
Rasmus Pagh Optimality in External Memory Hashing 403--411
Amotz Bar-Noy and
Richard E. Ladner and
Tami Tamir Scheduling Techniques for
Media-on-Demand . . . . . . . . . . . . 413--439
Andreas Brandstädt and
Chính T. Ho\`ang Maximum Induced Matchings for Chordal
Graphs in Linear Time . . . . . . . . . 440--447
Christoph Buchheim and
Seok-Hee Hong Testing Planarity of Geometric
Automorphisms in Linear Time . . . . . . 448--465
Ojas Parekh and
Danny Segev Path Hitting in Acyclic Graphs . . . . . 466--486
Anshul Kothari and
Subhash Suri and
Yunhong Zhou Bandwidth-Constrained Allocation in Grid
Computing . . . . . . . . . . . . . . . 487--501
Reuven Cohen and
Pierre Fraigniaud and
David Ilcinkas and
Amos Korman and
David Peleg Labeling Schemes for Tree Representation 1--15
Piotr Berman and
Jieun Jeong Consistent Sets of Secondary Structures
in Proteins . . . . . . . . . . . . . . 16--34
José Soares and
Marco A. Stefanes Algorithms for Maximum Independent Set
in Convex Bipartite Graphs . . . . . . . 35--49
Lars Arge and
Mark de Berg and
Herman Haverkort Cache-Oblivious $R$-Trees . . . . . . . 50--68
Bodo Manthey and
L. Shankar Ram Approximation Algorithms for
Multi-Criteria Traveling Salesman
Problems . . . . . . . . . . . . . . . . 69--88
Mohammad Taghi Hajiaghayi and
Guy Kortsarz and
Mohammad R. Salavatipour Approximating Buy-at-Bulk and
Shallow-Light $k$-Steiner Trees . . . . 89--103
Martin Hoefer Non-Cooperative Tree Creation . . . . . 104--131
George Karakostas and
Stavros G. Kolliopoulos Stackelberg Strategies for Selfish
Routing in General Multicommodity
Networks . . . . . . . . . . . . . . . . 132--153
Danny Z. Chen and
D. T. Lee Guest Editors' Forward . . . . . . . . . 155--156
Sergey Bereg and
Ovidiu Daescu and
Minghui Jiang A PTAS for Cutting Out Polygons with
Lines . . . . . . . . . . . . . . . . . 157--171
Joseph Wun-Tat Chan and
Prudence W. H. Wong and
Fencol C. C. Yung On Dynamic Bin Packing: An Improved
Lower Bound and Resource Augmentation
Analysis . . . . . . . . . . . . . . . . 172--206
Hiroshi Nagamochi A Detachment Algorithm for Inferring a
Graph from Path Frequency . . . . . . . 207--224
George Karakostas and
Stavros G. Kolliopoulos Edge Pricing of Multicommodity Networks
for Selfish Users with Elastic Demands 225--249
Xi Chen and
Xiaotie Deng A Simplicial Approach for Discrete Fixed
Point Theorems . . . . . . . . . . . . . 250--262
Xujin Chen and
Bo Chen Approximation Algorithms for
Soft-Capacitated Facility Location in
Capacitated Network Design . . . . . . . 263--297
D. T. Lee and
Tien-Ching Lin and
Hsueh-I Lu Fast Algorithms for the Density Finding
Problem . . . . . . . . . . . . . . . . 298--313
Amihood Amir and
Ayelet Butman and
Moshe Lewenstein and
Ely Porat Real Two Dimensional Scaled Matching . . 314--336
Jan Arpe and
Bodo Manthey Approximability of Minimum AND-Circuits 337--357
Fedor V. Fomin and
Pierre Fraigniaud and
Nicolas Nisse Nondeterministic Graph Searching: From
Pathwidth to Treewidth . . . . . . . . . 358--373
Joel Seiferas Sorting Networks of Logarithmic Depth,
Further Simplified . . . . . . . . . . . 374--384
Leah Epstein and
Thomas Erlebach and
Asaf Levin Variable Sized Online Interval Coloring
with Bandwidth . . . . . . . . . . . . . 385--401
Romeo Rizzi Minimum Weakly Fundamental Cycle Bases
Are Hard To Find . . . . . . . . . . . . 402--424
Pangfeng Liu and
May-Chen Kuo and
Da-Wei Wang An Approximation Algorithm and Dynamic
Programming for Reduction in
Heterogeneous Environments . . . . . . . 425--453
Yossi Azar and
Thomas Erlebach Foreword . . . . . . . . . . . . . . . . 455--456
Mohammad Ali Abam and
Mark de Berg and
Sheung-Hung Poon and
Bettina Speckmann Kinetic Collision Detection for Convex
Fat Objects . . . . . . . . . . . . . . 457--473
Peyman Afshani and
Timothy M. Chan Dynamic Connectivity for Axis-Parallel
Rectangles . . . . . . . . . . . . . . . 474--487
Christoph Ambühl and
Monaldo Mastrolilli Single Machine Precedence Constrained
Scheduling Is a Vertex Cover Problem . . 488--503
Tomás Ebenlendr and
Wojciech Jawor and
Jirí Sgall Preemptive Online Scheduling: Optimal
Algorithms for All Speeds . . . . . . . 504--522
Matthias Englert and
Matthias Westermann Lower and Upper Bounds on FIFO Buffer
Management in QoS Switches . . . . . . . 523--548
Sumit Ganguly and
Lakshminath Bhuvanagiri Hierarchical Sampling from Sketches:
Estimating Functions over Data Streams 549--582
Friedrich Eisenbrand and
Andreas Karrenbauer and
Martin Skutella and
Chihao Xu Multiline Addressing by Network Flow . . 583--596
Umberto Ferraro-Petrillo and
Irene Finocchi and
Giuseppe F. Italiano The Price of Resiliency: a Case Study on
Sorting with Memory Faults . . . . . . . 597--620
Radu Mihaescu and
Dan Levy and
Lior Pachter Why Neighbor-Joining Works . . . . . . . 1--24
Giuseppe Di Battista and
Fabrizio Frati Small Area Drawings of Outerplanar
Graphs . . . . . . . . . . . . . . . . . 25--53
Rajiv Gandhi and
Julián Mestre Combinatorial Algorithms for Data
Migration to Minimize Average Completion
Time . . . . . . . . . . . . . . . . . . 54--71
Hee-Kap Ahn and
Sang Won Bae and
Siu-Wing Cheng and
Kyung-Yong Chwa Casting an Object with a Core . . . . . 72--88
Reuven Bar-Yehuda and
Michael Beder and
Yuval Cohen and
Dror Rawitz Resource Allocation in Bounded Degree
Trees . . . . . . . . . . . . . . . . . 89--106
Hsiao-Fei Liu and
Kun-Mao Chao On Locating Disjoint Segments with
Maximum Sum of Densities . . . . . . . . 107--117
Bogdan S. Chlebus and
Dariusz R. Kowalski and
Tomasz Radzik Many-to-Many Communication in Radio
Networks . . . . . . . . . . . . . . . . 118--139
Tetsuo Asano Editorial . . . . . . . . . . . . . . . 141--141
Erik D. Demaine and
MohammadTaghi Hajiaghayi and
Ken-ichi Kawarabayashi Algorithmic Graph Minor Theory: Improved
Grid Minor Bounds and Wagner's
Contraction . . . . . . . . . . . . . . 142--180
Fedor V. Fomin and
Serge Gaspers and
Saket Saurabh and
Alexey A. Stepanov On Two Techniques of Combining Branching
and Treewidth . . . . . . . . . . . . . 181--207
Saswata Shannigrahi and
Sudebkumar Prasant Pal Efficient Prüfer-Like Coding and Counting
Labelled Hypertrees . . . . . . . . . . 208--225
Ferdinando Cicalese and
Fredrik Manne and
Qin Xin Faster Deterministic Communication in
Radio Networks . . . . . . . . . . . . . 226--242
Frank Neumann and
Carsten Witt Runtime Analysis of a Simple Ant Colony
Optimization Algorithm . . . . . . . . . 243--255
Kazuo Iwama and
Hiroki Morizumi and
Jun Tarui Negation-Limited Complexity of Parity
and Inverters . . . . . . . . . . . . . 256--267
Sashka Davis and
Russell Impagliazzo Models of Greedy Algorithms for Graph
Problems . . . . . . . . . . . . . . . . 269--317
Boris Aronov and
Paz Carmi and
Matthew J. Katz Minimum-Cost Load-Balancing Partitions 318--336
Lars Arge and
Vasilis Samoladas and
Ke Yi Optimal External Memory Planar Point
Enclosure . . . . . . . . . . . . . . . 337--352
Pei-Chi Huang and
Hsin-Wen Wei and
Wan-Chen Lu and
Wei-Kuan Shih and
Tsan-sheng Hsu Smallest Bipartite Bridge-Connectivity
Augmentation . . . . . . . . . . . . . . 353--378
Yury Lifshits and
Shay Mozes and
Oren Weimann and
Michal Ziv-Ukelson Speeding Up HMM Decoding and Training by
Exploiting Sequence Repetitions . . . . 379--399
Chandra Chekuri and
Sanjeev Khanna and
F. Bruce Shepherd A Note on Multiflows and Treewidth . . . 400--412
Anil Maheshwari and
Norbert Zeh I/O-Efficient Algorithms for Graphs of
Bounded Treewidth . . . . . . . . . . . 413--469
Guohui Lin and
Zhipeng Cai Editorial, COCOON 2007 Special Issue . . 471--471
Jianer Chen and
Songjian Lu Improved Parameterized Set Splitting
Algorithms: a Probabilistic Approach . . 472--489
Hamid Zarrabi-Zadeh and
Timothy M. Chan An Improved Algorithm for Online Unit
Clustering . . . . . . . . . . . . . . . 490--500
Zhi-Zhong Chen and
Lusheng Wang and
Zhanyong Wang Approximation Algorithms for
Reconstructing the Duplication History
of Tandem Repeats . . . . . . . . . . . 501--529
Yunlong Liu and
Jianer Chen and
Jianxin Wang On Counting $3$-D Matchings of Size $k$ 530--543
Noga Alon and
Shai Gutner Linear Time Algorithms for Finding a
Dominating Set of Fixed Size in
Degenerated Graphs . . . . . . . . . . . 544--556
Yong Zhang and
Francis Y. L. Chin and
Hong Zhu A $1$-Local Asymptotic $ 13 / 9
$-Competitive Algorithm for
Multicoloring Hexagonal Graphs . . . . . 557--567
Jianer Chen and
Yang Liu and
Songjian Lu An Improved Parameterized Algorithm for
the Minimum Node Multiway Cut Problem 1--13
Christoph Burnikel and
Stefan Funke and
Kurt Mehlhorn and
Stefan Schirra and
Susanne Schmitt A Separation Bound for Real Algebraic
Expressions . . . . . . . . . . . . . . 14--28
Marek Karpinski and
Yakov Nekrich A Fast Algorithm for Adaptive Prefix
Coding . . . . . . . . . . . . . . . . . 29--41
Benjamin Birnbaum and
Kenneth J. Goldman An Improved Analysis for a Greedy
Remote-Clique Algorithm Using
Factor-Revealing LPs . . . . . . . . . . 42--59
Costas S. Iliopoulos and
M. Sohel Rahman Indexing Factors with Gaps . . . . . . . 60--70
Stanislav Angelov and
Sanjeev Khanna and
Keshav Kunal The Network as a Storage Device: Dynamic
Routing with Bounded Buffers . . . . . . 71--94
Rafael C. Carrasco and
Jan Daciuk and
Mikel L. Forcada Incremental Construction of Minimal Tree
Automata . . . . . . . . . . . . . . . . 95--110
Chandra Chekuri and
Luca Trevisan Foreword . . . . . . . . . . . . . . . . 111--112
Eyal Kaplan and
Moni Naor and
Omer Reingold Derandomized Constructions of $k$-Wise
(Almost) Independent Permutations . . . 113--133
Christopher Umans Reconstructive Dispersers and Hitting
Set Generators . . . . . . . . . . . . . 134--156
Kamalika Chaudhuri and
Satish Rao and
Samantha Riesenfeld and
Kunal Talwar What Would Edmonds Do? Augmenting Paths
and Witnesses for Degree-Bounded MSTs 157--189
Uriel Feige and
Kunal Talwar Approximating the Bandwidth of
Caterpillars . . . . . . . . . . . . . . 190--204
V. S. Anil Kumar and
Madhav V. Marathe and
Srinivasan Parthasarathy and
Aravind Srinivasan Scheduling on Unrelated Machines under
Tree-Like Precedence Constraints . . . . 205--226
Julián Mestre A Primal-Dual Approximation Algorithm
for Partial Vertex Cover: Making
Educated Guesses . . . . . . . . . . . . 227--239
Jan Remy and
Angelika Steger Approximation Schemes for Node-Weighted
Geometric Steiner Tree Problems . . . . 240--267
Lars Arge and
Emo Welzl Foreword . . . . . . . . . . . . . . . . 269--270
Jakub Pawlewicz and
Mihai Patrascu Order Statistics in the Farey Sequences
in Sublinear Time and Counting Primitive
Lattice Points in Polygons . . . . . . . 271--282
Haim Kaplan and
Natan Rubin and
Micha Sharir Linear Data Structures for Fast
Ray-Shooting amidst Convex Polyhedra . . 283--310
Julian Lorenz and
Konstantinos Panagiotou and
Angelika Steger Optimal Algorithms for $k$-Search with
Application in Option Pricing . . . . . 311--328
Peter Hachenberger Exact Minkowksi Sums of Polyhedra and
Exact and Efficient Decomposition of
Polyhedra into Convex Pieces . . . . . . 329--345
Giorgio Ausiello and
Camil Demetrescu and
Paolo G. Franciosa and
Giuseppe F. Italiano and
Andrea Ribichini Graph Spanners in the Streaming Model:
An Experimental Study . . . . . . . . . 346--374
Arie M. C. A. Koster and
Adrian Zymolka and
Manuel Kutschka Algorithms to Separate $ \{ 0, \frac
{1}{2} \} $-Chvátal-Gomory Cuts . . . . . 375--391
Frédéric Magniez and
Ashwin Nayak Foreword from the Guest Editors . . . . 393--394
Dorit Aharonov and
Vaughan Jones and
Zeph Landau A Polynomial Quantum Algorithm for
Approximating the Jones Polynomial . . . 395--421
Andris Ambainis and
Robert Spalek and
Ronald de Wolf A New Quantum Lower Bound Method, with
Applications to Direct Product Theorems
and Time-Space Tradeoffs . . . . . . . . 422--461
Ran Raz Quantum Information and the PCP Theorem 462--489
Jaikumar Radhakrishnan and
Martin Rötteler and
Pranab Sen Random Measurement Bases, Quantum State
Distinction and Applications to the
Hidden Subgroup Problem . . . . . . . . 490--516
Ben W. Reichardt Error-Detection-Based Quantum
Fault-Tolerance Threshold . . . . . . . 517--556
Miklos Santha and
Mario Szegedy Quantum and Classical Query Complexities
of Local Search Are Polynomially Related 557--575
Xiaoming Sun and
Andrew Chi-Chih Yao On the Quantum Query Complexity of Local
Search in Two and Three Dimensions . . . 576--600
Binay Bhattacharya and
Qiaosheng Shi and
Arie Tamir Optimal Algorithms for the
Path/Tree-Shaped Facility Location
Problems in Trees . . . . . . . . . . . 601--618
Peter Damaschke and
Phuong Hoai Ha and
Philippas Tsigas Online Search with Time-Varying Price
Bounds . . . . . . . . . . . . . . . . . 619--642
Leah Epstein and
Magnús M. Halldórsson and
Asaf Levin and
Hadas Shachnai Weighted Sum Coloring in Batch
Scheduling of Conflicting Jobs . . . . . 643--665
Prosenjit Bose and
Pat Morin and
Michiel Smid and
Stefanie Wuhrer Clamshell Casting . . . . . . . . . . . 666--702
Rebecca Robinson and
Graham Farr Structure and Recognition of Graphs with
No $6$-wheel Subdivision . . . . . . . . 703--728
George Christodoulou and
Elias Koutsoupias and
Angelina Vidali A Lower Bound for Scheduling Mechanisms 729--740
Takeshi Tokuyama Foreword . . . . . . . . . . . . . . . . 1--2
Takeaki Uno An Efficient Algorithm for Solving
Pseudo Clique Enumeration Problem . . . 3--16
Hiroshi Nagamochi Minimum Degree Orderings . . . . . . . . 17--34
Anna Urba\'nska Faster Combinatorial Algorithms for
Determinant and Pfaffian . . . . . . . . 35--50
Thomas Sauerwald On Mixing and Edge Expansion Properties
in Randomized Broadcasting . . . . . . . 51--88
F. Y. L. Chin and
H. F. Ting and
Y. Zhang A Constant-Competitive Algorithm for
Online OVSF Code Assignment . . . . . . 89--104
M. Ziaur Rahman and
J. Ian Munro Integer Representation and Counting in
the Bit Probe Model . . . . . . . . . . 105--127
L. Sunil Chandran and
Mathew C. Francis and
Naveen Sivadasan Geometric Representation of Graphs in
Low Dimension Using Axis Parallel Boxes 129--140
Nicolas Broutin and
Luc Devroye and
Erin McLeish Note on the Structure of Kruskal's
Algorithm . . . . . . . . . . . . . . . 141--159
A. García and
F. Hurtado and
M. Noy and
J. Tejel Augmenting the Connectivity of
Outerplanar Graphs . . . . . . . . . . . 160--179
Piotr Sankowski and
Marcin Mucha Fast Dynamic Transitive Closure with
Lookahead . . . . . . . . . . . . . . . 180--197
Viswanath Nagarajan and
R. Ravi Approximation Algorithms for Requirement
Cut on Graphs . . . . . . . . . . . . . 198--213
Amihood Amir and
Eran Chencinski Faster Two Dimensional Scaled Matching 214--234
Maarten Löffler and
Marc van Kreveld Largest and Smallest Convex Hulls for
Imprecise Points . . . . . . . . . . . . 235--269
Nikhil Bansal and
Moshe Lewenstein and
Bin Ma and
Kaizhong Zhang On the Longest Common Rigid Subsequence
Problem . . . . . . . . . . . . . . . . 270--280
Xiaodong Hu and
Jie Wang Recent Advances in Computation and
Combinatorial Optimization . . . . . . . 281--282
Jianxin Wang and
Minzhu Xie and
Jianer Chen A Practical Exact Algorithm for the
Individual Haplotyping Problem MEC/GI 283--296
Li-Pu Yeh and
Biing-Feng Wang and
Hsin-Hao Su Efficient Algorithms for the Problems of
Enumerating Cuts by Non-decreasing
Weights . . . . . . . . . . . . . . . . 297--312
Epameinondas Fritzilas and
Martin Milanic and
Sven Rahmann and
Yasmin A. Rios-Solis Structural Identifiability in Low-Rank
Matrix Factorization . . . . . . . . . . 313--332
Xianyue Li and
Feng Zou and
Yaochun Huang and
Donghyun Kim and
Weili Wu A Better Constant-Factor Approximation
for Selected-Internal Steiner Minimum
Tree . . . . . . . . . . . . . . . . . . 333--341
Ulrich Hertrampf and
Christoph Minnameier Resource Bounded Frequency Computations
with Three Errors . . . . . . . . . . . 342--363
Xi Chen and
Xiaoming Sun and
Shang-Hua Teng Quantum Separation of Local Search and
Fixed Point Computation . . . . . . . . 364--382
Andreas Brandstädt and
Tilo Klembt and
Vadim V. Lozin and
Raffaele Mosca On Independent Vertex Sets in Subclasses
of Apple-Free Graphs . . . . . . . . . . 383--393
Vladimir Kolmogorov A Faster Algorithm for Computing the
Principal Sequence of Partitions of a
Graph . . . . . . . . . . . . . . . . . 394--412
Toshimasa Ishii and
Yoko Akiyama and
Hiroshi Nagamochi Minimum Augmentation of
Edge-Connectivity between Vertices and
Sets of Vertices in Undirected Graphs 413--436
Satoru Iwata and
Yusuke Kobayashi An Algorithm for Minimum Cost
Arc-Connectivity Orientations . . . . . 437--447
Eyal Amir Approximation Algorithms for Treewidth 448--479
Sudheer Sahu and
John H. Reif Capabilities and Limits of Compact Error
Resilience Methods for Algorithmic
Self-Assembly . . . . . . . . . . . . . 480--504
Leah Epstein Bin Packing with Rejection Revisited . . 505--528
Danny Segev and
Gil Segev Approximate $k$-Steiner Forests via the
Lagrangian Relaxation Technique with
Internal Preprocessing . . . . . . . . . 529--549
Antonio Fernández and
Ernesto Jiménez and
Michel Raynal and
Gilles Trédan A Timing Assumption and Two
$t$-Resilient Protocols for Implementing
an Eventual Leader Service in
Asynchronous Shared Memory Systems . . . 550--576
Moses Charikar and
Mohammad Taghi Hajiaghayi and
Howard Karloff and
Satish Rao $ \ell 2^2 $ Spreading Metrics for
Vertex Ordering Problems . . . . . . . . 577--604
Chris Studholme and
Ian F. Blake Random Matrices and Codes for the
Erasure Channel . . . . . . . . . . . . 605--620
Henrik Blunck and
Jan Vahrenhold In-Place Algorithms for Computing
(Layers of) Maxima . . . . . . . . . . . 1--21
Feodor F. Dragan and
Chenyu Yan Collective Tree Spanners in Graphs with
Bounded Parameters . . . . . . . . . . . 22--43
Hagit Attiya and
Leah Epstein and
Hadas Shachnai and
Tami Tamir Transactional Contention Management as a
Non-Clairvoyant Scheduling Problem . . . 44--61
Gopal Pandurangan and
Wojciech Szpankowski A Universal Online Caching Algorithm
Based on Pattern Matching . . . . . . . 62--73
Chính T. Ho\`ang and
Marcin Kami\'nski and
Vadim Lozin and
Joe Sawada and
Xiao Shu Deciding $k$-Colorability of $ P_5
$-Free Graphs in Polynomial Time . . . . 74--81
Li (Erran) Li and
Mohammad Mahdian and
Vahab S. Mirrokni Secure Overlay Network Design . . . . . 82--96
Henning Fernau A Top-Down Approach to Search-Trees:
Improved Algorithmics for $3$-Hitting
Set . . . . . . . . . . . . . . . . . . 97--118
Benjamin Doerr and
Frank Neumann and
Ingo Wegener Editorial . . . . . . . . . . . . . . . 119--120
Anne Auger and
Olivier Teytaud Continuous Lunches Are Free Plus the
Design of Optimal Optimization
Algorithms . . . . . . . . . . . . . . . 121--146
Madeleine Theile and
Thomas Jansen Stability in the Self-Organized
Evolution of Networks . . . . . . . . . 147--169
Thomas Jansen and
Dennis Weyland Analysis of Evolutionary Algorithms for
the Longest Common Subsequence Problem 170--186
Joachim Reichel and
Martin Skutella Evolutionary Algorithms and Matroid
Optimization Problems . . . . . . . . . 187--206
Kannan Balakrishnan and
Bostjan Bresar and
Manoj Changat and
Sandi Klavzar and
Matjaz Kovse and
others Computing median and antimedian sets in
median graphs . . . . . . . . . . . . . 207--216
Regant Y. S. Hung and
Hing-Fung Ting Design and Analysis of Online Batching
Systems . . . . . . . . . . . . . . . . 217--231
Mingen Lin and
Yang Yang and
Jinhui Xu Improved Approximation Algorithms for
Maximum Resource Bin Packing and Lazy
Bin Covering Problems . . . . . . . . . 232--251
J. Puerto and
A. M. Rodríguez-Chía and
A. Tamir On the Planar Piecewise Quadratic
$1$-Center Problem . . . . . . . . . . . 252--283
Nir Ailon Aggregation of Partial Rankings,
$p$-Ratings and Top-$m$ Lists . . . . . 284--300
Angelo Fanelli and
Michele Flammini and
Luca Moscardelli On the Convergence of Multicast Games in
Directed Networks . . . . . . . . . . . 301--324
Tatsuya Akutsu and
Daiji Fukagawa and
Atsuhiro Takasu Approximating Tree Edit Distance through
String Edit Distance . . . . . . . . . . 325--348
E. Anderson and
J. Hall and
J. Hartline and
M. Hobbes and
A. Karlin and
others Algorithms for Data Migration . . . . . 349--380
Huaming Zhang Planar Polyline Drawings via Graph
Transformations . . . . . . . . . . . . 381--397
Liming Cai and
Xiuzhen Huang Fixed-Parameter Approximation:
Conceptual Framework and Approximability
Results . . . . . . . . . . . . . . . . 398--412
Annamária Kovács New Approximation Bounds for \sc Lpt
Scheduling . . . . . . . . . . . . . . . 413--433
Joachim Gudmundsson Editorial, SWAT 2008 Special Issue . . . 435--435
Michael A. Bekos and
Michael Kaufmann and
Martin Nöllenburg and
Antonios Symvonis Boundary Labeling with Octilinear
Leaders . . . . . . . . . . . . . . . . 436--461
Erik D. Demaine and
Stefan Langerman and
Eric Price Confluently Persistent Tries for
Efficient Version Control . . . . . . . 462--483
Matt Gibson and
Gaurav Kanade and
Erik Krohn and
Imran A. Pirwani and
Kasturi Varadarajan On Metric Clustering to Minimize the Sum
of Radii . . . . . . . . . . . . . . . . 484--498
Tobias Christ and
Michael Hoffmann and
Yoshio Okamoto and
Takeaki Uno Improved Bounds for Wireless
Localization . . . . . . . . . . . . . . 499--516
Yossi Azar and
Uriel Feige and
Daniel Glasner A Preemptive Algorithm for Maximizing
Disjoint Paths on Trees . . . . . . . . 517--537
Sergey Bereg and
Adrian Dumitrescu and
Minghui Jiang On Covering Problems of Rado . . . . . . 538--561
Bastian Degener and
Joachim Gehweiler and
Christiane Lammersen Kinetic Facility Location . . . . . . . 562--584
Gonzalo Navarro and
Rodrigo Paredes On Sorting, Heaps, and Minimum Spanning
Trees . . . . . . . . . . . . . . . . . 585--620
Peter Damaschke Homogeneous String Segmentation using
Trees and Weighted Independent Sets . . 621--640
Amos Korman and
David Peleg and
Yoav Rodeh Constructing Labeling Schemes through
Universal Matrices . . . . . . . . . . . 641--652
Spyros C. Kontogiannis and
Paul G. Spirakis Well Supported Approximate Equilibria in
Bimatrix Games . . . . . . . . . . . . . 653--667
Jörg Derungs and
Riko Jacob and
Peter Widmayer Approximate Shortest Paths Guided by a
Small Index . . . . . . . . . . . . . . 668--688
Anne Benoit and
Yves Robert Complexity Results for Throughput and
Latency Optimization of Replicated and
Data-parallel Workflows . . . . . . . . 689--724
Susanne Albers and
Tobias Jacobs An Experimental Study of New and Known
Online Packet Buffering Algorithms . . . 725--746
Dániel Marx Chordal Deletion is Fixed-Parameter
Tractable . . . . . . . . . . . . . . . 747--768
Hans Kellerer and
Vitaly A. Strusevich Fully Polynomial Approximation Schemes
for a Symmetric Quadratic Knapsack
Problem and its Scheduling Applications 769--795
Emilio Di Giacomo and
Giuseppe Liotta and
Francesco Trotta Drawing Colored Graphs with Constrained
Vertex Positions and Few Bends per Edge 796--818
Joan Boyar and
Lene M. Favrholdt Scheduling Jobs on Grid Processors . . . 819--847
Samir Khuller and
Yoo-Ah Kim and
Yung-Chun Justin Wan Broadcasting on Networks of Workstations 848--868
N. Innami and
B. H. Kim and
Y. Mashiko and
K. Shiohama The Steiner Ratio Conjecture of
Gilbert--Pollak May Still Be Open . . . 869--872
Sung-woo Cho and
Ashish Goel Pricing for Fairness: Distributed
Resource Allocation for Multiple
Objectives . . . . . . . . . . . . . . . 873--892
David F. Manlove and
Robert W. Irving and
Kazuo Iwama Guest Editorial: Special Issue on
Matching Under Preferences . . . . . . . 1--4
Péter Biró and
Eric McDermid Three-Sided Stable Matchings with Cyclic
Preferences . . . . . . . . . . . . . . 5--18
Katarína Cechlárová and
Tamás Fleiner Housing Markets Through Graphs . . . . . 19--33
Christine T. Cheng Understanding the Generalized Median
Stable Matchings . . . . . . . . . . . . 34--51
John Dabney and
Brian C. Dean An Efficient Algorithm for Batch
Stability Testing . . . . . . . . . . . 52--58
Brian C. Dean and
Siddharth Munshi Faster Algorithms for Stable Allocation
Problems . . . . . . . . . . . . . . . . 59--81
Tamás Fleiner The Stable Roommates Problem with Choice
Functions . . . . . . . . . . . . . . . 82--101
Patrik Floréen and
Petteri Kaski and
Valentin Polishchuk and
Jukka Suomela Almost Stable Matchings by Truncating
the Gale--Shapley Algorithm . . . . . . 102--118
Naveen Garg and
Telikepalli Kavitha and
Amit Kumar and
Kurt Mehlhorn and
Julián Mestre Assigning Papers to Referees . . . . . . 119--136
Chien-Chung Huang Circular Stable Matching and $3$-way
Kidney Transplant . . . . . . . . . . . 137--150
Hirotatsu Kobayashi and
Tomomi Matsui Cheating Strategies for the
Gale--Shapley Algorithm with Complete
Preference Lists . . . . . . . . . . . . 151--169
Dániel Marx and
Ildikó Schlotter Parameterized Complexity and Local
Search Approaches for the Stable
Marriage Problem with Ties . . . . . . . 170--187
Jun Wako A Polynomial--Time Algorithm to Find von
Neumann--Morgenstern Stable Matchings in
Marriage Games . . . . . . . . . . . . . 188--220
Karim Dou\"\ieb and
Stefan Langerman Near-Entropy Hotlink Assignments . . . . 221--244
Refael Hassin and
Jérôme Monnot and
Danny Segev The Complexity of Bottleneck Labeled
Graph Problems . . . . . . . . . . . . . 245--262
Ho-Leung Chan and
Tak-Wah Lam and
Wing-Kin Sung and
Siu-Lung Tam and
Swee-Seong Wong Compressed Indexes for Approximate
String Matching . . . . . . . . . . . . 263--281
Paola Bonizzoni and
Gianluca Della Vedova and
Riccardo Dondi and
Giancarlo Mauri Fingerprint Clustering with Bounded
Number of Missing Values . . . . . . . . 282--303
Anders Gidenstam and
Marina Papatriantafilou and
Philippas Tsigas NBmalloc: Allocating Memory in a
Lock-Free Manner . . . . . . . . . . . . 304--338
Ulrich Lauther and
Tamás Lukovszki Space Efficient Algorithms for the
Burrows--Wheeler Backtransformation . . 339--351
Pankaj K. Agarwal and
Sergey Bereg and
Ovidiu Daescu and
Haim Kaplan and
Simeon Ntafos and
others Guarding a Terrain by Two Watchtowers 352--390
Florian Diedrich and
Klaus Jansen and
Fanny Pascual and
Denis Trystram Approximation Algorithms for Scheduling
with Reservations . . . . . . . . . . . 391--404
Christophe Crespelle and
Christophe Paul Fully Dynamic Algorithm for Recognition
and Modular Decomposition of Permutation
Graphs . . . . . . . . . . . . . . . . . 405--432
Seok-Hee Hong and
Hiroshi Nagamochi A Linear-Time Algorithm for Symmetric
Convex Drawings of Internally
Triconnected Plane Graphs . . . . . . . 433--460
Susanne Albers New Results on Web Caching with Request
Reordering . . . . . . . . . . . . . . . 461--477
Seok-Hee Hong and
Hiroshi Nagamochi Approximation Algorithms for Minimizing
Edge Crossings in Radial Drawings . . . 478--497
Joseph Wun-Tat Chan and
Francis Y. L. Chin and
Deshi Ye and
Yong Zhang Absolute and Asymptotic Bounds for
Online Frequency Allocation in Cellular
Networks . . . . . . . . . . . . . . . . 498--515
I. Caragiannis and
A. Ferreira and
C. Kaklamanis and
S. Pérennes and
H. Rivano Fractional Path Coloring in Bounded
Degree Trees with Applications . . . . . 516--540
Benjamin Doerr and
Frank Neumann In Memoriam: Ingo Wegener . . . . . . . 541--542
Sergio Cabello and
Herman Haverkort and
Marc van Kreveld and
Bettina Speckmann Algorithmic Aspects of Proportional
Symbol Maps . . . . . . . . . . . . . . 543--565
Elena Grigorieva and
P. Jean-Jacques Herings and
Rudolf Müller and
Dries Vermeulen On the Fastest Vickrey Algorithm . . . . 566--590
Leena Salmela and
Jorma Tarhio and
Petri Kalsi Approximate Boyer--Moore String Matching
for Small Alphabets . . . . . . . . . . 591--609
Gilad Goraly and
Refael Hassin Multi-Color Pebble Motion on Graphs . . 610--636
Louis Ibarra A Fully Dynamic Graph Algorithm for
Recognizing Interval Graphs . . . . . . 637--678
Katerina Asdre and
Stavros D. Nikolopoulos The $1$-Fixed-Endpoint Path Cover
Problem is Polynomial on Interval Graphs 679--710
Prosenjit Bose and
Paz Carmi and
Mohammad Farshi and
Anil Maheshwari and
Michiel Smid Computing the Greedy Spanner in
Near-Quadratic Time . . . . . . . . . . 711--729
James Allen Fill and
Takéhiko Nakama Analysis of the Expected Number of Bit
Comparisons Required by Quickselect . . 730--769
Lukasz Kowalik Fast $3$-coloring Triangle-Free Planar
Graphs . . . . . . . . . . . . . . . . . 770--789
Frederic Dorn and
Eelko Penninkx and
Hans L. Bodlaender and
Fedor V. Fomin Efficient Exact Algorithms on Planar
Graphs: Exploiting Sphere Cut
Decompositions . . . . . . . . . . . . . 790--810
Mira Gonen and
Dana Ron On the Benefits of Adaptivity in
Property Testing of Dense Graphs . . . . 811--830
Omer Barkol and
Yuval Ishai and
Enav Weinreb On Locally Decodable Codes,
Self-Correctable Codes, and $t$-Private
PIR . . . . . . . . . . . . . . . . . . 831--859
Mohsen Bayati and
Jeong Han Kim and
Amin Saberi A Sequential Algorithm for Generating
Random Graphs . . . . . . . . . . . . . 860--910
Sam Greenberg and
Dana Randall Slow Mixing of Markov Chains Using Fault
Lines and Fat Contours . . . . . . . . . 911--927
Xiaotie Deng and
Fan Chung Graham Introduction to the Special Section on
Internet and Network Economics . . . . . 928--929
Yiling Chen and
Stanko Dimitrov and
Rahul Sami and
Daniel M. Reeves and
David M. Pennock and
others Gaming Prediction Markets: Equilibrium
Strategies with a Market Maker . . . . . 930--969
Tian-Ming Bu and
Li Liang and
Qi Qi On Robustness of Forward-looking in
Sponsored Search Auction . . . . . . . . 970--989
John Langford and
Lihong Li and
Yevgeniy Vorobeychik and
Jennifer Wortman Maintaining Equilibria During
Exploration in Sponsored Search Auctions 990--1021
S. Muthukrishnan and
Martin Pál and
Zoya Svitkina Stochastic Models for Budget
Optimization in Search-Based Advertising 1022--1044
Eduardo Sany Laber and
Claudson Bornstein and
Cristina Fernandes Guest Editorial: Special Issue on Latin
American Theoretical Informatics
Symposium (LATIN) . . . . . . . . . . . 1--2
Marshall Bern and
Barry Hayes Origami Embedding of Piecewise-Linear
Two-Manifolds . . . . . . . . . . . . . 3--15
I. Rapaport and
K. Suchan and
I. Todinca and
J. Verstraete On Dissemination Thresholds in Regular
and Irregular Graph Classes . . . . . . 16--34
Yoshifumi Inui and
François Le Gall Quantum Property Testing of Group
Solvability . . . . . . . . . . . . . . 35--47
Daudé Hervé and
Ravelomanana Vlady Random 2 XORSAT Phase Transition . . . . 48--65
Anupam Gupta and
Kunal Talwar Making Doubling Metrics Geodesic . . . . 66--80
Brian C. Dean and
Adam Griffis and
Ojas Parekh and
Adam Whitley Approximation Algorithms for $k$-hurdle
Problems . . . . . . . . . . . . . . . . 81--93
Amol Deshpande and
Samir Khuller and
Azarakhsh Malekian and
Mohammed Toossi Energy Efficient Monitoring in Sensor
Networks . . . . . . . . . . . . . . . . 94--114
Micha Streppel and
Ke Yi Approximate Range Searching in External
Memory . . . . . . . . . . . . . . . . . 115--128
Jean Cardinal and
Erik D. Demaine and
Samuel Fiorini and
Gwenaël Joret and
Stefan Langerman and
others The Stackelberg Minimum Spanning Tree
Game . . . . . . . . . . . . . . . . . . 129--144
A. García and
J. Tejel Augmenting the Rigidity of a Graph in $
R^2 $ . . . . . . . . . . . . . . . . . 145--168
Frédéric Havet and
Martin Klazar and
Jan Kratochvíl and
Dieter Kratsch and
Mathieu Liedloff Exact Algorithms for $ L(2, 1)
$-Labeling of Graphs . . . . . . . . . . 169--194
Viet Tung Hoang and
Wing-Kin Sung Improved Algorithms for Maximum
Agreement and Compatible Supertrees . . 195--214
Benson L. Joeris and
Min Chih Lin and
Ross M. McConnell and
Jeremy P. Spinrad and
Jayme L. Szwarcfiter Linear-Time Recognition of Helly
Circular-Arc Models and Graphs . . . . . 215--239
Lukasz Kowalik and
Marcin Mucha $ 35 / 44 $-approximation for Asymmetric
Maximum TSP with Triangle Inequality . . 240--255
Christoph Dürr and
Mathilde Hurand Finding Total Unimodularity in
Optimization Problems Solved by Linear
Programs . . . . . . . . . . . . . . . . 256--268
Dong Kyue Kim and
Joong Chae Na and
Jeong Seop Sim and
Kunsoo Park Linear-Time Construction of
Two-Dimensional Suffix Trees . . . . . . 269--297
Benjamin Doerr and
Thomas Jansen Theory of Evolutionary Computation . . . 299--300
Martin Dietzfelbinger and
Jonathan E. Rowe and
Ingo Wegener and
Philipp Woelfel Precision, Local Search and Unimodal
Functions . . . . . . . . . . . . . . . 301--322
Frank Neumann and
Joachim Reichel and
Martin Skutella Computing Minimum Cuts by Randomized
Search Heuristics . . . . . . . . . . . 323--342
Dirk Sudholt Hybridizing Evolutionary Algorithms with
Variable-Depth Search to Overcome Local
Optima . . . . . . . . . . . . . . . . . 343--368
Pietro S. Oliveto and
Carsten Witt Simplified Drift Analysis for Proving
Lower Bounds in Evolutionary Computation 369--386
Hervé Fournier and
Olivier Teytaud Lower Bounds for Comparison Based
Evolution Strategies Using VC-dimension
and Sign Patterns . . . . . . . . . . . 387--408
Jens Jägersküpper Combining Markov-Chain Analysis and
Drift Analysis: The $ (1 + 1) $
Evolutionary Algorithm on Linear
Functions Reloaded . . . . . . . . . . . 409--424
Mohamed Jebalia and
Anne Auger and
Nikolaus Hansen Log-Linear Convergence and Divergence of
the Scale-Invariant $ (1 + 1) $-ES in
Noisy Environments . . . . . . . . . . . 425--460
Igor L. Markov and
Yaoyun Shi Constant-Degree Graph Expansions that
Preserve Treewidth . . . . . . . . . . . 461--470
Telikepalli Kavitha and
Kurt Mehlhorn and
Dimitrios Michail New Approximation Algorithms for Minimum
Cycle Bases of Graphs . . . . . . . . . 471--488
Jochen Könemann and
Ojas Parekh and
Danny Segev A Unified Approach to Approximating
Partial Covering Problems . . . . . . . 489--509
Mingyu Xiao and
Leizhen Cai and
Andrew Chi-Chih Yao Tight Approximation Ratio of a General
Greedy Splitting Algorithm for the
Minimum $k$-Way Cut Problem . . . . . . 510--520
Victor Chepoi and
Morgan Seston Seriation in the Presence of Errors: a
Factor 16 Approximation Algorithm for $
l_\infty $-Fitting Robinson Structures
to Distances . . . . . . . . . . . . . . 521--568
Nikhil Bansal and
Ho-Leung Chan and
Kirk Pruhs Competitive Algorithms for Due Date
Scheduling . . . . . . . . . . . . . . . 569--582
Liam Roditty and
Michael Segal On Bounded Leg Shortest Paths Problems 583--600
Eduardo Laber and
Marco Molinaro An Approximation Algorithm for Binary
Searching in Trees . . . . . . . . . . . 601--620
Asaf Shapira and
Raphael Yuster and
Uri Zwick All-Pairs Bottleneck Paths in Vertex
Weighted Graphs . . . . . . . . . . . . 621--633
Dan Halperin and
Kurt Mehlhorn Guest Editorial: Selected Papers from
European Symposium on Algorithms . . . . 1--2
Zoltán Király Better and Simpler Approximation
Algorithms for the Stable Marriage
Problem . . . . . . . . . . . . . . . . 3--20
Andreas Bley An Integer Programming Algorithm for
Routing Optimization in IP Networks . . 21--45
Hamid Zarrabi-Zadeh An Almost Space-Optimal Streaming
Algorithm for Coresets in Fixed
Dimensions . . . . . . . . . . . . . . . 46--59
Daniel Delling Time-Dependent SHARC-Routing . . . . . . 60--94
Hervé Fournier and
Antoine Vigneron Fitting a Step Function to a Point Set 95--109
Anke van Zuylen Deterministic Sampling Algorithms for
Network Design . . . . . . . . . . . . . 110--151
Danny Z. Chen and
Shuang Luan and
Chao Wang Coupled Path Planning, Region
Optimization, and Applications in
Intensity-modulated Radiation Therapy 152--174
Steffen Heber and
Richard Mayr and
Jens Stoye Common Intervals of Multiple
Permutations . . . . . . . . . . . . . . 175--206
Leo van Iersel and
Steven Kelk Constructing the Simplest Possible
Phylogenetic Network from Triplets . . . 207--235
Michel Barbeau and
Prosenjit Bose and
Paz Carmi and
Mathieu Couture and
Evangelos Kranakis Location-Oblivious Distributed Unit Disk
Graph Coloring . . . . . . . . . . . . . 236--249
Mohammad Ali Abam and
Pankaj K. Agarwal and
Mark de Berg and
Hai Yu Out-of-Order Event Processing in Kinetic
Data Structures . . . . . . . . . . . . 250--273
Mong-Jen Kao and
Chung-Shou Liao and
D. T. Lee Capacitated Domination Problem . . . . . 274--300
Srikrishnan Divakaran and
Michael Saks An Online Algorithm for a Problem in
Scheduling with Set-ups and Release
Times . . . . . . . . . . . . . . . . . 301--315
Sebastian Böcker and
Sebastian Briesemeister and
Gunnar W. Klau Exact Algorithms for Cluster Editing:
Evaluation and Experiments . . . . . . . 316--334
Ohad Lipsky and
Ely Porat Approximate Pattern Matching with the $
L_1 $, $ L_2 $ and $ L_\infty $ Metrics 335--348
Boris Aronov and
Marc van Kreveld and
Maarten Löffler and
Rodrigo I. Silveira Peeling Meshed Potatoes . . . . . . . . 349--367
Leah Epstein and
Elena Kleiman Selfish Bin Packing . . . . . . . . . . 368--394
Zachary Friggstad and
Mohammad R. Salavatipour Approximability of Packing Disjoint
Cycles . . . . . . . . . . . . . . . . . 395--400
Oded Lachish and
Ilan Newman Testing Periodicity . . . . . . . . . . 401--420
Nikhil Bansal and
Danny Z. Chen and
Don Coppersmith and
Xiaobo S. Hu and
Shuang Luan and
others Shape Rectangularization Problems in
Intensity-Modulated Radiation Therapy 421--450
Khaled Elbassioni and
Erik Krohn and
Domagoj Matijevi\'c and
Julián Mestre and
Domagoj Severdija Improved Approximations for Guarding
1.5-Dimensional Terrains . . . . . . . . 451--463
Ami Litman and
Shiri Moran-Schein On Centralized Smooth Scheduling . . . . 464--480
Farhad Shahrokhi Guest Editor's Foreword: Algorithms,
Combinatorics, & Geometry . . . . . . . . 481--483
Sergio Cabello and
Bojan Mohar Crossing Number and Weighted Crossing
Number of Near-Planar Graphs . . . . . . 484--504
Michael T. Goodrich and
Roberto Tamassia and
Nikos Triandopoulos Efficient Authenticated Data Structures
for Graph Connectivity and Geometric
Search Problems . . . . . . . . . . . . 505--552
Daniel W. Cranston and
Seog-Jin Kim and
Gexin Yu Injective Colorings of Graphs with Low
Average Degree . . . . . . . . . . . . . 553--568
Ulrik Brandes and
Cesim Erten and
Alejandro Estrella-Balderrama and
J. Joseph Fowler and
Fabrizio Frati and
others Colored Simultaneous Geometric
Embeddings and Universal Pointsets . . . 569--592
Fenghui Zhang and
Anxiao (Andrew) Jiang and
Jianer Chen On the Planarization of Wireless Sensor
Networks . . . . . . . . . . . . . . . . 593--608
Marcus Schaefer and
Eric Sedgwick and
Daniel Stefankovic Spiraling and Folding: The Word View . . 609--626
Adrian Dumitrescu and
Csaba D. Tóth Minimum Weight Convex Steiner Partitions 627--652
Wolfgang Bein and
Lawrence L. Larmore and
John Noga and
Rüdiger Reischuk Knowledge State Algorithms . . . . . . . 653--678
Michael J. Pelsmajer and
Marcus Schaefer and
Daniel Stefankovic Crossing Numbers of Graphs with Rotation
Systems . . . . . . . . . . . . . . . . 679--702
Adrian Dumitrescu and
Minghui Jiang Sweeping Points . . . . . . . . . . . . 703--717
Emanuele G. Fusco and
Andrzej Pelc Trade-offs Between the Size of Advice
and Broadcasting Time in Trees . . . . . 719--734
Guy Kortsarz and
Vahab S. Mirrokni and
Zeev Nutov and
Elena Tsanko Approximating Minimum-Power Degree and
Connectivity Problems . . . . . . . . . 735--742
Martin Hoefer Competitive Cost Sharing with Economies
of Scale . . . . . . . . . . . . . . . . 743--765
Eldar Fischer and
Orly Yahalom Testing Convexity Properties of Tree
Colorings . . . . . . . . . . . . . . . 766--805
Michael Arnold and
Enno Ohlebusch Linear Time Algorithms for
Generalizations of the Longest Common
Substring Problem . . . . . . . . . . . 806--818
Robert Dabrowski and
Wojciech Plandowski On Word Equations in One Variable . . . 819--828
Bojan Djordjevic and
Joachim Gudmundsson and
Anh Pham and
Thomas Wolle Detecting Regular Visit Patterns . . . . 829--852
Mohammad Ghodsi and
Hamid Mahini and
Vahab S. Mirrokni and
Morteza Zadimoghaddam Permutation Betting Markets: Singleton
Betting with Extra Information . . . . . 853--876
Nikhil Bansal and
David P. Bunde and
Ho-Leung Chan and
Kirk Pruhs Average Rate Speed Scaling . . . . . . . 877--889
Patrizio Angelini and
Giuseppe Di Battista and
Maurizio Patrignani Finding a Minimum-depth Embedding of a
Planar Graph in $ O(n^4) $ Time . . . . 890--937
Joshua Buresh-Oppenheim and
Sashka Davis and
Russell Impagliazzo A Stronger Model of Dynamic Programming
Algorithms . . . . . . . . . . . . . . . 938--968
Zhi-Zhong Chen and
Guohui Lin and
Lusheng Wang An Approximation Algorithm for the
Minimum Co-Path Set Problem . . . . . . 969--986
Athanassios Koutsonas and
Dimitrios M. Thilikos Planar Feedback Vertex Set and Face
Cover: Combinatorial Bounds and
Subexponential Algorithms . . . . . . . 987--1003
Joachim Gudmundsson and
Pat Morin and
Michiel Smid Algorithms for Marketing-Mix
Optimization . . . . . . . . . . . . . . 1004--1016
Viswanath Nagarajan and
R. Ravi The Directed Orienteering Problem . . . 1017--1030
Amos Fiat Special Issue: European Symposium on
Algorithms, Design and Analysis . . . . 1--2
Markus Bläser and
Christian Hoffmann Fast Evaluation of Interlace Polynomials
on Graphs of Bounded Treewidth . . . . . 3--35
Andrzej Lingas A Fast Output-Sensitive Algorithm for
Boolean Matrix Multiplication . . . . . 36--50
Paolo Ferragina and
Igor Nitto and
Rossano Venturini On Optimally Partitioning a Text to
Improve Its Compression . . . . . . . . 51--74
David Pritchard and
Deeparnab Chakrabarty Approximability of Sparse Integer
Programs . . . . . . . . . . . . . . . . 75--93
Adrian Dumitrescu and
Minghui Jiang Piercing Translates and Homothets of a
Convex Body . . . . . . . . . . . . . . 94--115
George Christodoulou and
Elias Koutsoupias and
Paul G. Spirakis On the Performance of Approximate
Equilibria in Congestion Games . . . . . 116--140
Yuval Emek $k$-Outerplanar Graphs, Planar Duality,
and Low Stretch Spanning Trees . . . . . 141--160
Navin Goyal and
Neil Olver and
F. Bruce Shepherd Dynamic vs. Oblivious Routing in Network
Design . . . . . . . . . . . . . . . . . 161--173
Haim Kaplan and
Yahav Nussbaum Maximum Flow in Directed Planar Graphs
with Vertex Capacities . . . . . . . . . 174--189
Moses Charikar and
MohammadTaghi Hajiaghayi and
Howard Karloff Improved Approximation Algorithms for
Label Cover Problems . . . . . . . . . . 190--206
Mohammad Ali Abam and
Mark de Berg and
Mohammad Farshi and
Joachim Gudmundsson and
Michiel Smid Geometric Spanners for Weighted Point
Sets . . . . . . . . . . . . . . . . . . 207--225
Davide Bil\`o and
Hans-Joachim Böckenhauer and
Dennis Komm and
Richard Královic and
Tobias Mömke and
Sebastian Seibert and
Anna Zych Reoptimization of the Shortest Common
Superstring Problem . . . . . . . . . . 227--251
Fedor V. Fomin and
Petr A. Golovach and
Jan Kratochvíl and
Dieter Kratsch and
Mathieu Liedloff Branch and Recharge: Exact Algorithms
for Generalized Domination . . . . . . . 252--273
Vittorio Bil\`o and
Angelo Fanelli and
Michele Flammini and
Luca Moscardelli Graphical Congestion Games . . . . . . . 274--297
Rene Beier and
Stefan Funke and
Domagoj Matijevi\'c and
Peter Sanders Energy-Efficient Paths in Radio Networks 298--319
Kyriaki Ioannidou and
George B. Mertzios and
Stavros D. Nikolopoulos The Longest Path Problem has a
Polynomial Solution on Interval Graphs 320--341
Ernst Althaus and
Stefan Canzar and
Khaled Elbassioni and
Andreas Karrenbauer and
Julián Mestre Approximation Algorithms for the
Interval Constrained Coloring Problem 342--361
Hans L. Bodlaender and
Michael R. Fellows and
Michael A. Langston and
Mark A. Ragan and
Frances A. Rosamond and
Mark Weyer Quadratic Kernelization for Convex
Recoloring of Trees . . . . . . . . . . 362--388
Liam Roditty and
Uri Zwick On Dynamic Shortest Paths Problems . . . 389--401
Kuo-Hua Kao and
Jou-Ming Chang and
Yue-Li Wang and
Justie Su-Tzu Juan A Quadratic Algorithm for Finding
Next-to-Shortest Paths in Graphs . . . . 402--418
Thomas Moscibroda and
Stefan Schmid and
Roger Wattenhofer Topological Implications of Selfish
Neighbor Selection in Unstructured
Peer-to-Peer Networks . . . . . . . . . 419--446
Xi Chen and
Xiaotie Deng and
Becky Jie Liu On Incentive Compatible Competitive
Selection Protocols . . . . . . . . . . 447--462
Michael A. Bender and
Gerth Stòlting Brodal and
Rolf Fagerberg and
Dongdong Ge and
Simai He and
Haodong Hu and
John Iacono and
Alejandro López-Ortiz The Cost of Cache-Oblivious Searching 463--505
Ho-Leung Chan and
Jeff Edmonds and
Tak-Wah Lam and
Lap-Kei Lee and
Alberto Marchetti-Spaccamela and
Kirk Pruhs Nonclairvoyant Speed Scaling for Flow
and Energy . . . . . . . . . . . . . . . 507--517
Valerie King and
Cynthia Phillips and
Jared Saia and
Maxwell Young Sleeping on the Job: Energy-Efficient
and Robust Broadcast for Radio Networks 518--554
Benjamin A. Burton Searching a Bitstream in Linear Time for
the Longest Substring of Any Given
Density . . . . . . . . . . . . . . . . 555--579
Ilias Diakonikolas and
Homin K. Lee and
Kevin Matulef and
Rocco A. Servedio and
Andrew Wan Efficiently Testing Sparse $ \mathrm
{GF}(2) $ Polynomials . . . . . . . . . 580--605
Ioannis Caragiannis and
Michele Flammini and
Christos Kaklamanis and
Panagiotis Kanellopoulos and
Luca Moscardelli Tight Bounds for Selfish and Greedy Load
Balancing . . . . . . . . . . . . . . . 606--637
Noga Alon and
Gregory Gutin and
Eun Jung Kim and
Stefan Szeider and
Anders Yeo Solving MAX-$r$-SAT Above a Tight Lower
Bound . . . . . . . . . . . . . . . . . 638--655
Danny Z. Chen and
Konrad Engel and
Chao Wang A New Algorithm for a Field Splitting
Problem in Intensity-Modulated Radiation
Therapy . . . . . . . . . . . . . . . . 656--673
Kevin Buchin and
Maarten Löffler and
Pat Morin and
Wolfgang Mulzer Preprocessing Imprecise Points for
Delaunay Triangulation: Simplified and
Extended . . . . . . . . . . . . . . . . 674--693
Haim Kaplan and
Yahav Nussbaum A Simpler Linear-Time Recognition of
Circular-Arc Graphs . . . . . . . . . . 694--737
Chien-Chung Huang and
Telikepalli Kavitha and
Dimitrios Michail and
Meghana Nasre Bounded Unpopularity Matchings . . . . . 738--757
Chris Dowden and
Louigi Addario-Berry Subgraphs of $4$-Regular Planar Graphs 758--776
Seok-Hee Hong and
Hiroshi Nagamochi Editorial: ISAAC 2008 Special Issue . . 777--778
Jin-Yi Cai and
Pinyan Lu Signature Theory in Holographic
Algorithms . . . . . . . . . . . . . . . 779--816
Hans L. Bodlaender and
Pinar Heggernes and
Yngve Villanger Faster Parameterized Algorithms for
Minimum Fill-in . . . . . . . . . . . . 817--838
Fedor V. Fomin and
Petr A. Golovach and
Alex Hall and
Matús Mihalák and
Elias Vicari and
others How to Guard a Graph? . . . . . . . . . 839--856
Sounaka Mishra and
Venkatesh Raman and
Saket Saurabh and
Somnath Sikdar and
C. R. Subramanian The Complexity of König Subgraph Problems
and Above-Guarantee Vertex Cover . . . . 857--881
Joachim Kneis and
Alexander Langer and
Peter Rossmanith A New Algorithm for Finding Trees with
Many Leaves . . . . . . . . . . . . . . 882--897
Maxim A. Babenko An Efficient Scaling Algorithm for the
Minimum Weight Bibranching Problem . . . 898--922
Sang Won Bae and
Sunghee Choi and
Chunseok Lee and
Shin-ichi Tanigawa Exact Algorithms for the Bottleneck
Steiner Tree Problem . . . . . . . . . . 924--948
Jiong Guo and
Iyad A. Kanj and
Christian Komusiewicz and
Johannes Uhlmann Editing Graphs into Disjoint Unions of
Dense Clusters . . . . . . . . . . . . . 949--970
Marwan Al-Jubeh and
Mashhood Ishaque and
Kristóf Rédei and
Diane L. Souvaine and
Csaba D. Tóth and
others Augmenting the Edge Connectivity of
Planar Straight Line Graphs to Three . . 971--999
Minming Li and
Peng-Jun Wan and
Frances Yao Tighter Approximation Bounds for Minimum
CDS in Unit Disk Graphs . . . . . . . . 1000--1021
Seok-Hee Hong and
Hiroshi Nagamochi Extending Steinitz's Theorem to Upward
Star-Shaped Polyhedra and Spherical
Polyhedra . . . . . . . . . . . . . . . 1022--1076
Daisuke Yamaguchi and
Shinji Imahori and
Ryuhei Miyashiro and
Tomomi Matsui An Improved Approximation Algorithm for
the Traveling Tournament Problem . . . . 1077--1091
Decheng Dai and
Rong Ge Another Sub-exponential Algorithm for
the Simple Stochastic Game . . . . . . . 1092--1104
Mariano Zelke Weighted Matching in the Semi-Streaming
Model . . . . . . . . . . . . . . . . . 1--20
Vida Dujmovi\'c and
John Howat and
Pat Morin Biased Range Trees . . . . . . . . . . . 21--37
Babak Farzad and
Lap Chi Lau and
Van Bang Le and
Nguyen Ngoc Tuy Complexity of Finding Graph Roots with
Girth Conditions . . . . . . . . . . . . 38--53
Diego Arroyuelo and
Gonzalo Navarro and
Kunihiko Sadakane Stronger Lempel--Ziv Based Compressed
Text Indexing . . . . . . . . . . . . . 54--101
Leah Epstein and
Asaf Levin and
Rob van Stee Approximation Schemes for Packing
Splittable Items with Cardinality
Constraints . . . . . . . . . . . . . . 102--129
Olivier Bernardi and
Omer Giménez A Linear Algorithm for the Random
Sampling from Regular Languages . . . . 130--145
Victor Chepoi and
Tristan Fevat and
Emmanuel Godard and
Yann Vax\`es A Self-stabilizing Algorithm for the
Median Problem in Partial Rectangular
Grids and Their Relatives . . . . . . . 146--168
Beat Gfeller Faster Swap Edge Computation in Minimum
Diameter Spanning Trees . . . . . . . . 169--191
Jens M. Schmidt Construction Sequences and Certifying
$3$-connectivity . . . . . . . . . . . . 192--208
Philip Bille and
Inge Li Gòrtz Fast Arc-Annotated Subsequence Matching
in Linear Space . . . . . . . . . . . . 209--223
Jérémy Barbay and
Luca Castelli Aleardi and
Meng He and
J. Ian Munro Succinct Representation of Labeled
Graphs . . . . . . . . . . . . . . . . . 224--257
Kunal Agrawal and
Anne Benoit and
Fanny Dufossé and
Yves Robert Mapping Filtering Streaming Applications 258--308
Kevin Buchin and
Maike Buchin and
Jaroslaw Byrka and
Martin Nöllenburg and
Yoshio Okamoto and
others Drawing (Complete) Binary Tanglegrams
Hardness, Approximation, Fixed-Parameter
Tractability . . . . . . . . . . . . . . 309--332
Nedialko B. Dimitrov and
C. Greg Plaxton Competitive Weighted Matching in
Transversal Matroids . . . . . . . . . . 333--348
Matthew J. Katz and
Gila Morgenstern A Scheme for Computing Minimum Covers
within Simple Regions . . . . . . . . . 349--360
Sergio Cabello Many Distances in Planar Graphs . . . . 361--381
Nicolas Bourgeois and
Bruno Escoffier and
Vangelis T. Paschos and
Johan M. M. van Rooij Fast Algorithms for max independent set 382--415
Frank Dehne and
Masoud T. Omran and
Jörg-Rüdiger Sack Shortest Paths in Time-Dependent FIFO
Networks . . . . . . . . . . . . . . . . 416--435
Chandra Chekuri and
Nitish Korula Pruning $2$-Connected Graphs . . . . . . 436--463
Hee-Kap Ahn and
Otfried Cheong Aligning Two Convex Figures to Minimize
Area or Perimeter . . . . . . . . . . . 464--479
Gábor Ivanyos and
Luc Sanselme and
Miklos Santha An Efficient Quantum Algorithm for the
Hidden Subgroup Problem in Nil-$2$
Groups . . . . . . . . . . . . . . . . . 480--498
Jirí Fiala and
Marcin Kami\'nski and
Bernard Lidický and
Daniël Paulusma The $k$-in-a-Path Problem for Claw-free
Graphs . . . . . . . . . . . . . . . . . 499--519
Elliot Anshelevich and
Deeparnab Chakrabarty and
Ameya Hate and
Chaitanya Swamy Approximability of the Firefighter
Problem Computing Cuts over Time . . . . 520--536
Pim van 't Hof and
Marcin Kami\'nski and
Daniël Paulusma Finding Induced Paths of Given Parity in
Claw-Free Graphs . . . . . . . . . . . . 537--563
Michael Dom and
Michael R. Fellows and
Frances A. Rosamond and
Somnath Sikdar The Parameterized Complexity of Stabbing
Rectangles . . . . . . . . . . . . . . . 564--594
Dan Alistarh and
Seth Gilbert and
Rachid Guerraoui and
Corentin Travers Of Choices, Failures and Asynchrony: The
Many Faces of Set Agreement . . . . . . 595--629
A. O. Ivanov and
A. A. Tuzhilin The Steiner Ratio Gilbert--Pollak
Conjecture Is Still Open Clarification
Statement . . . . . . . . . . . . . . . 630--632
André Berger and
Ojas Parekh Erratum to: Linear Time Algorithms for
Generalized Edge Dominating Set Problems 633--634
Anonymous Philippe Flajolet, the Father of
Analytic Combinatorics . . . . . . . . . 635--636
Serge Gaspers and
Dieter Kratsch and
Mathieu Liedloff On Independent Sets and Bicliques in
Graphs . . . . . . . . . . . . . . . . . 637--658
Agustín Bompadre Exponential Lower Bounds on the
Complexity of a Class of Dynamic
Programs for Combinatorial Optimization
Problems . . . . . . . . . . . . . . . . 659--700
Yuichi Yoshida and
Hiro Ito Property Testing on
$k$-Vertex-Connectivity of Graphs . . . 701--712
Victor Chepoi and
Feodor F. Dragan and
Bertrand Estellon and
Michel Habib and
Yann Vax\`es and
others Additive Spanners and Distance and
Routing Labeling Schemes for Hyperbolic
Graphs . . . . . . . . . . . . . . . . . 713--732
Patrick Briest and
Martin Hoefer and
Piotr Krysta Stackelberg Network Pricing Games . . . 733--753
Amr Elmasry and
Kurt Mehlhorn and
Jens M. Schmidt An $ O(n + m) $ Certifying
Triconnnectivity Algorithm for
Hamiltonian Graphs . . . . . . . . . . . 754--766
Petra Berenbrink and
Tom Friedetzky and
Iman Hajirasouliha and
Zengjian Hu Convergence to Equilibria in
Distributed, Selfish Reallocation
Processes with Weighted Tasks . . . . . 767--786
Kazumasa Okumoto and
Takuro Fukunaga and
Hiroshi Nagamochi Divide-and-Conquer Algorithms for
Partitioning Hypergraphs and Submodular
Systems . . . . . . . . . . . . . . . . 787--806
Dániel Marx and
Ildikó Schlotter Obtaining a Planar Graph by Vertex
Deletion . . . . . . . . . . . . . . . . 807--822
Takehiro Ito and
Takao Nishizeki and
Michael Schröder and
Takeaki Uno and
Xiao Zhou Partitioning a Weighted Tree into
Subtrees with Weights in a Given Range 823--841
Alireza Zarei and
Mohammad Ghodsi Efficient Observer-Dependent
Simplification in Polygonal Domains . . 842--862
Michael L. Fredman Generalizing a Theorem of Wilber on
Rotations in Binary Search Trees to
Encompass Unordered Binary Trees . . . . 863--878
Mahmoud Fouz and
Manfred Kufleitner and
Bodo Manthey and
Nima Zeini Jahromi On Smoothed Analysis of Quicksort and
Hoare's Find . . . . . . . . . . . . . . 879--905
MohammadHossein Bateni and
MohammadTaghi Hajiaghayi Euclidean Prize-Collecting Steiner
Forest . . . . . . . . . . . . . . . . . 906--929
René van Bevern and
Hannes Moser and
Rolf Niedermeier Approximation and Tidying--- a Problem
Kernel for $s$-Plex Cluster Vertex
Deletion . . . . . . . . . . . . . . . . 930--950
Jing Xiao and
Tiancheng Lou and
Tao Jiang An Efficient Algorithm for Haplotype
Inference on Pedigrees with a Small
Number of Recombinants . . . . . . . . . 951--981
Tobias Jacobs On the Complexity of Optimal Hotlink
Assignment . . . . . . . . . . . . . . . 982--1005
Paola Flocchini and
David Ilcinkas and
Nicola Santoro Ping Pong in Dangerous Graphs: Optimal
Black Hole Search with Pebbles . . . . . 1006--1033
Vincenzo Bonifaci and
Alberto Marchetti-Spaccamela and
Sebastian Stiller A Constant-Approximate Feasibility Test
for Multiprocessor Real-Time Scheduling 1034--1049
Imran A. Pirwani and
Mohammad R. Salavatipour A Weakly Robust PTAS for Minimum Clique
Partition in Unit Disk Graphs . . . . . 1050--1072
L. Roditty Fully Dynamic Geometric Spanners . . . . 1073--1087
Ho-Leung Chan and
Tak-Wah Lam and
Lap-Kei Lee and
Hing-Fung Ting Continuous Monitoring of Distributed
Data Streams over a Time-Based Sliding
Window . . . . . . . . . . . . . . . . . 1088--1111
Micah Adler and
Brent Heeringa Approximating Optimal Binary Decision
Trees . . . . . . . . . . . . . . . . . 1112--1121
Seok-Hee Hong and
Hiroshi Nagamochi A Linear-Time Algorithm for Star-Shaped
Drawings of Planar Graphs with the
Minimum Number of Concave Corners . . . 1122--1158
Olivier Bernardi and
Éric Fusy Schnyder Decompositions for Regular
Plane Graphs and Application to Drawing 1159--1197
Greg N. Frederickson and
Barry Wittman Approximation Algorithms for the
Traveling Repairman and Speeding
Deliveryman Problems . . . . . . . . . . 1198--1221
Pankaj K. Agarwal and
Esther Ezra and
Micha Sharir Near-Linear Approximation Algorithms for
Geometric Hitting Sets . . . . . . . . . 1--25
Adrian Kosowski and
Alfredo Navarra Graph Decomposition for Memoryless
Periodic Exploration . . . . . . . . . . 26--38
Raphael Yuster Almost Exact Matchings . . . . . . . . . 39--50
Elliot Anshelevich and
Martin Hoefer Contribution Games in Networks . . . . . 51--90
Frédéric Magniez and
Ashwin Nayak and
Peter C. Richter and
Miklos Santha On the Hitting Times of Quantum Versus
Random Walks . . . . . . . . . . . . . . 91--116
Scott M. Summers Reducing Tile Complexity for the
Self-assembly of Scaled Shapes Through
Temperature Programming . . . . . . . . 117--136
Gruia Calinescu and
Cristina G. Fernandes and
Hemanshu Kaul and
Alexander Zelikovsky Maximum Series-Parallel Subgraph . . . . 137--157
David Coudert and
Florian Huc and
Dorian Mazauric A Distributed Algorithm for Computing
the Node Search Number in Trees . . . . 158--190
Donglei Du and
Ruixing Lu and
Dachuan Xu A Primal--Dual Approximation Algorithm
for the Facility Location Problem with
Submodular Penalties . . . . . . . . . . 191--200
Craig Dillabaugh and
Meng He and
Anil Maheshwari Succinct and I/O Efficient Data
Structures for Traversal in Trees . . . 201--223
Telikepalli Kavitha Faster Algorithms for All-Pairs Small
Stretch Distances in Weighted Graphs . . 224--245
Leah Epstein and
Asaf Levin On Equilibria for ADM Minimization Games 246--273
Gianlorenzo D'Angelo and
Gabriele Di Stefano and
Alfredo Navarra Minimize the Maximum Duty in
Multi-interface Networks . . . . . . . . 274--295
Gokarna Sharma and
Costas Busch A Competitive Analysis for Balanced
Transactional Memory Workloads . . . . . 296--322
Daniel Binkele-Raible and
Henning Fernau An Exact Exponential Time Algorithm for
Power Dominating Set . . . . . . . . . . 323--346
Samir Khuller and
Yoo-Ah Kim and
Azarakhsh Malekian Improved Approximation Algorithms for
Data Migration . . . . . . . . . . . . . 347--362
Joachim von zur Gathen and
Daniel Panario and
Bruce Richmond Interval Partitions and Polynomial
Factorization . . . . . . . . . . . . . 363--397
Zeev Nutov Approximating Node-Connectivity
Augmentation Problems . . . . . . . . . 398--410
Alex Kesselman and
Kirill Kogan and
Michael Segal Improved Competitive Performance Bounds
for CIOQ Switches . . . . . . . . . . . 411--424
A. Aazami and
J. Cheriyan and
K. R. Jampani Approximation Algorithms and Hardness
Results for Packing Element-Disjoint
Steiner Trees in Planar Graphs . . . . . 425--456
Lars Arge and
Gerth Stòlting Brodal and
S. Srinivasa Rao External Memory Planar Point Location
with Logarithmic Updates . . . . . . . . 457--475
Prosenjit Bose and
Karim Dou\"\ieb and
Vida Dujmovi\'c and
John Howat Layered Working-Set Trees . . . . . . . 476--489
Sebastian Eggert and
Lasse Kliemann and
Peter Munstermann and
Anand Srivastav Bipartite Matching in the Semi-streaming
Model . . . . . . . . . . . . . . . . . 490--508
Frédérique Bassino and
Julien David and
Cyril Nicaud Average Case Analysis of Moore's State
Minimization Algorithm . . . . . . . . . 509--531
Stefan Kratsch Polynomial Kernelizations for MIN $ F^+
\Pi 1 $ and MAX NP . . . . . . . . . . . 532--550
N. Catusse and
V. Chepoi and
K. Nouioua and
Y. Vax\`es Minimum Manhattan Network Problem in
Normed Planes with Polygonal Balls: a
Factor $ 2.5 $ Approximation Algorithm 551--567
Alejandro López-Ortiz Guest Editorial: Special Issue on Latin
American Theoretical Informatics
Symposium (LATIN) . . . . . . . . . . . 569--570
Viliam Geffert and
Giovanni Pighizzini Pairs of Complementary Unary Languages
with ``Balanced'' Nondeterministic
Automata . . . . . . . . . . . . . . . . 571--587
Qi Ge and
Daniel Stefankovic The Complexity of Counting Eulerian
Tours in $4$-regular Graphs . . . . . . 588--601
Adrian Dumitrescu and
Minghui Jiang Minimum-Perimeter Intersecting Polygons 602--615
Mark van Hoeij and
Andrew Novocin Gradual Sub-lattice Reduction and a New
Complexity for Factoring Polynomials . . 616--633
Christine Chung and
Katrina Ligett and
Kirk Pruhs and
Aaron Roth The Power of Fair Pricing Mechanisms . . 634--644
Paul Bonsma and
Felix Breuer Counting Hexagonal Patches and
Independent Sets in Circle Graphs . . . 645--671
C. A. Duncan and
E. R. Gansner and
Y. F. Hu and
M. Kaufmann and
S. G. Kobourov Optimal Polygonal Representation of
Planar Graphs . . . . . . . . . . . . . 672--691
Fedor V. Fomin and
Fabrizio Grandoni and
Daniel Lokshtanov and
Saket Saurabh Sharp Separation and Applications to
Exact and Parameterized Algorithms . . . 692--706
Paolo Ferragina and
Travis Gagie and
Giovanni Manzini Lightweight Data Indexing and
Compression in External Memory . . . . . 707--730
Mark de Berg Guest Editorial . . . . . . . . . . . . 731--732
Nikhil Bansal and
Anupam Gupta and
Jian Li and
Julián Mestre and
Viswanath Nagarajan and
others When LP Is the Cure for Your Matching
Woes: Improved Bounds for Stochastic
Matchings . . . . . . . . . . . . . . . 733--762
Vincenzo Bonifaci and
Alberto Marchetti-Spaccamela Feasibility Analysis of Sporadic
Real-Time Multiprocessor Task Systems 763--780
Marek Chrobak and
Gerhard J. Woeginger and
Kazuhisa Makino and
Haifeng Xu Caching Is Hard --- Even in the Fault
Model . . . . . . . . . . . . . . . . . 781--794
M. Hajiaghayi and
R. Khandekar and
G. Kortsarz Local Search Algorithms for the
Red--Blue Median Problem . . . . . . . . 795--814
Gerth Stòlting Brodal and
Pooya Davoodi and
S. Srinivasa Rao On Space Efficient Two Dimensional Range
Minimum Data Structures . . . . . . . . 815--830
Emmanouil Pountourakis and
Angelina Vidali A Complete Characterization of
Group-Strategy-proof Mechanisms of
Cost-Sharing . . . . . . . . . . . . . . 831--860
Shiri Chechik and
Michael Langberg and
David Peleg and
Liam Roditty $f$-Sensitivity Distance Oracles and
Routing Schemes . . . . . . . . . . . . 861--882
Venkatesh Raman and
Saket Saurabh Guest Editorial: Special Issue on
Parameterized and Exact Computation,
Part I . . . . . . . . . . . . . . . . . 1--2
Michael R. Fellows and
Danny Hermelin and
Frances A. Rosamond Well Quasi Orders in Subclasses of
Bounded Treewidth Graphs and Their
Algorithmic Applications . . . . . . . . 3--18
Michael Lampis Algorithmic Meta-theorems for
Restrictions of Treewidth . . . . . . . 19--37
Antonis Achilleos and
Michael Lampis and
Valia Mitsou Parameterized Modal Satisfiability . . . 38--55
Robert Crowston and
Gregory Gutin and
Mark Jones and
Anders Yeo A New Lower Bound on the Maximum Number
of Satisfied Clauses in Max-SAT and Its
Algorithmic Applications . . . . . . . . 56--68
Isolde Adler and
Frederic Dorn and
Fedor V. Fomin and
Ignasi Sau and
Dimitrios M. Thilikos Fast Minor Testing in Planar Graphs . . 69--84
Hans L. Bodlaender and
Fedor V. Fomin and
Petr A. Golovach and
Yota Otachi and
Erik Jan van Leeuwen Parameterized Complexity of the Spanning
Tree Congestion Problem . . . . . . . . 85--111
Gregory Gutin and
Eun Jung Kim and
Arezou Soleimanfallah and
Stefan Szeider and
Anders Yeo Parameterized Complexity Results for
General Factors in Bipartite Graphs with
an Application to Constraint Programming 112--125
Britta Dorn and
Ildikó Schlotter Multivariate Complexity Analysis of Swap
Bribery . . . . . . . . . . . . . . . . 126--151
Yixin Cao and
Jianer Chen Cluster Editing: Kernelization Based on
Edge Cuts . . . . . . . . . . . . . . . 152--169
Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk An Improved FPT Algorithm and a
Quadratic Kernel for Pathwidth One
Vertex Deletion . . . . . . . . . . . . 170--188
Daniel Binkele-Raible and
Henning Fernau Parameterized Measure & Conquer for
Problems with No Small Kernels . . . . . 189--212
My T. Thai Guest Editorial: Computing and
Combinatorics . . . . . . . . . . . . . 213--214
Alexander E. Holroyd and
Frank Ruskey and
Aaron Williams Shorthand Universal Cycles for
Permutations . . . . . . . . . . . . . . 215--245
Sherman S. M. Chow and
Changshe Ma and
Jian Weng Zero-Knowledge Argument for Simultaneous
Discrete Logarithms . . . . . . . . . . 246--266
Marek Chrobak and
Christoph Dürr and
Flavio Guíñez and
Antoni Lozano and
Nguyen Kim Thang Tile-Packing Tomography Is $ \mathbb
{NP} $-hard . . . . . . . . . . . . . . 267--278
Andreas Krebs and
Nutan Limaye and
Meena Mahajan Counting Paths in VPA Is Complete for
#NC$^1$ . . . . . . . . . . . . . . . . 279--294
Piotr Berman and
Marek Karpinski and
Andrzej Lingas Exact and Approximation Algorithms for
Geometric and Capacitated Set Cover
Problems . . . . . . . . . . . . . . . . 295--310
Doron Nussbaum and
Shuye Pu and
Jörg-Rüdiger Sack and
Takeaki Uno and
Hamid Zarrabi-Zadeh Finding Maximum Edge Bicliques in Convex
Bipartite Graphs . . . . . . . . . . . . 311--325
Kyung-Yong Chwa and
Kunsoo Park Guest Editorial: Special Issue on
Algorithms and Computation . . . . . . . 327--328
Henning Meyerhenke and
Thomas Sauerwald Beyond Good Partition Shapes: An
Analysis of Diffusive Graph Partitioning 329--361
Maxim A. Babenko Improved Algorithms for Even Factors and
Square-Free Simple $b$-Matchings . . . . 362--383
Juraj Stacho $3$-Colouring AT-Free Graphs in
Polynomial Time . . . . . . . . . . . . 384--399
Takehiro Ito and
Takuya Hara and
Xiao Zhou and
Takao Nishizeki Minimum Cost Partitions of Trees with
Supply and Demand . . . . . . . . . . . 400--415
Qian-Ping Gu and
Hisao Tamaki Improved Bounds on the Planar
Branchwidth with Respect to the Largest
Grid Minor Size . . . . . . . . . . . . 416--453
Mark Giesbrecht and
Daniel S. Roche and
Hrushikesh Tilak Computing Sparse Multiples of
Polynomials . . . . . . . . . . . . . . 454--480
Matthew J. Patitz and
Scott M. Summers Identifying Shapes Using Self-assembly 481--510
Jin-Yi Cai and
Sangxia Huang and
Pinyan Lu From Holant to #CSP and Back: Dichotomy
for Holant$^c$ Problems . . . . . . . . 511--533
Johan M. M. van Rooij and
Hans L. Bodlaender Exact Algorithms for Edge Domination . . 535--563
Petra Sparl and
Rafal Witkowski and
Janez Zerovnik $1$-Local $ 7 / 5 $-Competitive
Algorithm for Multicoloring Hexagonal
Graphs . . . . . . . . . . . . . . . . . 564--583
Carlos Fisch Brito and
Elias Koutsoupias and
Shailesh Vaya Competitive Analysis of Organization
Networks or Multicast Acknowledgment:
How Much to Wait? . . . . . . . . . . . 584--605
Ivona Bezáková and
Alistair Sinclair and
Daniel Stefankovic and
Eric Vigoda Negative Examples for Sequential
Importance Sampling of Binary
Contingency Tables . . . . . . . . . . . 606--620
Anne Auger and
Carsten Witt Theory of Randomized Search Heuristics 621--622
Per Kristian Lehre and
Carsten Witt Black-Box Search by Unbiased Variation 623--642
Dirk Sudholt and
Christian Thyssen A Simple Ant Colony Optimizer for
Stochastic Shortest Path Problems . . . 643--672
Benjamin Doerr and
Daniel Johannsen and
Carola Winzen Multiplicative Drift Analysis . . . . . 673--697
Youhei Akimoto and
Yuichi Nagata and
Isao Ono and
Shigenobu Kobayashi Theoretical Foundation for CMA--ES from
Information Geometry Perspective . . . . 698--716
Chaoyi Pang and
Qing Zhang and
Xiaofang Zhou and
David Hansen and
Sen Wang and
Anthony Maeder Computing Unrestricted Synopses Under
Maximum Error Bound . . . . . . . . . . 1--42
Jérémie Chalopin and
Shantanu Das and
Yann Disser and
Matús Mihalák and
Peter Widmayer Mapping Simple Polygons: How Robots
Benefit from Looking Back . . . . . . . 43--59
Marcin Bienkowski and
Marek Chrobak and
Christoph Dürr and
Mathilde Hurand and
Artur Je\.z and
\Lukasz Je\.z and
Grzegorz Stachowiak Collecting Weighted Items from a Dynamic
Queue . . . . . . . . . . . . . . . . . 60--94
Daniel Binkele-Raible and
Henning Fernau and
Serge Gaspers and
Mathieu Liedloff Exact and Parameterized Algorithms for
Max Internal Spanning Tree . . . . . . . 95--128
Hajo Broersma and
Fedor V. Fomin and
Pim van 't Hof and
Daniël Paulusma Exact Algorithms for Finding Longest
Cycles in Claw--Free Graphs . . . . . . 129--145
D. Peleg and
L. Roditty Relaxed Spanners for Directed Disk
Graphs . . . . . . . . . . . . . . . . . 146--158
Ali Çivril and
Malik Magdon-Ismail Exponential Inapproximability of
Selecting a Maximum Volume Sub-matrix 159--176
Kyriaki Ioannidou and
Stavros D. Nikolopoulos The Longest Path Problem Is Polynomial
on Cocomparability Graphs . . . . . . . 177--205
Ke Yi and
Qin Zhang Optimal Tracking of Distributed Heavy
Hitters and Quantiles . . . . . . . . . 206--223
Benjamin Doerr and
Leslie Ann Goldberg Adaptive Drift Analysis . . . . . . . . 224--250
János Csirik and
Leah Epstein and
Csanád Imreh and
Asaf Levin Online Clustering with Variable Sized
Clusters . . . . . . . . . . . . . . . . 251--274
Dániel Marx and
Ildikó Schlotter Cleaning Interval Graphs . . . . . . . . 275--316
Takehiro Ito and
Yuichiro Miyamoto and
Hirotaka Ono and
Hisao Tamaki and
Ryuhei Uehara Route-Enabling Graph Orientation
Problems . . . . . . . . . . . . . . . . 317--338
Danny Hermelin and
Gad M. Landau and
Shir Landau and
Oren Weimann Unified Compression--Based Acceleration
of Edit--Distance Computation . . . . . 339--353
Kuan-Yu Chen and
Kun-Mao Chao A Fully Compressed Algorithm for
Computing the Edit Distance of
Run--Length Encoded Strings . . . . . . 354--370
Moshe Hershcovitch and
Haim Kaplan I/O Efficient Dynamic Data Structures
for Longest Prefix Queries . . . . . . . 371--390
Rohit Khandekar and
Guy Kortsarz and
Vahab Mirrokni and
Mohammad R. Salavatipour Two-stage Robust Network Design with
Exponential Scenarios . . . . . . . . . 391--408
Graham Cormode and
Michael Mitzenmacher and
Justin Thaler Streaming Graph Computations with a
Helpful Advisor . . . . . . . . . . . . 409--442
Chung-Shou Liao and
D. T. Lee Power Domination in Circular--Arc Graphs 443--466
Bang Ye Wu A Simpler and More Efficient Algorithm
for the Next-to-Shortest Path Problem 467--479
A. García and
P. Jodrá and
J. Tejel Computing a Hamiltonian Path of Minimum
Euclidean Length Inside a Simple Polygon 481--497
Ning Chen and
Roee Engelberg and
C. Thach Nguyen and
Prasad Raghavendra and
Atri Rudra and
Gyanit Singh Improved Approximation Algorithms for
the Spanning Star Forest Problem . . . . 498--516
Neeldhara Misra and
Hannes Moser and
Venkatesh Raman and
Saket Saurabh and
Somnath Sikdar The Parameterized Complexity of Unique
Coverage and Its Variants . . . . . . . 517--544
MohammadHossein Bateni and
Julia Chuzhoy Approximation Algorithms for the
Directed $k$-Tour and $k$-Stroll
Problems . . . . . . . . . . . . . . . . 545--561
Paola Flocchini and
David Ilcinkas and
Andrzej Pelc and
Nicola Santoro Computing Without Communicating: Ring
Exploration by Asynchronous Oblivious
Robots . . . . . . . . . . . . . . . . . 562--583
Fedor V. Fomin and
Fabrizio Grandoni and
Dieter Kratsch and
Daniel Lokshtanov and
Saket Saurabh Computing Optimal Steiner Trees in
Polynomial Space . . . . . . . . . . . . 584--604
Tak-Wah Lam and
Lap-Kei Lee and
Isaac K. K. To and
Prudence W. H. Wong Online Speed Scaling Based on Active Job
Count to Minimize Flow Plus Energy . . . 605--633
Bhaskar DasGupta and
S. Muthukrishnan Stochastic Budget Optimization in
Internet Advertising . . . . . . . . . . 634--661
Shoshana Neuburger and
Dina Sokol Succinct $2$D Dictionary Matching . . . 662--684
Sofya Raskhodnikova and
Dana Ron and
Ronitt Rubinfeld and
Adam Smith Sublinear Algorithms for Approximating
String Compressibility . . . . . . . . . 685--709
Venkatesh Raman and
Saket Saurabh Guest Editorial: Special Issue on
Parameterized and Exact Computation,
Part II . . . . . . . . . . . . . . . . 711--712
M. Praveen Small Vertex Cover makes Petri Net
Coverability and Boundedness Easier . . 713--753
Stefan Kratsch and
Frank Neumann Fixed-Parameter Evolutionary Algorithms
and the Vertex Cover Problem . . . . . . 754--771
Benjamin A. Burton and
Melih Ozlen A Tree Traversal Algorithm for Decision
Problems in Knot Theory and $3$-Manifold
Topology . . . . . . . . . . . . . . . . 772--801
Danny Hermelin and
Chien-Chung Huang and
Stefan Kratsch and
Magnus Wahlström Parameterized Two--Player Nash
Equilibrium . . . . . . . . . . . . . . 802--816
Chris Calabro and
Russell Impagliazzo and
Ramamohan Paturi On the Exact Complexity of Evaluating
Quantified $k$-CNF . . . . . . . . . . . 817--827
Sylvain Guillemot and
Florian Sikora Finding and Counting Vertex--Colored
Subtrees . . . . . . . . . . . . . . . . 828--844
Pim van 't Hof and
Yngve Villanger Proper Interval Vertex Deletion . . . . 845--867
Jesper Nederlof Fast Polynomial--Space Algorithms Using
Inclusion--Exclusion . . . . . . . . . . 868--884
Frédéric Havet and
Leonardo Sampaio On the Grundy and $b$-Chromatic Numbers
of a Graph . . . . . . . . . . . . . . . 885--899
Sylvain Guillemot and
Frédéric Havet and
Christophe Paul and
Anthony Perez On the (Non-)Existence of Polynomial
Kernels for $ P_l $-Free Edge
Modification Problems . . . . . . . . . 900--926
Harish Chandran and
Nikhil Gopalkrishnan and
John Reif Tile Complexity of Approximate Squares 1--17
Surender Baswana and
Neelesh Khanna Approximate Shortest Paths Avoiding a
Failed Vertex: Near Optimal Data
Structures for Undirected Unweighted
Graphs . . . . . . . . . . . . . . . . . 18--50
Serafino Cicerone and
Gianlorenzo D'Angelo and
Gabriele Di Stefano and
Daniele Frigioni and
Vinicio Maurizio Engineering a New Algorithm for
Distributed Shortest Paths on Dynamic
Networks . . . . . . . . . . . . . . . . 51--86
Raphael Yuster Maximum Matching in Regular and Almost
Regular Graphs . . . . . . . . . . . . . 87--92
Quentin F. Stout Isotonic Regression via Partitioning . . 93--112
Christos Koufogiannakis and
Neal E. Young Greedy $ \Delta $-Approximation
Algorithm for Covering with Arbitrary
Constraints and Submodular Cost . . . . 113--152
David Doty and
Lila Kari and
Beno\^\it Masson Negative Interactions in Irreversible
Self-assembly . . . . . . . . . . . . . 153--172
Lijun Chang and
Jeffrey Xu Yu and
Lu Qin Fast Maximal Cliques Enumeration in
Sparse Graphs . . . . . . . . . . . . . 173--186
Chien-Chung Huang and
Zoya Svitkina Donation Center Location Problem . . . . 187--210
Elias Koutsoupias and
Angelina Vidali A Lower Bound of $ 1 + \phi $ for
Truthful Scheduling Mechanisms . . . . . 211--223
Adrian Dumitrescu and
Minghui Jiang On the Largest Empty Axis--Parallel Box
Amidst $n$ Points . . . . . . . . . . . 225--248
Alexis Kaporis and
Christos Makris and
Spyros Sioutas and
Athanasios Tsakalidis and
Kostas Tsichlas and
Christos Zaroliagis Improved Bounds for Finger Search on a
RAM . . . . . . . . . . . . . . . . . . 249--286
Martin R. Ehmsen and
Jens S. Kohrt and
Kim S. Larsen List Factoring and Relative Worst Order
Analysis . . . . . . . . . . . . . . . . 287--309
Vladimir Pestov Lower Bounds on Performance of Metric
Tree Indexing Schemes for Exact
Similarity Search in High Dimensions . . 310--328
Jesper Jansson and
Wing-Kin Sung Constructing the $ R* $ Consensus Tree
of Two Trees in Subcubic Time . . . . . 329--345
Satoru Iwata and
Mizuyo Takamatsu Computing the Maximum Degree of Minors
in Mixed Polynomial Matrices via
Combinatorial Relaxation . . . . . . . . 346--368
Ching-Chi Lin and
Gen-Huey Chen and
Gerard J. Chang A Linear-Time Algorithm for Finding
Locally Connected Spanning Trees on
Circular-Arc Graphs . . . . . . . . . . 369--396
Markus Bläser and
Bodo Manthey and
B. V. Raghavendra Rao Smoothed Analysis of Partitioning
Algorithms for Euclidean Functionals . . 397--418
Radu Mihaescu and
Cameron Hill and
Satish Rao Fast Phylogeny Reconstruction Through
Learning of Ancestral Sequences . . . . 419--449
Uriel Feige and
Nicole Immorlica and
Vahab S. Mirrokni and
Hamid Nazerzadeh PASS Approximation: A Framework for
Analyzing and Designing Heuristics . . . 450--478
Feodor F. Dragan and
Yang Xiang How to Use Spanning Trees to Navigate in
Graphs . . . . . . . . . . . . . . . . . 479--511
Ioannis Caragiannis Efficient Coordination Mechanisms for
Unrelated Machine Scheduling . . . . . . 512--540
Minghui Jiang Recognizing $d$-Interval Graphs and
$d$-Track Interval Graphs . . . . . . . 541--563
Erik A. Krohn and
Bengt J. Nilsson Approximate Guarding of Monotone and
Rectilinear Polygons . . . . . . . . . . 564--594
Kevin Buchin and
Maike Buchin and
Marc van Kreveld and
Maarten Löffler and
Rodrigo I. Silveira and
Carola Wenk and
Lionov Wiratma Median Trajectories . . . . . . . . . . 595--614
Avivit Lazar and
Arie Tamir Improved Algorithms for Some Competitive
Location Centroid Problems on Paths,
Trees and Graphs . . . . . . . . . . . . 615--640
Longkun Guo and
Hong Shen On Finding Min--Min Disjoint Paths . . . 641--653
Toru Hasunuma and
Toshimasa Ishii and
Hirotaka Ono and
Yushi Uno A Linear Time Algorithm for $ L(2, 1)
$-Labeling of Trees . . . . . . . . . . 654--681
Danny Z. Chen and
Haitao Wang Approximating Points by a Piecewise
Linear Function . . . . . . . . . . . . 682--713
K. T. Huber and
V. Moulton Encoding and Constructing $1$-Nested
Phylogenetic Networks with Trinets . . . 714--738
Hsien-Kuei Hwang and
Conrado Martínez and
Robert Sedgewick Guest Editorial . . . . . . . . . . . . 739--740
Michael Drmota and
Konstantinos Panagiotou A Central Limit Theorem for the Number
of Degree-$k$ Vertices in Random Maps 741--761
Ahmed Helmi and
Alois Panholzer Analysis of the ``Hiring Above the
Median'' Selection Strategy for the
Hiring Problem . . . . . . . . . . . . . 762--803
Hanjo Täubig and
Jeremias Weihmann and
Sven Kosub and
Raymond Hemmecke and
Ernst W. Mayr Inequalities for the Number of Walks in
Graphs . . . . . . . . . . . . . . . . . 804--828
Stephan Wagner Asymptotic Enumeration of Extensional
Acyclic Digraphs . . . . . . . . . . . . 829--847
Osamu Watanabe Message Passing Algorithms for MLS-3LIN
Problem . . . . . . . . . . . . . . . . 848--868
Takao Asano and
Shin-ichi Nakano and
Yoshio Okamoto Guest Editorial: Selected Papers from
ISAAC 2011 . . . . . . . . . . . . . . . 1--2
M. Jawaherul Alam and
Therese Biedl and
Stefan Felsner and
Andreas Gerasch and
Michael Kaufmann and
Stephen G. Kobourov Linear-Time Algorithms for Hole-free
Rectilinear Proportional Contact Graph
Representations . . . . . . . . . . . . 3--22
Elaine Angelino and
Michael T. Goodrich and
Michael Mitzenmacher and
Justin Thaler External-Memory Multimaps . . . . . . . 23--48
Adrian Bock and
Elyot Grant and
Jochen Könemann and
Laura Sanit\`a The School Bus Problem on Trees . . . . 49--64
Tobias Friedrich and
Thomas Sauerwald and
Alexandre Stauffer Diameter and Broadcast Time of Random
Geometric Graphs in Arbitrary Dimensions 65--88
Jiong Guo and
Sepp Hartung and
Rolf Niedermeier and
Ondrej Suchý The Parameterized Complexity of Local
Search for TSP, More Refined . . . . . . 89--110
Anonymous Editorial Note . . . . . . . . . . . . . 111--111
Kazuhisa Makino and
Suguru Tamaki and
Masaki Yamamoto Derandomizing the HSSW Algorithm for
3-SAT . . . . . . . . . . . . . . . . . 112--124
Huy Hoang Do and
Wing Kin Sung Compressed Directed Acyclic Word Graph
with Application in Local Alignment . . 125--141
Malte Brinkmeyer and
Thasso Griebel and
Sebastian Böcker FlipCut Supertrees: Towards Matrix
Representation Accuracy in Polynomial
Time . . . . . . . . . . . . . . . . . . 142--160
Kei Uchizawa and
Takanori Aoki and
Takehiro Ito and
Akira Suzuki and
Xiao Zhou On the Rainbow Connectivity of Graphs:
Complexity and FPT Algorithms . . . . . 161--179
Narayan Vikas Algorithms for Partition of Some Class
of Graphs under Compaction and
Vertex--Compaction . . . . . . . . . . . 180--206
Steven M. Kautz and
Brad Shutters Self-Assembling Rulers for Approximating
Generalized Sierpinski Carpets . . . . . 207--233
Lauri Ahlroth and
Olli Pottonen and
André Schumacher Approximately Uniform Online
Checkpointing with Bounded Memory . . . 234--246
V. Arvind and
Johannes Köbler The Parallel Complexity of Graph
Canonization Under Abelian Group Action 247--276
Yusuke Matsumoto and
Naoyuki Kamiyama and
Keiko Imai On Total Unimodularity of Edge--Edge
Adjacency Matrices . . . . . . . . . . . 277--292
Ferdinando Cicalese and
Ely Porat Guest Editorial for ``Group Testing:
models and applications'' . . . . . . . 293--294
Antonio Fernández Anta and
Miguel A. Mosteiro and
Jorge Ramón Muñoz Unbounded Contention Resolution in
Multiple-Access Channels . . . . . . . . 295--314
Gábor Wiener Rounds in Combinatorial Search . . . . . 315--323
Peter Damaschke and
Azam Sheikh Muhammad and
Eberhard Triesch Two New Perspectives on Multi-Stage
Group Testing . . . . . . . . . . . . . 324--354
Michael Huber Efficient Two-Stage Group Testing
Algorithms for Genetic Screening . . . . 355--367
Yaw-Ling Lin and
Charles Ward and
Steven Skiena Synthetic Sequence Design for Signal
Location Search . . . . . . . . . . . . 368--383
Mahdi Cheraghchi Improved Constructions for Non-adaptive
Threshold Group Testing . . . . . . . . 384--417
Hung Q. Ngo and
Duong Hieu Phan and
David Pointcheval Black-Box Trace&Revoke Codes . . . . . . 418--448
Camil Demetrescu and
Magnus M. Halldorsson Editorial . . . . . . . . . . . . . . . 449--450
Nikhil Bansal and
Joel Spencer Deterministic Discrepancy Minimization 451--471
Shayan Oveis Gharan and
Jan Vondrák On Variants of the Matroid Secretary
Problem . . . . . . . . . . . . . . . . 472--497
Lukasz Jez A Universal Randomized Packet Scheduling
Algorithm . . . . . . . . . . . . . . . 498--515
Ely Porat and
Liam Roditty Preprocess, Set, Query! . . . . . . . . 516--528
Paolo Ferragina and
Jouni Sirén and
Rossano Venturini Distribution-Aware Compressed Full-Text
Indexes . . . . . . . . . . . . . . . . 529--546
Oren Salzman and
Michael Hemmer and
Barak Raveh and
Dan Halperin Motion Planning via Manifold Samples . . 547--565
Francis Chin and
Marek Chrobak and
Li Yan Algorithms for Placing Monitors in a
Flow Network . . . . . . . . . . . . . . 1--15
Arash Farzan and
J. Ian Munro A Uniform Paradigm to Succinctly Encode
Various Families of Trees . . . . . . . 16--40
Marek Cygan and
Dániel Marx and
Marcin Pilipczuk and
Michal Pilipczuk and
Ildikó Schlotter Parameterized Complexity of Eulerian
Deletion Problems . . . . . . . . . . . 41--61
Tomás Ebenlendr and
Marek Krcál and
Jirí Sgall Graph Balancing: A Special Case of
Scheduling Unrelated Parallel Machines 62--80
Christian Komusiewicz and
Johannes Uhlmann A Cubic-Vertex Kernel for Flip Consensus
Tree . . . . . . . . . . . . . . . . . . 81--108
Pinar Heggernes and
Pim van 't Hof and
Benjamin Lévêque and
Daniel Lokshtanov and
Christophe Paul Contracting Graphs to Paths and Trees 109--132
Sixia Chen and
Alexander Russell Online Metric Tracking and Smoothing . . 133--151
Daniel Johannsen and
Piyush P. Kurur and
Johannes Lengler Evolutionary Algorithms for Quantum
Computers . . . . . . . . . . . . . . . 152--189
Matthias Englert and
Heiko Röglin and
Berthold Vöcking Worst Case and Probabilistic Analysis of
the $2$-Opt Algorithm for the TSP . . . 190--264
Andreas Bärtschi and
Subhash Suri Conflict-Free Chromatic Art Gallery
Coverage . . . . . . . . . . . . . . . . 265--283
Andreas Bärtschi and
Subhash Suri Erratum to: Conflict-Free Chromatic Art
Gallery Coverage . . . . . . . . . . . . 284--285
Glencora Borradaile and
Erik D. Demaine and
Siamak Tazari Polynomial-Time Approximation Schemes
for Subset--Connectivity Problems in
Bounded--Genus Graphs . . . . . . . . . 287--311
Frank Kammer and
Torsten Tholey Approximation Algorithms for
Intersection Graphs . . . . . . . . . . 312--336
Davide Bil\`o and
Luciano Gual\`a and
Guido Proietti Finding Best Swap Edges Minimizing the
Routing Cost of a Spanning Tree . . . . 337--357
George Karakostas and
Euripides Markou Emergency Connectivity in Ad-hoc
Networks with Selfish Nodes . . . . . . 358--389
Nikhil Bansal and
Niv Buchbinder and
Anupam Gupta and
Joseph (Seffi) Naor A Randomized $ O(\log^2 k) $-Competitive
Algorithm for Metric Bipartite Matching 390--403
Susanne Albers and
Fabian Müller and
Swen Schmelzer Speed Scaling on Parallel Processors . . 404--425
Marcin Bienkowski An Optimal Lower Bound for Buffer
Management in Multi-Queue Switches . . . 426--447
Mashhood Ishaque and
Csaba D. Tóth Relative Convex Hulls in Semi-Dynamic
Arrangements . . . . . . . . . . . . . . 448--482
Andrew R. A. McGrae and
Michele Zito The Complexity of the Empire Colouring
Problem . . . . . . . . . . . . . . . . 483--503
Neeldhara Misra and
Geevarghese Philip and
Venkatesh Raman and
Saket Saurabh The Kernelization Complexity of
Connected Domination in Graphs with (no)
Small Cycles . . . . . . . . . . . . . . 504--530
Xin He and
Huaming Zhang On Succinct Greedy Drawings of Plane
Triangulations and $3$-Connected Plane
Graphs . . . . . . . . . . . . . . . . . 531--544
Eric McDermid and
Robert W. Irving Sex-Equal Stable Matchings: Complexity
and Exact Algorithms . . . . . . . . . . 545--570
Benjamin Doerr and
Carola Winzen Ranking-Based Black-Box Complexity . . . 571--609
Erik D. Demaine and
Gad M. Landau and
Oren Weimann On Cartesian Trees and Range Minimum
Queries . . . . . . . . . . . . . . . . 610--625
Martin Fürer Efficient Computation of the
Characteristic Polynomial of a Tree and
Related Tasks . . . . . . . . . . . . . 626--642
Joachim Gehweiler and
Christiane Lammersen and
Christian Sohler A Distributed $ O(1) $-Approximation
Algorithm for the Uniform Facility
Location Problem . . . . . . . . . . . . 643--670
Michele Flammini and
Gianpiero Monaco and
Luca Moscardelli and
Mordechai Shalom and
Shmuel Zaks On the Complexity of the Regenerator
Cost Problem in General Networks with
Traffic Grooming . . . . . . . . . . . . 671--691
Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk Scheduling Partially Ordered Jobs Faster
than $ 2^{{n}} $ . . . . . . . . . . . . 692--714
Nadja Betzler and
Hans L. Bodlaender and
Robert Bredereck and
Rolf Niedermeier and
Johannes Uhlmann On Making a Distinguished Vertex of
Minimum Degree by Vertex Deletion . . . 715--738
Robert Crowston and
Gregory Gutin and
Mark Jones and
Venkatesh Raman and
Saket Saurabh and
Anders Yeo Fixed-Parameter Tractability of
Satisfying Beyond the Number of
Variables . . . . . . . . . . . . . . . 739--757
Kazuo Iwama and
Shuichi Miyazaki and
Hiroki Yanagisawa A $ 25 / 17 $-Approximation Algorithm
for the Stable Marriage Problem with
One-Sided Ties . . . . . . . . . . . . . 758--775
Jochen Könemann and
Ojas Parekh and
David Pritchard Multicommodity Flow in Trees: Packing
via Covering and Iterated Relaxation . . 776--804
Jinhui Xu and
Lei Xu and
Evanthia Papadopoulou Computing the Map of Geometric Minimal
Cuts . . . . . . . . . . . . . . . . . . 805--834
Michael T. Goodrich Spin-the-Bottle Sort and Annealing Sort:
Oblivious Sorting via Round-Robin Random
Comparisons . . . . . . . . . . . . . . 835--858
Thomas Bläsius and
Marcus Krug and
Ignaz Rutter and
Dorothea Wagner Orthogonal Graph Drawing with
Flexibility Constraints . . . . . . . . 859--885
Steven Kelk and
Celine Scornavacca Constructing Minimal Phylogenetic
Networks from Softwired Clusters is
Fixed Parameter Tractable . . . . . . . 886--915
David G. Harris and
Francis Sullivan and
Isabel Beichl Fast Sequential Importance Sampling to
Estimate the Graph Reliability
Polynomial . . . . . . . . . . . . . . . 916--939
Marek Cygan and
Daniel Lokshtanov and
Marcin Pilipczuk and
Michal Pilipczuk and
Saket Saurabh On Cutwidth Parameterized by Vertex
Cover . . . . . . . . . . . . . . . . . 940--953
Emilio Di Giacomo and
Walter Didimo and
Peter Eades and
Giuseppe Liotta $2$-Layer Right Angle Crossing Drawings 954--997
Andreas Brandstädt and
Raffaele Mosca Dominating Induced Matchings for $ P_7
$-Free Graphs in Linear Time . . . . . . 998--1018
Sándor P. Fekete and
Tom Kamphans and
Nils Schweer Online Square Packing with Gravity . . . 1019--1044
Ferdinando Cicalese and
Tobias Jacobs and
Eduardo Laber and
Marco Molinaro Improved Approximation Algorithms for
the Average--Case Tree Searching Problem 1045--1074
Luca Foschini and
John Hershberger and
Subhash Suri On the Complexity of Time--Dependent
Shortest Paths . . . . . . . . . . . . . 1075--1097
C. Seshadhri and
Jan Vondrák Is Submodularity Testable? . . . . . . . 1--25
Leah Epstein and
Asaf Levin Robust Algorithms for Preemptive
Scheduling . . . . . . . . . . . . . . . 26--57
Atlas F. Cook IV and
Carola Wenk Shortest Path Problems on a Polyhedral
Surface . . . . . . . . . . . . . . . . 58--77
Josep Díaz and
Leslie Ann Goldberg and
George B. Mertzios and
David Richerby and
Maria Serna and
Paul G. Spirakis Approximating Fixation Probabilities in
the Generalized Moran Process . . . . . 78--91
Arash Farzan and
Shahin Kamali Compact Navigation and Distance Oracles
for Graphs with Small Treewidth . . . . 92--116
Marcel Wild Counting or Producing All Fixed
Cardinality Transversals . . . . . . . . 117--129
Toshimasa Ishii and
Kazuhisa Makino Augmenting Edge-Connectivity between
Vertex Subsets . . . . . . . . . . . . . 130--147
David M. Mount and
Nathan S. Netanyahu and
Christine D. Piatko and
Ruth Silverman and
Angela Y. Wu On the Least Trimmed Squares Estimator 148--183
Marcel R. Ackermann and
Johannes Blömer and
Daniel Kuntze and
Christian Sohler Analysis of Agglomerative Clustering . . 184--215
Fedor V. Fomin and
Pinar Heggernes and
Dieter Kratsch and
Charis Papadopoulos and
Yngve Villanger Enumerating Minimal Subset Feedback
Vertex Sets . . . . . . . . . . . . . . 216--231
Jérémy Barbay and
Francisco Claude and
Travis Gagie and
Gonzalo Navarro and
Yakov Nekrich Efficient Fully-Compressed Sequence
Representations . . . . . . . . . . . . 232--268
Zhi-Zhong Chen and
Wenji Ma and
Lusheng Wang The Parameterized Complexity of the
Shared Center Problem . . . . . . . . . 269--293
David Bremner and
Timothy M. Chan and
Erik D. Demaine and
Jeff Erickson and
Ferran Hurtado and
John Iacono and
Stefan Langerman and
Mihai P\uatrascu and
Perouz Taslakian Necklaces, Convolutions, and $ X + Y $ 294--314
Adrian Dumitrescu and
Minghui Jiang and
János Pach Opaque Sets . . . . . . . . . . . . . . 315--334
Xavier Allamigeon On the Complexity of Strongly Connected
Components in Directed Hypergraphs . . . 335--369
Danny Z. Chen and
Haitao Wang New Algorithms for Facility Location
Problems on the Real Line . . . . . . . 370--383
Philip Bille and
Inge Li Gòrtz Substring Range Reporting . . . . . . . 384--396
Prosenjit Bose and
Paz Carmi and
Mirela Damian and
Robin Flatland and
Matthew J. Katz and
Anil Maheshwari Switching to Directional Antennas with
Constant Increase in Radius and Hop
Distance . . . . . . . . . . . . . . . . 397--409
Danny Z. Chen and
Haitao Wang Outlier Respecting Points Approximation 410--430
Keren Cohen and
Raphael Yuster On Minimum Witnesses for Boolean Matrix
Multiplication . . . . . . . . . . . . . 431--442
M. Reza Khani and
Mohammad R. Salavatipour Improved Approximation Algorithms for
the Min-max Tree Cover and Bounded Tree
Cover Problems . . . . . . . . . . . . . 443--460
Stasys Jukna Limitations of Incremental Dynamic
Programming . . . . . . . . . . . . . . 461--492
Anonymous Editor's Note . . . . . . . . . . . . . 493--493
Romeo Rizzi and
David Cariolaro Polynomial Time Complexity of Edge
Colouring Graphs with Bounded Colour
Classes . . . . . . . . . . . . . . . . 494--500
Rémy Belmonte and
Petr A. Golovach and
Pinar Heggernes and
Pim van 't Hof and
Marcin Kami\'nski and
Daniël Paulusma Detecting Fixed Patterns in Chordal
Graphs in Polynomial Time . . . . . . . 501--521
Po-Shen Loh and
Rasmus Pagh Thresholds for Extreme Orientability . . 522--539
George B. Mertzios An Intersection Model for Multitolerance
Graphs: Efficient Algorithms and
Hierarchy . . . . . . . . . . . . . . . 540--581
Hiroshi Fujiwara and
Tobias Jacobs On the Huffman and Alphabetic Tree
Problem with General Cost Functions . . 582--604
T.-H. Hubert Chan and
Kevin L. Chang and
Rajiv Raman An SDP Primal-Dual Algorithm for
Approximating the Lovász--Theta Function 605--618
Giorgos Christodoulou and
Kurt Mehlhorn and
Evangelia Pyrga Improving the Price of Anarchy for
Selfish Routing via Coordination
Mechanisms . . . . . . . . . . . . . . . 619--640
Anil Maheshwari and
Jörg-Rüdiger Sack and
Kaveh Shahbaz and
Hamid Zarrabi-Zadeh Improved Algorithms for Partial Curve
Matching . . . . . . . . . . . . . . . . 641--657
Costas Busch and
Ryan LaFortune and
Srikanta Tirthapura Sparse Covers for Planar Graphs and
Graphs that Exclude a Fixed Minor . . . 658--684
Jesper Nederlof and
Johan M. M. van Rooij and
Thomas C. van Dijk Inclusion/Exclusion Meets Measure and
Conquer . . . . . . . . . . . . . . . . 685--740
Rasmus Resen Amossen and
Andrea Campagna and
Rasmus Pagh Better Size Estimation for Sparse Matrix
Products . . . . . . . . . . . . . . . . 741--757
Emeric Gioan and
Christophe Paul and
Marc Tedder and
Derek Corneil Practical and Efficient Circle Graph
Recognition . . . . . . . . . . . . . . 759--788
Emeric Gioan and
Christophe Paul and
Marc Tedder and
Derek Corneil Practical and Efficient Split
Decomposition via Graph-Labelled Trees 789--843
Rohit Khandekar and
Guy Kortsarz and
Vahab Mirrokni On the Advantage of Overlapping Clusters
for Minimizing Conductance . . . . . . . 844--863
Rasmus Pagh and
Zhewei Wei and
Ke Yi and
Qin Zhang Cache-Oblivious Hashing . . . . . . . . 864--883
Feodor F. Dragan and
Ekkehard Köhler An Approximation Algorithm for the Tree
$t$-Spanner Problem on Unweighted Graphs
via Generalized Chordal Graphs . . . . . 884--905
Alexander Golynski and
Alessio Orlandi and
Rajeev Raman and
S. Srinivasa Rao Optimal Indexes for Sparse Bit Vectors 906--924
Anne Benoit and
Matthieu Gallet and
Bruno Gaujal and
Yves Robert Computing the Throughput of
Probabilistic and Replicated Streaming
Applications . . . . . . . . . . . . . . 925--957
Leonor Frias and
Salvador Roura Multikey Quickselect . . . . . . . . . . 958--973
Joachim Gudmundsson and
Julián Mestre and
Taso Viglas Editorial: COCOON 2012 Special Issue . . 1--1
Binay Bhattacharya and
Tsunehiko Kameda and
Zhao Song A Linear Time Algorithm for Computing
Minmax Regret $1$-Median on a Tree
Network . . . . . . . . . . . . . . . . 2--21
Ragesh Jaiswal and
Amit Kumar and
Sandeep Sen A Simple $ D^2 $-Sampling Based PTAS for
$k$-Means and Other Clustering Problems 22--46
Ruiwen Chen and
Valentine Kabanets and
Jeff Kinne Lower Bounds Against Weakly-Uniform
Threshold Circuits . . . . . . . . . . . 47--75
Xin Han and
Yasushi Kawase and
Kazuhisa Makino Online Unweighted Knapsack Problem with
Removal Cost . . . . . . . . . . . . . . 76--91
Maria Paola Bianchi and
Hans-Joachim Böckenhauer and
Juraj Hromkovic and
Lucia Keller Online Coloring of Bipartite Graphs with
and without Advice . . . . . . . . . . . 92--111
Oswin Aichholzer and
Matias Korman and
Alexander Pilz and
Birgit Vogtenhuber Geodesic Order Types . . . . . . . . . . 112--128
René van Bevern Towards Optimal and Expressive
Kernelization for $d$-Hitting Set . . . 129--147
David Fernández-Baca Editorial . . . . . . . . . . . . . . . 149--151
Hee-Kap Ahn and
Sang Won Bae and
Otfried Cheong and
Joachim Gudmundsson and
Takeshi Tokuyama and
Antoine Vigneron A Generalization of the Convex Kakeya
Problem . . . . . . . . . . . . . . . . 152--170
Armando Castañeda and
Maurice Herlihy and
Sergio Rajsbaum An Equivariance Theorem with
Applications to Renaming . . . . . . . . 171--194
Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk Solving the $2$-Disjoint Connected
Subgraphs Problem Faster than $ 2^n$ . . 195--207
Daniel Dadush A Randomized Sieving Algorithm for
Approximate Integer Programming . . . . 208--244
Michel Habib and
Antoine Mamcarz and
Fabien de Montgolfier Computing $H$-Joins with Application to
$2$-Modular Decomposition . . . . . . . 245--266
Ahmed Helmi and
Conrado Martínez and
Alois Panholzer Analysis of the Strategy ``Hiring Above
the $m$-th Best Candidate'' . . . . . . 267--300
Bernard Mans and
Igor Shparlinski Random Walks, Bisections and Gossiping
in Circulant Graphs . . . . . . . . . . 301--325
Monaldo Mastrolilli The Feedback Arc Set Problem with
Triangle Inequality Is a Vertex Cover
Problem . . . . . . . . . . . . . . . . 326--339
Zeev Nutov Degree Constrained Node-Connectivity
Problems . . . . . . . . . . . . . . . . 340--364
Leah Epstein and
Paolo Ferragina Guest Editorial: Selected Papers of
European Symposium of Algorithms . . . . 365--367
Jessica Chang and
Harold N. Gabow and
Samir Khuller A Model for Minimizing Active Processor
Time . . . . . . . . . . . . . . . . . . 368--405
Jean-Daniel Boissonnat and
Clément Maria The Simplex Tree: An Efficient Data
Structure for General Simplicial
Complexes . . . . . . . . . . . . . . . 406--427
Martin Aumüller and
Martin Dietzfelbinger and
Philipp Woelfel Explicit and Efficient Hash Families
Suffice for Cuckoo Hashing with a Stash 428--456
Krishnendu Chatterjee and
Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai Polynomial-Time Algorithms for Energy
Games with Special Weight Structures . . 457--492
Tobias Harks and
Britta Peis Resource Buying Games . . . . . . . . . 493--512
Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen Parameterized Complexity of Induced
Graph Matching on Claw-Free Graphs . . . 513--560
Bundit Laekhanukit and
Adrian Vetta and
Gordon Wilfong Routing Regardless of Network Stability 561--593
Piotr Berman and
Bhaskar DasGupta and
Lakshmi Kaligounder and
Marek Karpinski On the Computational Complexity of
Measuring Global Stability of Banking
Networks . . . . . . . . . . . . . . . . 595--647
Christos Koufogiannakis and
Neal E. Young A Nearly Linear-Time PTAS for Explicit
Fractional Packing and Covering Linear
Programs . . . . . . . . . . . . . . . . 648--674
George Christodoulou and
Katrina Ligett and
Evangelia Pyrga Contention Resolution under Selfishness 675--693
Kun-Mao Chao and
Tsan-Sheng Hsu and
D. T. Lee Preface Algorithms and Computation
(ISAAC 2012) . . . . . . . . . . . . . . 694--695
Meng He and
J. Ian Munro and
Gelin Zhou A Framework for Succinct Labeled Ordinal
Trees over Large Alphabets . . . . . . . 696--717
Sepehr Assadi and
Ehsan Emamjomeh-Zadeh and
Ashkan Norouzi-Fard and
Sadra Yazdanbod and
Hamid Zarrabi-Zadeh The Minimum Vulnerability Problem . . . 718--731
Panagiotis Cheilaris and
Luisa Gargano and
Adele A. Rescigno and
Shakhar Smorodinsky Strong Conflict--Free Coloring for
Intervals . . . . . . . . . . . . . . . 732--749
Fedor V. Fomin and
Geevarghese Philip and
Yngve Villanger Minimum Fill-in of Sparse Graphs:
Kernelization and Approximation . . . . 1--20
Jean-François Couturier and
Petr A. Golovach and
Dieter Kratsch and
Daniël Paulusma List Coloring in the Absence of a Linear
Forest . . . . . . . . . . . . . . . . . 21--35
Aparna Das and
Emden R. Gansner and
Michael Kaufmann and
Stephen Kobourov and
Joachim Spoerhase and
Alexander Wolff Approximating Minimum Manhattan Networks
in Higher Dimensions . . . . . . . . . . 36--52
T.-H. Hubert Chan and
Mingfei Li and
Li Ning Sparse Fault-Tolerant Spanners for
Doubling Metrics with Bounded
Hop-Diameter or Degree . . . . . . . . . 53--65
Marcus Brazil and
Charl J. Ras and
Konrad J. Swanepoel and
Doreen A. Thomas Generalised $k$-Steiner Tree Problems in
Normed Planes . . . . . . . . . . . . . 66--86
Mingyu Xiao and
Jiong Guo A Quadratic Vertex Kernel for Feedback
Arc Set in Bipartite Tournaments . . . . 87--97
Stefan Canzar and
Khaled Elbassioni and
Gunnar W. Klau and
Julián Mestre On Tree--Constrained Matchings and
Generalizations . . . . . . . . . . . . 98--119
V. Arvind and
Bireswar Das and
Johannes Köbler and
Seinosuke Toda Colored Hypergraph Isomorphism is Fixed
Parameter Tractable . . . . . . . . . . 120--138
A. Karim Abu-Affash The Euclidean Bottleneck Full Steiner
Tree Problem . . . . . . . . . . . . . . 139--151
Son Hoang Dau and
Yeow Meng Chee Polynomial Time Algorithm for Min--Ranks
of Graphs with Simple Tree Structures 152--180
Andreas Emil Feldmann and
Peter Widmayer An $ O(n^4) $ Time Algorithm to Compute
the Bisection Width of Solid Grid Graphs 181--200
Ashwin Guha and
Ambedkar Dukkipati An Algorithmic Characterization of
Polynomial Functions over $ \mathbb
{Z}_{p^n} $ . . . . . . . . . . . . . . 201--218
Ashish Chiplunkar and
Sundar Vishwanathan Metrical Service Systems with Multiple
Servers . . . . . . . . . . . . . . . . 219--231
Patrizio Angelini and
Walter Didimo and
Stephen Kobourov and
Tamara Mchedlidze and
Vincenzo Roselli and
Antonios Symvonis and
Stephen Wismath Monotone Drawings of Graphs with Fixed
Embedding . . . . . . . . . . . . . . . 233--257
Yu-Feng Chien and
Wing-Kai Hon and
Rahul Shah and
Sharma V. Thankachan and
Jeffrey Scott Vitter Geometric BWT: Compressed Text Indexing
via Sparse Suffixes and Range Searching 258--278
Leah Epstein and
Csanád Imreh and
Asaf Levin and
Judit Nagy-György Online File Caching with Rejection
Penalties . . . . . . . . . . . . . . . 279--306
Hakan Yildiz and
Subhash Suri Computing Klee's Measure of Grounded
Boxes . . . . . . . . . . . . . . . . . 307--329
Reza Dorrigiv and
Martin R. Ehmsen and
Alejandro López-Ortiz Parameterized Analysis of Paging and
List Update Algorithms . . . . . . . . . 330--353
Andreas Emil Feldmann and
Luca Foschini Balanced Partitions of Trees and
Applications . . . . . . . . . . . . . . 354--376
Gokarna Sharma and
Costas Busch An Analysis Framework for Distributed
Hierarchical Directories . . . . . . . . 377--408
Uriel Feige and
Shlomo Jozeph Oblivious Algorithms for the Maximum
Directed Cut Problem . . . . . . . . . . 409--428
Chih-Hung Liu and
Evanthia Papadopoulou and
Der-Tsai Lee The $k$-Nearest-Neighbor Voronoi Diagram
Revisited . . . . . . . . . . . . . . . 429--449
Quentin F. Stout Isotonic Regression for Multiple
Independent Variables . . . . . . . . . 450--470
Maw-Shang Chang and
Ming-Tat Ko and
Hsueh-I Lu Linear-Time Algorithms for Tree Root
Problems . . . . . . . . . . . . . . . . 471--495
Noga Alon and
Amit Weinstein Local Correction with Constant Error
Rate . . . . . . . . . . . . . . . . . . 496--516
Robert Bredereck and
Thomas Köhler and
André Nichterlein and
Rolf Niedermeier and
Geevarghese Philip Using Patterns to Form Homogeneous Teams 517--538
Gregory Z. Gutin and
Stefan Szeider Guest Editorial: Special Issue on
Parameterized and Exact Computation . . 539--540
Edouard Bonnet and
Bruno Escoffier and
Eun Jung Kim and
Vangelis Th. Paschos On Subexponential and FPT-Time
Inapproximability . . . . . . . . . . . 541--565
Édouard Bonnet and
Bruno Escoffier and
Vangelis Th. Paschos and
Émeric Tourniaire Multi-parameter Analysis for Local Graph
Partitioning Problems: Using Greediness
for Parameterization . . . . . . . . . . 566--580
Antonis Thomas and
Jan van Leeuwen Pure Nash Equilibria in Graphical Games
and Treewidth . . . . . . . . . . . . . 581--604
Bart M. P. Jansen On Sparsification for Computing
Treewidth . . . . . . . . . . . . . . . 605--635
Stefan Fafianie and
Hans L. Bodlaender and
Jesper Nederlof Speeding Up Dynamic Programming with
Representative Sets: An Experimental
Evaluation of Algorithms for Steiner
Tree on Tree Decompositions . . . . . . 636--660
Michael Elberfeld and
Christoph Stockhusen and
Till Tantau On the Space and Circuit Complexity of
Parameterized Problems: Classes and
Completeness . . . . . . . . . . . . . . 661--701
Danny Hermelin and
Stefan Kratsch and
Karolina Soltys and
Magnus Wahlström and
Xi Wu A Completeness Theory for Polynomial
(Turing) Kernelization . . . . . . . . . 702--730
Leizhen Cai and
Yufei Cai Incompressibility of $H$-Free Edge
Modification Problems . . . . . . . . . 731--757
N. S. Narayanaswamy and
R. Subashini Obtaining Matrices with the Consecutive
Ones Property by Row Deletions . . . . . 758--773
Ashley Montanaro and
Richard Jozsa and
Graeme Mitchison On Exact Quantum Query Complexity . . . 775--796
Martin Knauer and
Joachim Spoerhase Better Approximation Algorithms for the
Maximum Internal Spanning Tree Problem 797--811
Mathew C. Francis and
Daniel Gonçalves and
Pascal Ochem The Maximum Clique Problem in Multiple
Interval Graphs . . . . . . . . . . . . 812--836
Martin Niemeier and
Andreas Wiese Scheduling with an Orthogonal Resource
Constraint . . . . . . . . . . . . . . . 837--858
Alexander Tiskin Fast Distance Multiplication of
Unit-Monge Matrices . . . . . . . . . . 859--888
Mangesh Gupte and
Darja Krushevskaja and
S. Muthukrishnan Analyses of Cardinal Auctions . . . . . 889--903
Francisco J. Soulignac Fully Dynamic Recognition of Proper
Circular-Arc Graphs . . . . . . . . . . 904--968
Jesper Jansson and
Kunihiko Sadakane and
Wing-Kin Sung Linked Dynamic Tries with Applications
to LZ-Compression in Sublinear Time and
Space . . . . . . . . . . . . . . . . . 969--988
Esha Ghosh and
Sudeshna Kolay and
Mrinal Kumar and
Pranabendu Misra and
Fahad Panolan and
Ashutosh Rai and
M. S. Ramanujan Faster Parameterized Algorithms for
Deletion to Split Graphs . . . . . . . . 989--1006
Bernard Chazelle and
Wolfgang Mulzer Data Structures on Event Graphs . . . . 1007--1020
Aleksander Vesel Linear Recognition and Embedding of
Fibonacci Cubes . . . . . . . . . . . . 1021--1034
Akira Matsubayashi Asymptotically Optimal Online Page
Migration on Three Points . . . . . . . 1035--1064
Shin-Ichi Tanigawa and
Yuichi Yoshida Testing the Supermodular-Cut Condition 1065--1075
Mong-Jen Kao and
Han-Lin Chen and
D. T. Lee Capacitated Domination: Problem
Complexity and Approximation Algorithms 1--43
John Augustine and
Ioannis Caragiannis and
Angelo Fanelli and
Christos Kalaitzis Enforcing Efficient Equilibria in
Network Design Games via Subsidies . . . 44--82
Pankaj K. Agarwal and
R. Sharathkumar Streaming Algorithms for Extent Problems
in High Dimensions . . . . . . . . . . . 83--98
Petr A. Golovach and
Pinar Heggernes and
Pim van 't Hof and
Fredrik Manne and
Daniël Paulusma and
Michal Pilipczuk Modifying a Graph Using Vertex
Elimination . . . . . . . . . . . . . . 99--125
Joseph Cheriyan and
Zachary Friggstad and
Zhihan Gao Approximating Minimum-Cost Connected
$T$-Joins . . . . . . . . . . . . . . . 126--147
Amotz Bar-Noy and
Ben Baumer Average Case Network Lifetime on an
Interval with Adjustable Sensing Ranges 148--166
Niv Buchbinder and
Rica Gonen Incentive Compatible Multi-Unit
Combinatorial Auctions: A Primal Dual
Approach . . . . . . . . . . . . . . . . 167--190
Avrim Blum and
Philip M. Long Special Issue on New Theoretical
Challenges in Machine Learning . . . . . 191--192
Anima Anandkumar and
Dean P. Foster and
Daniel Hsu and
Sham M. Kakade and
Yi-Kai Liu A Spectral Algorithm for Latent
Dirichlet Allocation . . . . . . . . . . 193--214
Sanjeev Arora and
Rong Ge and
Ankur Moitra and
Sushant Sachdeva Provable ICA with Unknown Gaussian
Noise, and Implications for Gaussian
Mixtures and Autoencoders . . . . . . . 215--236
Sanjoy Dasgupta and
Kaushik Sinha Randomized Partition Trees for Nearest
Neighbor Search . . . . . . . . . . . . 237--263
Rafi Witten and
Emmanuel Cand\`es Randomized Algorithms for Low-Rank
Matrix Factorizations: Sharp Performance
Bounds . . . . . . . . . . . . . . . . . 264--281
Maria Florina Balcan and
Vitaly Feldman Statistical Active Learning Algorithms
for Noise Tolerance and Differential
Privacy . . . . . . . . . . . . . . . . 282--315
Constantinos Daskalakis and
Ilias Diakonikolas and
Rocco A. Servedio Learning Poisson Binomial Distributions 316--357
Jean Cardinal and
Gwenaël Joret Hitting All Maximal Independent Sets of
a Bipartite Graph . . . . . . . . . . . 359--368
Erik D. Demaine and
John Iacono and
Stefan Langerman Worst-Case Optimal Tree Layout in
External Memory . . . . . . . . . . . . 369--378
Danny Z. Chen and
Xuehou Tan and
Haitao Wang and
Gangshan Wu Optimal Point Movement for Covering
Circular Regions . . . . . . . . . . . . 379--399
Dana Ron and
Rocco A. Servedio Exponentially Improved Algorithms and
Lower Bounds for Testing Signed
Majorities . . . . . . . . . . . . . . . 400--429
Chih-En Kuo and
Yue-Li Wang and
Jia-Jie Liu and
Ming-Tat Ko Resequencing a Set of Strings Based on a
Target String . . . . . . . . . . . . . 430--449
Richard Cole and
Tsvi Kopelowitz and
Moshe Lewenstein Suffix Trays and Suffix Trists:
Structures for Faster Text Indexing . . 450--466
Petra Berenbrink and
Robert Elsässer and
Thomas Sauerwald Communication Complexity of Quasirandom
Rumor Spreading . . . . . . . . . . . . 467--492
Deeparnab Chakrabarty and
Chandra Chekuri and
Sanjeev Khanna and
Nitish Korula Approximability of Capacitated Network
Design . . . . . . . . . . . . . . . . . 493--514
Wing-Kai Hon and
Tsung-Han Ku and
Tak-Wah Lam and
Rahul Shah and
Siu-Lung Tam and
Sharma V. Thankachan and
Jeffrey Scott Vitter Compressing Dictionary Matching Index
via Sparsification Technique . . . . . . 515--538
Ittai Abraham and
Yair Bartal and
Ofer Neiman Local Embeddings of Metric Spaces . . . 539--606
Andrzej Lingas and
Mia Persson A Fast Parallel Algorithm for
Minimum-Cost Small Integral Flows . . . 607--619
Emilio Di Giacomo and
Giuseppe Liotta and
Henk Meijer The Approximate Rectangle of Influence
Drawability Problem . . . . . . . . . . 620--655
Kevin Buchin and
Bettina Speckmann and
Kevin Verbeek Angle-Restricted Steiner Arborescences
for Flow Map Layout . . . . . . . . . . 656--685
Pinar Heggernes and
Pim van 't Hof and
Dániel Marx and
Neeldhara Misra and
Yngve Villanger On the Parameterized Complexity of
Finding Separators with Non-Hereditary
Properties . . . . . . . . . . . . . . . 687--713
Bundit Laekhanukit An Improved Approximation Algorithm for
the Minimum Cost Subset $k$-Connected
Subgraph Problem . . . . . . . . . . . . 714--733
Robert Crowston and
Mark Jones and
Matthias Mnich Max-Cut Parameterized Above the
Edwards--Erd\Hos Bound . . . . . . . . . 734--757
A. Kosowski and
B. Li and
N. Nisse and
K. Suchan $k$-Chordal Graphs: From Cops and Robber
to Compact Routing via Treewidth . . . . 758--777
Yasuaki Kobayashi and
Hisao Tamaki A Fast and Simple Subexponential Fixed
Parameter Algorithm for One-Sided
Crossing Minimization . . . . . . . . . 778--790
Djamal Belazzougui Improved Space--Time Tradeoffs for
Approximate Full-Text Indexing with One
Edit Error . . . . . . . . . . . . . . . 791--817
Bang Ye Wu and
Li-Hsuan Chen Parameterized Algorithms for the
$2$-Clustering Problem with Minimum Sum
and Minimum Sum of Squares Objective
Functions . . . . . . . . . . . . . . . 818--835
Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Yngve Villanger An Incremental Polynomial Time Algorithm
to Enumerate All Minimal Edge Dominating
Sets . . . . . . . . . . . . . . . . . . 836--859
Gerth Stòlting Brodal and
Spyros Sioutas and
Kostas Tsichlas and
Christos Zaroliagis $ D^2 $-Tree: A New Overlay with
Deterministic Bounds . . . . . . . . . . 860--883
Ho-Lin Chen and
David Doty and
Shinnosuke Seki Program Size and Temperature in
Self-Assembly . . . . . . . . . . . . . 884--899
Timothy M. Chan and
Stephane Durocher and
Matthew Skala and
Bryan T. Wilkinson Linear-Space Data Structures for Range
Minority Query in Arrays . . . . . . . . 901--913
Paola Bonizzoni and
Riccardo Dondi and
Giancarlo Mauri and
Italo Zoppis Restricted and Swap Common Superstring:
A Multivariate Algorithmic Perspective 914--939
Keith Edwards and
Eric McDermid A General Reduction Theorem with
Applications to Pathwidth and the
Complexity of MAX $2$-CSP . . . . . . . 940--968
Joan Boyar and
Sandy Irani and
Kim S. Larsen A Comparison of Performance Measures for
Online Algorithms . . . . . . . . . . . 969--994
Fabrizio Frati and
Serge Gaspers and
Joachim Gudmundsson and
Luke Mathieson Augmenting Graphs to Minimize the
Diameter . . . . . . . . . . . . . . . . 995--1010
Gruia Calinescu and
Minming Li Register Loading via Linear Programming 1011--1032
Seok-Hee Hong and
Peter Eades and
Naoki Katoh and
Giuseppe Liotta and
Pascal Schweitzer and
Yusuke Suzuki A Linear-Time Algorithm for Testing
Outer-$1$-Planarity . . . . . . . . . . 1033--1054
Gianlorenzo D'Angelo and
Gabriele Di Stefano and
Alfredo Navarra and
Nicolas Nisse and
Karol Suchan Computing on Rings by Oblivious Robots:
A Unified Approach for Different Tasks 1055--1096
Luis Barba and
Matias Korman and
Stefan Langerman and
Kunihiko Sadakane and
Rodrigo I. Silveira Space-Time Trade-offs for Stack-Based
Algorithms . . . . . . . . . . . . . . . 1097--1129
Leah Epstein and
Asaf Levin and
Gerhard J. Woeginger The (Weighted) Metric Dimension of
Graphs: Hard and Easy Cases . . . . . . 1130--1171
Yuichi Yoshida and
Hiro Ito Testing Outerplanarity of Bounded Degree
Graphs . . . . . . . . . . . . . . . . . 1--20
Yuren Zhou and
Jun Zhang and
Yong Wang Performance Analysis of the $ (1 + 1) $
Evolutionary Algorithm for the
Multiprocessor Scheduling Problem . . . 21--41
Karl Bringmann and
Christian Engels and
Bodo Manthey and
B. V. Raghavendra Rao Random Shortest Paths: Non--Euclidean
Instances for Metric Optimization
Problems . . . . . . . . . . . . . . . . 42--62
Yixin Cao and
Jianer Chen and
Yang Liu On Feedback Vertex Set: New Measure and
New Structures . . . . . . . . . . . . . 63--86
Martín Farach-Colton and
Miguel A. Mosteiro Initializing Sensor Networks of
Non-uniform Density in the Weak Sensor
Model . . . . . . . . . . . . . . . . . 87--114
Aparna Das and
Claire Mathieu A Quasipolynomial Time Approximation
Scheme for Euclidean Capacitated Vehicle
Routing . . . . . . . . . . . . . . . . 115--142
Babak Behsaz and
Mohammad R. Salavatipour On Minimum Sum of Radii and Diameters
Clustering . . . . . . . . . . . . . . . 143--165
Swan Dubois and
Toshimitsu Masuzawa and
Sébastien Tixeuil Maximum Metric Spanning Tree Made
Byzantine Tolerant . . . . . . . . . . . 166--201
Fedor V. Fomin and
Archontia C. Giannopoulou and
Michal Pilipczuk Computing Tree-Depth Faster Than $ 2^n $ 202--216
Tomasz Kociumaka and
Solon P. Pissis and
Jakub Radoszewski and
Wojciech Rytter and
Tomasz Wale\'n Fast Algorithm for Partial Covers in
Words . . . . . . . . . . . . . . . . . 217--233
Srikanta Tirthapura and
David P. Woodruff A General Method for Estimating
Correlated Aggregates Over a Data Stream 235--260
Petros Boufounos and
Volkan Cevher and
Anna C. Gilbert and
Yi Li and
Martin J. Strauss What's the Frequency, Kenneth?:
Sublinear Fourier Sampling Off the Grid 261--288
Flavia Bonomo and
Oliver Schaudt and
Maya Stein and
Mario Valencia-Pabon $b$-Coloring is NP-hard on Co-bipartite
Graphs and Polytime Solvable on
Tree-Cographs . . . . . . . . . . . . . 289--305
Tanja Hartmann and
Jonathan Rollin and
Ignaz Rutter Regular Augmentation of Planar Graphs 306--370
Anna Adamaszek and
Alexandru Popa Algorithmic and Hardness Results for the
Colorful Components Problems . . . . . . 371--388
Michael A. Bender and
Martin Farach-Colton and
Sándor P. Fekete Reallocation Problems in Scheduling . . 389--409
Anonymous Editor's Note: Special Section on
Computing and Combinatorics . . . . . . 410--410
Sándor P. Fekete and
Stephan Friedrichs and
Alexander Kröller and
Christiane Schmidt Facets for Art Gallery Problems . . . . 411--440
Khaled Elbassioni and
Kazuhisa Makino and
Kurt Mehlhorn and
Fahimeh Ramezani On Randomized Fictitious Play for
Approximating Saddle Points Over Convex
Sets . . . . . . . . . . . . . . . . . . 441--459
Yu Li and
Donglei Du and
Naihua Xiu and
Dachuan Xu Improved Approximation Algorithms for
the Facility Location Problems with
Linear/Submodular Penalties . . . . . . 460--482
Radu Curticapean and
Marvin Künnemann A Quantization Framework for Smoothed
Analysis of Euclidean Optimization
Problems . . . . . . . . . . . . . . . . 483--510
Vincenzo Auletta and
Diodato Ferraioli and
Francesco Pasquale and
Paolo Penna Logit Dynamics with Concurrent Updates
for Local Interaction Potential Games 511--546
Davide Bil\`o and
Luciano Gual\`a and
Guido Proietti A Faster Computation of All the Best
Swap Edges of a Shortest Paths Tree . . 547--570
Travis Gagie and
Danny Hermelin and
Gad M. Landau and
Oren Weimann Binary Jumbled Pattern Matching on Trees
and Tree-Like Structures . . . . . . . . 571--588
Sander P. A. Alewijnse and
Quirijn W. Bouts and
Alex P. ten Brink and
Kevin Buchin Computing the Greedy Spanner in Linear
Space . . . . . . . . . . . . . . . . . 589--606
Jean-Daniel Boissonnat and
Tamal K. Dey and
Clément Maria The Compressed Annotation Matrix: An
Efficient Data Structure for Computing
Persistent Cohomology . . . . . . . . . 607--619
Leizhen Cai and
Siu-Wing Cheng and
Tak-Wah Lam Guest Editors' Foreword . . . . . . . . 621--622
Lars Arge and
Mikkel Thorup RAM-Efficient External Memory Sorting 623--636
Martín Farach-Colton and
Meng-Tsung Tsai Exact Sublinear Binomial Sampling . . . 637--651
Moni Naor and
Eylon Yogev Tight Bounds for Sliding Bloom Filters 652--672
Otfried Cheong and
Sariel Har-Peled and
Heuna Kim and
Hyo-Sil Kim On the Number of Edges of Fan-Crossing
Free Graphs . . . . . . . . . . . . . . 673--695
René van Bevern and
Rodney G. Downey and
Michael R. Fellows and
Serge Gaspers Myhill--Nerode Methods for Hypergraphs 696--729
Kyle Klein and
Subhash Suri Pursuit Evasion on Polyhedral Surfaces 730--747
Hans L. Bodlaender and
MohammadTaghi Hajiaghayi and
Giuseppe F. Italiano Editorial . . . . . . . . . . . . . . . 748--749
Hans L. Bodlaender and
Mohammad Taghi Hajiaghayi and
Giuseppe F. Italiano Erratum to: Editorial . . . . . . . . . 750--750
Artur Jez One-Variable Word Equations in Linear
Time . . . . . . . . . . . . . . . . . . 1--48
Iftah Gamzu and
Moti Medina Improved Approximation for Orienting
Mixed Graphs . . . . . . . . . . . . . . 49--64
Alessio Orlandi and
Rossano Venturini Space-Efficient Substring Occurrence
Estimation . . . . . . . . . . . . . . . 65--90
Nan Liu and
Daming Zhu and
Haitao Jiang and
Binhai Zhu A 1.5-Approximation Algorithm for
Two-Sided Scaffold Filling . . . . . . . 91--116
Julian Anaya and
Jérémie Chalopin and
Jurek Czyzowicz and
Arnaud Labourel Convergecast and Broadcast by
Power-Aware Mobile Agents . . . . . . . 117--155
Leah Epstein and
Lukasz Jez and
Jirí Sgall and
Rob van Stee Online Scheduling of Jobs with Fixed
Start Times on Related Machines . . . . 156--176
Leah Epstein and
Elena Kleiman and
Julián Mestre Parametric Packing of Selfish Items and
the Subset Sum Algorithm . . . . . . . . 177--207
Klaus Jansen and
Lars Prädel New Approximability Results for
Two-Dimensional Bin Packing . . . . . . 208--269
Matthew Williamson and
Pavlos Eirinakis and
K. Subramani Fast Algorithms for the Undirected
Negative Cost Cycle Detection Problem 270--325
Zahra Jafargholi and
Emanuele Viola 3SUM, 3XOR, Triangles . . . . . . . . . 326--343
Stephane Durocher and
Rahul Shah and
Matthew Skala and
Sharma V. Thankachan Linear-Space Data Structures for Range
Frequency Queries on Arrays and Trees 344--366
R. Crowston and
G. Gutin and
M. Jones and
G. Muciaccia and
A. Yeo Parameterizations of Test Cover with
Bounded Test Sizes . . . . . . . . . . . 367--384
George B. Mertzios and
Paul G. Spirakis Algorithms and Almost Tight Results for
$3$-Colorability of Small Diameter
Graphs . . . . . . . . . . . . . . . . . 385--414
Evanthia Papadopoulou and
Maksym Zavershynskyi The Higher-Order Voronoi Diagram of Line
Segments . . . . . . . . . . . . . . . . 415--439
Koki Hamada and
Kazuo Iwama and
Shuichi Miyazaki The Hospitals/Residents Problem with
Lower Quotas . . . . . . . . . . . . . . 440--465
Zhi-Zhong Chen and
Bin Ma and
Lusheng Wang Randomized Fixed-Parameter Algorithms
for the Closest String Problem . . . . . 466--484
Sebastian Wild and
Markus E. Nebel and
Hosam Mahmoud Analysis of Quickselect Under
Yaroslavskiy's Dual-Pivoting Algorithm 485--506
Joan Boyar and
Shahin Kamali and
Kim S. Larsen and
Alejandro López-Ortiz Online Bin Packing with Advice . . . . . 507--527
Tim Nonner PTAS for Densest $k$-Subgraph in
Interval Graphs . . . . . . . . . . . . 528--539
Serge Gaspers and
Sebastian Ordyniak and
M. S. Ramanujan and
Saket Saurabh Backdoors to $q$-Horn . . . . . . . . . 540--557
Dries Goossens and
Sergey Polyakovskiy and
Frits C. R. Spieksma and
Gerhard J. Woeginger The Focus of Attention Problem . . . . . 559--573
Mourad El Ouali and
Peter Munstermann and
Anand Srivastav Randomized Approximation for the Set
Multicover Problem in Hypergraphs . . . 574--588
Yossi Azar and
Niv Buchbinder and
Kamal Jain How to Allocate Goods in an Online
Market? . . . . . . . . . . . . . . . . 589--601
Manfred Cochefert and
Jean-François Couturier and
Petr A. Golovach and
Dieter Kratsch and
Daniël Paulusma Parameterized Algorithms for Finding
Square Roots . . . . . . . . . . . . . . 602--629
Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk On Group Feedback Vertex Set
Parameterized by the Size of the Cutset 630--642
Sergio Cabello and
Panos Giannopoulos The Complexity of Separating Points in
the Plane . . . . . . . . . . . . . . . 643--663
Charalampos Papamanthou and
Roberto Tamassia and
Nikos Triandopoulos Authenticated Hash Tables Based on
Cryptographic Accumulators . . . . . . . 664--712
Mingyu Xiao and
Hiroshi Nagamochi An Exact Algorithm for TSP in Degree-$3$
Graphs Via Circuit Procedure and
Amortization on Connectivity Structure 713--741
Diego Arroyuelo and
Pooya Davoodi and
Srinivasa Rao Satti Succinct Dynamic Cardinal Trees . . . . 742--777
Tomoya Hibi and
Toshihiro Fujito Multi-rooted Greedy Approximation of
Directed Steiner Trees with Applications 778--786
Andrew McGregor and
A. Pavan and
Srikanta Tirthapura and
David P. Woodruff Space-Efficient Estimation of Statistics
Over Sub-Sampled Streams . . . . . . . . 787--811
Erik D. Demaine and
Matthew J. Patitz and
Trent A. Rogers and
Robert T. Schweller and
Scott M. Summers and
Damien Woods The Two-Handed Tile Assembly Model is
not Intrinsically Universal . . . . . . 812--850
Hari Krovi and
Frédéric Magniez and
Maris Ozols and
Jérémie Roland Quantum Walks Can Find a Marked Element
on Any Graph . . . . . . . . . . . . . . 851--907
Yoann Dieudonné and
Andrzej Pelc Anonymous Meeting in Networks . . . . . 908--946
Andreas Björklund and
Petteri Kaski and
Lukasz Kowalik Constrained Multilinear Detection and
Generalized Graph Motifs . . . . . . . . 947--967
Samir Khuller and
Barna Saha and
Kanthi K. Sarpatwar New Approximation Results for Resource
Replication Problems . . . . . . . . . . 969--991
Olawale Hassan and
Iyad Kanj and
Daniel Lokshtanov and
Ljubomir Perkovi\'c On the Ordered List Subgraph Embedding
Problems . . . . . . . . . . . . . . . . 992--1018
Chris Whidden and
Robert G. Beiko and
Norbert Zeh Fixed-Parameter and Approximation
Algorithms for Maximum Agreement Forests
of Multifurcating Trees . . . . . . . . 1019--1054
Pranjal Awasthi and
Madhav Jha and
Marco Molinaro and
Sofya Raskhodnikova Testing Lipschitz Functions on Hypergrid
Domains . . . . . . . . . . . . . . . . 1055--1081
Gonzalo Navarro and
Sharma V. Thankachan Optimal Encodings for Range Majority
Queries . . . . . . . . . . . . . . . . 1082--1098
Djamal Belazzougui and
Rossano Venturini Compressed String Dictionary Search with
Edit Distance One . . . . . . . . . . . 1099--1122
Donatella Firmani and
Loukas Georgiadis and
Giuseppe F. Italiano and
Luigi Laura and
Federico Santaroni Strong Articulation Points and Strong
Bridges in Large Scale Graphs . . . . . 1123--1147
Leah Epstein and
Asaf Levin and
Gerhard J. Woeginger Vertex Cover Meets Scheduling . . . . . 1148--1173
Mourad Ba\"\iou and
Francisco Barahona Stackelberg Bipartite Vertex Cover and
the Preflow Algorithm . . . . . . . . . 1174--1183
Chien-Chung Huang and
Telikepalli Kavitha and
Kurt Mehlhorn and
Dimitrios Michail Fair Matchings and Related Problems . . 1184--1203
Pierre Fraigniaud and
Magnús M. Halldórsson and
Boaz Patt-Shamir and
Dror Rawitz and
Adi Rosén Shrinking Maxima, Decreasing Costs: New
Online Packing and Covering Problems . . 1205--1223
Ulrich Laube and
Markus E. Nebel Maximum Likelihood Analysis of the
Ford--Fulkerson Method on Special Graphs 1224--1266
Amihood Amir and
Haim Paryenty and
Liam Roditty Configurations and Minority in the
String Consensus Problem . . . . . . . . 1267--1292
Christopher Auer and
Christian Bachmaier and
Franz J. Brandenburg and
Andreas Gleißner and
Kathrin Hanauer and
Daniel Neuwirth and
Josef Reislhuber Outer $1$-Planar Graphs . . . . . . . . 1293--1320
Sanjit Chatterjee and
Chethan Kamath A Closer Look at Multiple Forking:
Leveraging (In)Dependence for a Tighter
Bound . . . . . . . . . . . . . . . . . 1321--1362
Giorgio Ausiello and
Paolo G. Franciosa and
Giuseppe F. Italiano and
Andrea Ribichini On Resilient Graph Spanners . . . . . . 1363--1385
Olivier Gascuel and
Mike Steel A `Stochastic Safety Radius' for
Distance-Based Tree Reconstruction . . . 1386--1403
Spyros Kontogiannis and
Christos Zaroliagis Distance Oracles for Time-Dependent
Networks . . . . . . . . . . . . . . . . 1404--1434
Lukasz Kowalik and
Arkadiusz Socala Assigning Channels Via the
Meet-in-the-Middle Approach . . . . . . 1435--1452
Henning Bruhn and
Morgan Chopin and
Felix Joos and
Oliver Schaudt Structural Parameterizations for
Boxicity . . . . . . . . . . . . . . . . 1453--1472
Jin-Yi Cai and
Pinyan Lu Erratum to: Signature Theory in
Holographic Algorithms . . . . . . . . . 1473--1476
Sebastian Ordyniak and
Alexandru Popa A Parameterized Study of Maximum
Generalized Pattern Matching Problems 1--26
Danny Z. Chen and
Jian Li and
Hongyu Liang and
Haitao Wang Matroid and Knapsack Center Problems . . 27--52
Babak Behsaz and
Mohammad R. Salavatipour and
Zoya Svitkina New Approximation Algorithms for the
Unsplittable Capacitated Facility
Location Problem . . . . . . . . . . . . 53--83
Marie-Louise Bruner and
Martin Lackner A Fast Algorithm for Permutation Pattern
Matching Based on Alternating Runs . . . 84--117
Yixin Cao and
Dániel Marx Chordal Editing is Fixed-Parameter
Tractable . . . . . . . . . . . . . . . 118--137
Kenta Kitsunai and
Yasuaki Kobayashi and
Keita Komuro and
Hisao Tamaki and
Toshihiro Tano Computing Directed Pathwidth in $
O(1.89^n) $ Time . . . . . . . . . . . . 138--157
Michael A. Bekos and
Martin Gronemann and
Chrysanthi N. Raftopoulou Two-Page Book Embeddings of $4$-Planar
Graphs . . . . . . . . . . . . . . . . . 158--185
Dieter Kratsch and
Ioan Todinca Guest Editorial: Selected Papers from WG
2014 . . . . . . . . . . . . . . . . . . 186--186
Manu Basavaraju and
L. Sunil Chandran and
Martin Charles Golumbic and
Rogers Mathew and
Deepak Rajendraprasad Separation Dimension of Graphs and
Hypergraphs . . . . . . . . . . . . . . 187--204
Eglantine Camby and
Oliver Schaudt A New Characterization of $ P_k $-Free
Graphs . . . . . . . . . . . . . . . . . 205--217
Sigve Hortemo Sæther and
Jan Arne Telle Between Treewidth and Clique--Width . . 218--253
Marek Cygan and
Pinar Heggernes Foreword: Special Issue on IPEC 2014 . . 255--256
Marek Cygan and
Pinar Heggernes Erratum to: Foreword: Special Issue on
IPEC 2014 . . . . . . . . . . . . . . . 257--257
V. Arvind and
Gaurav Rattan The Parameterized Complexity of
Geometric Graph Isomorphism . . . . . . 258--276
Igor Razgon On the Read-Once Property of Branching
Programs and CNFs of Bounded Treewidth 277--294
Matthew Johnson and
Dieter Kratsch and
Stefan Kratsch and
Viresh Patel and
Daniël Paulusma Finding Shortest Paths Between Graph
Colourings . . . . . . . . . . . . . . . 295--321
V. Arvind and
Johannes Köbler and
Sebastian Kuhnert and
Jacobo Torán Solving Linear Equations Parameterized
by Hamming Weight . . . . . . . . . . . 322--338
Patrick Traxler The Relative Exponential Time Complexity
of Approximate Counting Satisfying
Assignments . . . . . . . . . . . . . . 339--362
Jannis Bulian and
Anuj Dawar Graph Isomorphism Parameterized by
Elimination Distance to Bounded Degree 363--382
Gregory Gutin and
Stefan Kratsch and
Magnus Wahlström Polynomial Kernels and User Reductions
for the Workflow Satisfiability Problem 383--402
Holger Dell AND-Compression of NP-Complete Problems:
Streamlined Proof and Minor Observations 403--423
Benjamin Doerr and
Carsten Witt Guest Editorial: Theory of Evolutionary
Computation . . . . . . . . . . . . . . 425--427
Duc-Cuong Dang and
Per Kristian Lehre Runtime Analysis of Non-elitist
Populations: From Classical Optimisation
to Partial Information . . . . . . . . . 428--461
Christian Gießen and
Timo Kötzing Robustness of Populations in Stochastic
Environments . . . . . . . . . . . . . . 462--489
Timo Kötzing Concentration of First Hitting Times
Under Additive Drift . . . . . . . . . . 490--506
Andrew M. Sutton Superpolynomial Lower Bounds for the $
(1 + 1) $ EA on Some Easy Combinatorial
Problems . . . . . . . . . . . . . . . . 507--528
Benjamin Doerr and
Carola Doerr The Impact of Random Initialization on
the Runtime of Randomized Search
Heuristics . . . . . . . . . . . . . . . 529--553
Andrei Lissovoi and
Carsten Witt MMAS Versus Population-Based EA on a
Family of Dynamic Fitness Functions . . 554--576
Mireille Bousquet-Mélou and
Robert Sedgewick and
Mich\`ele Soria Introduction for S. I. A of A14 . . . . 577--578
Michael Drmota and
Emma Yu Jin An Asymptotic Analysis of Labeled and
Unlabeled $k$-Trees . . . . . . . . . . 579--605
Daniel Krenn and
Stephan Wagner Compositions into Powers of $b$:
Asymptotic Enumeration and Parameters 606--631
Markus E. Nebel and
Sebastian Wild and
Conrado Martínez Analysis of Pivot Sampling in Dual-Pivot
Quicksort: A Holistic Analysis of
Yaroslavskiy's Partitioning Scheme . . . 632--683
Amalia Duch and
Gustavo Lau and
Conrado Martínez On the Cost of Fixed Partial Match
Queries in $K$--$d$ Trees . . . . . . . 684--723
Svante Janson and
Alfredo Viola A Unified Approach to Linear Probing
Hashing with Buckets . . . . . . . . . . 724--781
Stephen Melczer and
Marni Mishna Asymptotic Lattice Path Enumeration
Using Diagonals . . . . . . . . . . . . 782--811
Axel Bacher and
Andrea Sportiello Complexity of Anticipated Rejection
Algorithms and the Darling--Mandelbrot
Distribution . . . . . . . . . . . . . . 812--831
Stacey Jeffery and
Robin Kothari and
François Le Gall and
Frédéric Magniez Improving Quantum Query Complexity of
Boolean Matrix Multiplication Using
Graph Collision . . . . . . . . . . . . 1--16
Vladimir Kolmogorov and
Rustem Takhanov Inference Algorithms for Pattern-Based
CRFs on Sequence Data . . . . . . . . . 17--46
Tamara Mchedlidze and
Martin Nöllenburg and
Ignaz Rutter Extending Convex Partial Drawings of
Graphs . . . . . . . . . . . . . . . . . 47--67
Ruiwen Chen and
Valentine Kabanets and
Nitin Saurabh An Improved Deterministic #SAT Algorithm
for Small de Morgan Formulas . . . . . . 68--87
Aris Anagnostopoulos and
Fabrizio Grandoni and
Stefano Leonardi and
Piotr Sankowski Online Network Design with Outliers . . 88--109
Vincenzo Auletta and
Diodato Ferraioli and
Francesco Pasquale and
Paolo Penna and
Giuseppe Persiano Convergence to Equilibrium of Logit
Dynamics for Strategic Games . . . . . . 110--142
Dimitris Fotakis and
Christos Tzamos Strategyproof Facility Location for
Concave Cost Functions . . . . . . . . . 143--167
Daniel Paulusma and
Friedrich Slivovsky and
Stefan Szeider Model Counting for CNF Formulas of
Bounded Modular Treewidth . . . . . . . 168--194
Cameron T. Chalk and
Dominic A. Fernandez and
Alejandro Huerta and
Mario A. Maldonado and
Robert T. Schweller and
Leslie Sweet Strict Self-Assembly of Fractals Using
Multiple Hands . . . . . . . . . . . . . 195--224
Philipp Kindermann and
Benjamin Niedermann and
Ignaz Rutter and
Marcus Schaefer and
André Schulz and
Alexander Wolff Multi-sided Boundary Labeling . . . . . 225--258
Laurent Bulteau and
Vincent Froese and
Konstantin Kutzkov and
Rasmus Pagh Triangle Counting in Dynamic Graph
Streams . . . . . . . . . . . . . . . . 259--278
Jòrgen Bang-Jensen and
Saket Saurabh and
Sven Simonsen Parameterized Algorithms for
Non-separating Trees and Branchings in
Digraphs . . . . . . . . . . . . . . . . 279--296
John Fearnley and
Paul W. Goldberg and
Rahul Savani and
Troels Bjerre Sòrensen Approximate Well-supported Nash
Equilibria Below Two-thirds . . . . . . 297--319
Jòrgen Bang-Jensen and
Alessandro Maddaloni and
Saket Saurabh Algorithms and Kernels for Feedback Set
Problems in Generalizations of
Tournaments . . . . . . . . . . . . . . 320--343
Abbas Mehrabian and
Nick Wormald It's a Small World for Random Surfers 344--380
Fatemeh Rajabi-Alni and
Alireza Bagheri An $ O(n^2) $ Algorithm for the
Limited-Capacity Many-to-Many Point
Matching in One Dimension . . . . . . . 381--400
Isolde Adler and
Stavros G. Kolliopoulos and
Dimitrios M. Thilikos Planar Disjoint-Paths Completion . . . . 401--425
Lee-Ad Gottlieb and
Tyler Neylon Matrix Sparsification and the Sparse
Null Space Problem . . . . . . . . . . . 426--444
J. Ian Munro and
Patrick K. Nicholson Succinct Posets . . . . . . . . . . . . 445--473
Fangqiu Han and
Subhash Suri and
Xifeng Yan Observability of Lattice Graphs . . . . 474--489
Bjarni V. Halldórsson and
Magnús M. Halldórsson and
Elena Losievskaja and
Mario Szegedy Streaming Algorithms for Independent
Sets in Sparse Hypergraphs . . . . . . . 490--501
Michel Raynal and
Julien Stainer and
Gadi Taubenfeld Distributed Universality . . . . . . . . 502--535
Flávio K. Miyazawa and
Lehilton L. C. Pedrosa and
Rafael C. S. Schouery and
Maxim Sviridenko and
Yoshiko Wakabayashi Polynomial-Time Approximation Schemes
for Circle and Other Packing Problems 536--568
Ivan Bliznets and
Fedor V. Fomin and
Michal Pilipczuk and
Yngve Villanger Largest Chordal and Interval Subgraphs
Faster than $ 2^n $ . . . . . . . . . . 569--594
Mark Braverman and
David P. Woodruff Guest Editorial for Information
Complexity and Applications . . . . . . 595--596
Gábor Braun and
Sebastian Pokutta Common Information and Unique
Disjointness . . . . . . . . . . . . . . 597--629
Elad Haramaty and
Madhu Sudan Deterministic Compression with Uncertain
Priors . . . . . . . . . . . . . . . . . 630--653
Venkatesan Guruswami and
Krzysztof Onak Superlinear Lower Bounds for Multipass
Graph Processing . . . . . . . . . . . . 654--683
Mika Göös and
Toniann Pitassi and
Thomas Watson Zero-Information Protocols and
Unambiguity in Arthur--Merlin
Communication . . . . . . . . . . . . . 684--719
Rahul Jain and
Attila Pereszlényi and
Penghui Yao A Direct Product Theorem for Two-Party
Bounded-Round Public-Coin Communication
Complexity . . . . . . . . . . . . . . . 720--748
Joshua Brody and
Harry Buhrman and
Michal Koucký and
Bruno Loff and
Florian Speelman and
Nikolay Vereshchagin Towards a Reverse Newman's Theorem in
Interactive Information Complexity . . . 749--781
Gillat Kol and
Shay Moran and
Amir Shpilka and
Amir Yehudayoff Direct Sum Fails for Zero-Error Average
Communication . . . . . . . . . . . . . 782--795
Joshua Brody and
Amit Chakrabarti and
Ranganath Kondapally and
David P. Woodruff and
Grigory Yaroslavtsev Certifying Equality With Limited
Interaction . . . . . . . . . . . . . . 796--845
Mark Braverman and
Omri Weinstein A Discrepancy Lower Bound for
Information Complexity . . . . . . . . . 846--864
Zhipeng Cai and
Alexander Zelikovsky Computing and Combinatorics . . . . . . 865--866
Jianer Chen and
Feng Shi and
Jianxin Wang Approximating Maximum Agreement Forest
on Multiple Binary Trees . . . . . . . . 867--889
Meena Mahajan and
B. V. Raghavendra Rao and
Karteek Sreenivasaiah Building Above Read-Once Polynomials:
Identity Testing and Hardness of
Representation . . . . . . . . . . . . . 890--909
Eli Fox-Epstein and
Csaba D. Tóth and
Andrew Winslow Diffuse Reflection Radius in a Simple
Polygon . . . . . . . . . . . . . . . . 910--931
Alfredo Viola Preface --- S.I.: LATIN 2014 . . . . . . 932--934
Panagiotis Cheilaris and
Elena Khramtcova and
Stefan Langerman and
Evanthia Papadopoulou A Randomized Incremental Algorithm for
the Hausdorff Voronoi Diagram of
Non-crossing Clusters . . . . . . . . . 935--960
Volker Diekert and
Alexei G. Myasnikov and
Armin Weiß Conjugacy in Baumslag's Group, Generic
Case Complexity, and Division in Power
Circuits . . . . . . . . . . . . . . . . 961--988
Nicolas Basset Counting and Generating Permutations in
Regular Classes . . . . . . . . . . . . 989--1034
Élie de Panafieu and
Dani\`ele Gardy and
Bernhard Gittenberger and
Markus Kuba $2$-Xor Revisited: Satisfiability and
Probabilities of Functions . . . . . . . 1035--1076
Nikhil Bansal and
Tim Oosterwijk and
Tjark Vredeveld and
Ruben van der Zwaan Approximating Vector Scheduling: Almost
Matching Upper and Lower Bounds . . . . 1077--1096
Prosenjit Bose and
Rolf Fagerberg and
John Howat and
Pat Morin Biased Predecessor Search . . . . . . . 1097--1105
Antoine Genitrini and
Cécile Mailler Generalised and Quotient Models for
Random And/Or Trees and Application to
Satisfiability . . . . . . . . . . . . . 1106--1138
Mário César San Felice and
David P. Williamson and
Orlando Lee A Randomized $ {\rm O}(\log n)
$-Competitive Algorithm for the Online
Connected Facility Location Problem . . 1139--1157
Hee-Kap Ahn and
Chan-Su Shin Guest Editor's Foreword . . . . . . . . 1158--1159
Alex Gavryushkin and
Bakhadyr Khoussainov and
Mikhail Kokho and
Jiamou Liu Dynamic Algorithms for Multimachine
Interval Scheduling Through Analysis of
Idle Intervals . . . . . . . . . . . . . 1160--1180
Pål Grònås Drange and
Markus Dregi and
Pim van 't Hof On the Computational Complexity of
Vertex Integrity and Component Order
Connectivity . . . . . . . . . . . . . . 1181--1202
Daniel Kane and
Osamu Watanabe A Short Implicant of a CNF Formula with
Many Satisfying Assignments . . . . . . 1203--1223
Jesper Jansson and
Wing-Kin Sung and
Hoa Vu and
Siu-Ming Yiu Faster Algorithms for Computing the $
R^* $ Consensus Tree . . . . . . . . . . 1224--1244
Ei Ando and
Shuji Kijima An FPTAS for the Volume Computation of
$0$--$1$ Knapsack Polytopes Based on
Approximate Convolution . . . . . . . . 1245--1263
Prosenjit Bose and
Karim Dou\"\ieb and
John Iacono and
Stefan Langerman The Power and Limitations of Static
Binary Search Trees with Lazy Finger . . 1264--1275
Noga Alon and
Moran Feldman and
Moshe Tennenholtz Revenue and Reserve Prices in a
Probabilistic Single Item Auction . . . 1--15
Ashley Montanaro Quantum Pattern Matching Fast on Average 16--39
Danny Z. Chen and
Haitao Wang Computing the Visibility Polygon of an
Island in a Polygonal Domain . . . . . . 40--64
Weidong Li and
Lusheng Wang and
Wenjuan Cui A Polynomial Time Approximation Scheme
for the Closest Shared Center Problem 65--83
Ildiko Schlotter and
Piotr Faliszewski and
Edith Elkind Campaign Management Under
Approval-Driven Voting Rules . . . . . . 84--115
Shoshana Marcus and
Dina Sokol $2$D Lyndon Words and Applications . . . 116--133
Guy Feigenblat and
Ely Porat and
Ariel Shiftan A Grouping Approach for Succinct Dynamic
Dictionary Matching . . . . . . . . . . 134--150
Guy Feigenblat and
Ely Porat and
Ariel Shiftan Erratum to: A Grouping Approach for
Succinct Dynamic Dictionary Matching . . 151--151
Wolfgang Dvorák and
Monika Henzinger and
David P. Williamson Maximizing a Submodular Function with
Viability Constraints . . . . . . . . . 152--172
Katharina T. Huber and
Leo van Iersel and
Vincent Moulton and
Celine Scornavacca and
Taoyang Wu Reconstructing Phylogenetic Level-$1$
Networks from Nondense Binet and Trinet
Sets . . . . . . . . . . . . . . . . . . 173--200
Bert Besser and
Matthias Poloczek Greedy Matching: Guarantees and
Limitations . . . . . . . . . . . . . . 201--234
Timo Bingmann and
Andreas Eberle and
Peter Sanders Engineering Parallel String Sorting . . 235--286
Stephan Held and
Sophie Spirkl Fast Prefix Adders for Non-uniform Input
Arrival Times . . . . . . . . . . . . . 287--308
Kurt Mehlhorn and
Adrian Neumann and
Jens M. Schmidt Certifying $3$-Edge-Connectivity . . . . 309--335
Philip Bille and
Patrick Hagge Cording and
Inge Li Gòrtz Compressed Subsequence Matching and
Packed Tree Coloring . . . . . . . . . . 336--348
Rom Aschner and
Matthew J. Katz Bounded-Angle Spanning Tree: Modeling
Networks with Angular Constraints . . . 349--373
Roberto Solis-Oba and
Paul Bonsma and
Stefanie Lowski A $2$-Approximation Algorithm for
Finding a Spanning Tree with Maximum
Number of Leaves . . . . . . . . . . . . 374--388
Saverio Caminiti and
Irene Finocchi and
Emanuele G. Fusco and
Francesco Silvestri Resilient Dynamic Programming . . . . . 389--425
Hung-Lung Wang An Optimal Algorithm for the Weighted
Backup $2$-Center Problem on a Tree . . 426--439
Ari Freund Improved Subquadratic 3SUM . . . . . . . 440--458
Troy Lee and
Frédéric Magniez and
Miklos Santha Improved Quantum Query Algorithms for
Triangle Detection and Associativity
Testing . . . . . . . . . . . . . . . . 459--486
Argyrios Deligkas and
John Fearnley and
Rahul Savani and
Paul Spirakis Computing Approximate Nash Equilibria in
Polymatrix Games . . . . . . . . . . . . 487--514
S. Anand and
Karl Bringmann and
Tobias Friedrich and
Naveen Garg and
Amit Kumar Minimizing Maximum (Weighted) Flow-Time
on Related and Unrelated Machines . . . 515--536
Benjamin Hescott and
Caleb Malchik and
Andrew Winslow Tight Bounds for Active Self-Assembly
Using an Insertion Primitive . . . . . . 537--554
Pasin Manurangsi and
Dana Moshkovitz Improved Approximation Algorithms for
Projection Games . . . . . . . . . . . . 555--594
Lisa Hellerstein and
Özgür Özkan and
Linda Sellie Max-Throughput for (Conservative)
$k$-of-$n$ Testing . . . . . . . . . . . 595--618
Stéphan Thomassé and
Nicolas Trotignon and
Kristina Vuskovi\'c A Polynomial Turing-Kernel for Weighted
Independent Set in Bull-Free Graphs . . 619--641
Min Chih Lin and
Michel J. Mizrahi and
Jayme L. Szwarcfiter Exact Algorithms for Minimum Weighted
Dominating Induced Matching . . . . . . 642--660
Sarah R. Allen and
Lisa Hellerstein and
Devorah Kletenik and
Tonguç Ünlüyurt Evaluation of Monotone DNF Formulas . . 661--685
Feodor F. Dragan and
Ekkehard Köhler and
Arne Leitert Line-Distortion, Bandwidth and
Path-Length of a Graph . . . . . . . . . 686--713
Craig Dillabaugh and
Meng He and
Anil Maheshwari and
Norbert Zeh I/O-Efficient Path Traversal in Succinct
Planar Graphs . . . . . . . . . . . . . 714--755
Dimitris Fotakis and
Piotr Krysta and
Carmine Ventre Combinatorial Auctions Without Money . . 756--785
H. B. Macêdo Filho and
R. C. S. Machado and
C. M. H. de Figueiredo Efficient Algorithms for
Clique-Colouring and Biclique-Colouring
Unichord-Free Graphs . . . . . . . . . . 786--814
Shun Sato Combinatorial Relaxation Algorithm for
the Entire Sequence of the Maximum
Degree of Minors . . . . . . . . . . . . 815--835
Bruno Escoffier and
Laurent Gourv\`es and
Jérôme Monnot The Price of Optimum: Complexity and
Approximation for a Matching Game . . . 836--866
Sándor P. Fekete and
Hella-Franziska Hoffmann Online Square-into-Square Packing . . . 867--901
Michael A. Bekos and
Thomas C. van Dijk and
Martin Fink and
Philipp Kindermann and
Stephen Kobourov and
Sergey Pupyrev and
Joachim Spoerhase and
Alexander Wolff Improved Approximation Algorithms for
Box Contact Representations . . . . . . 902--920
Lasse Kliemann The Price of Anarchy in Bilateral
Network Formation in an Adversary Model 921--941
Lélia Blin and
Janna Burman and
Nicolas Nisse Exclusive Graph Searching . . . . . . . 942--969
Reut Levi and
Ronitt Rubinfeld and
Anak Yodpinyanee Local Computation Algorithms for Graphs
of Non-constant Degrees . . . . . . . . 971--994
Carlo Comin and
Romeo Rizzi Improved Pseudo-polynomial Bound for the
Value Problem and Optimal Strategy
Synthesis in Mean Payoff Games . . . . . 995--1021
Patrizio Angelini and
Giordano Da Lozzo and
Giuseppe Di Battista and
Fabrizio Frati Strip Planarity Testing for Embedded
Planar Graphs . . . . . . . . . . . . . 1022--1059
Piotr Micek and
Veit Wiechert An On-line Competitive Algorithm for
Coloring Bipartite Graphs Without Long
Induced Paths . . . . . . . . . . . . . 1060--1070
Pavel Klavík and
Jan Kratochvíl and
Yota Otachi and
Ignaz Rutter and
Toshiki Saitoh and
Maria Saumell and
Tomás Vyskocil Extending Partial Representations of
Proper and Unit Interval Graphs . . . . 1071--1104
Reuven Bar-Yehuda and
Michael Beder and
Dror Rawitz A Constant Factor Approximation
Algorithm for the Storage Allocation
Problem . . . . . . . . . . . . . . . . 1105--1127
Yusuke Kobayashi and
Sho Toyooka Finding a Shortest Non-zero Path in
Group--Labeled Graphs via Permanent
Computation . . . . . . . . . . . . . . 1128--1142
Ioannis Caragiannis and
Angelo Fanelli and
Nick Gravin Short Sequences of Improvement Moves
Lead to Approximate Equilibria in
Constraint Satisfaction Games . . . . . 1143--1158
Gahyun Park A Generalization of Multiple Choice
Balls-into-Bins: Tight Bounds . . . . . 1159--1193
Tomasz Kociumaka and
Jakub Radoszewski and
Wojciech Rytter Efficient Indexes for Jumbled Pattern
Matching with Constant-Sized Alphabet 1194--1215
Rajesh Chitnis and
Hossein Esfandiari and
MohammadTaghi Hajiaghayi and
Rohit Khandekar and
Guy Kortsarz and
Saeed Seddighin A Tight Algorithm for Strongly Connected
Steiner Subgraph on Two Terminals with
Demands . . . . . . . . . . . . . . . . 1216--1239
David Furcy and
Samuel Micka and
Scott M. Summers Optimal Program-Size Complexity for
Self-Assembled Squares at Temperature
$1$ in $3$D . . . . . . . . . . . . . . 1240--1282
Andreas Brandstädt and
Raffaele Mosca Finding Dominating Induced Matchings in
$ P_8 $-Free Graphs in Polynomial Time 1283--1302
Lila Kari and
Steffen Kopecki and
Pierre-Étienne Meunier and
Matthew J. Patitz and
Shinnosuke Seki Binary Pattern Tile Set Synthesis Is
NP-Hard . . . . . . . . . . . . . . . . 1--46
Aaron M. Andrews and
Haitao Wang Minimizing the Aggregate Movements for
Interval Coverage . . . . . . . . . . . 47--85
Rudolf Scheifele Steiner Trees with Bounded RC-Delay . . 86--109
Rajesh Chitnis and
László Egri and
Dániel Marx List $H$-Coloring a Graph by Removing
Few Vertices . . . . . . . . . . . . . . 110--146
Sariel Har-Peled and
Subhro Roy Approximating the Maximum Overlap of
Polygons under Translation . . . . . . . 147--165
K. Subramani and
Piotr Wojciechowski A Combinatorial Certifying Algorithm for
Linear Feasibility in UTVPI Constraints 166--208
Sander P. A. Alewijnse and
Quirijn W. Bouts and
Alex P. ten Brink and
Kevin Buchin Distribution-Sensitive Construction of
the Greedy Spanner . . . . . . . . . . . 209--231
Haitao Wang and
Jingru Zhang Computing the Center of Uncertain Points
on Tree Networks . . . . . . . . . . . . 232--254
Uriel Feige and
Moshe Tennenholtz Optimization with Uniform Size Queries 255--273
Amer E. Mouawad and
Naomi Nishimura and
Venkatesh Raman and
Narges Simjour and
Akira Suzuki On the Parameterized Complexity of
Reconfiguration Problems . . . . . . . . 274--297
Basile Couëtoux and
Elie Nakache and
Yann Vax\`es The Maximum Labeled Path Problem . . . . 298--318
Meirav Zehavi Algorithms for $k$-Internal
Out-Branching and $k$-Tree in Bounded
Degree Graphs . . . . . . . . . . . . . 319--341
Isolde Adler and
Mamadou Moustapha Kanté and
O-joung Kwon Linear Rank-Width of Distance-Hereditary
Graphs I. A Polynomial-Time Algorithm 342--377
J. Ian Munro and
Gonzalo Navarro and
Jesper Sindahl Nielsen and
Rahul Shah and
Sharma V. Thankachan Top-$k$ Term-Proximity in Succinct Space 379--393
Paola Bonizzoni and
Gianluca Della Vedova and
Yuri Pirola and
Marco Previtali and
Raffaella Rizzi An External-Memory Algorithm for String
Graph Construction . . . . . . . . . . . 394--424
Allan Borodin and
Mark Braverman and
Brendan Lucier and
Joel Oren Strategyproof Mechanisms for Competitive
Influence in Networks . . . . . . . . . 425--452
Timothy M. Chan and
Meng He and
J. Ian Munro and
Gelin Zhou Succinct Indices for Path Minimum, with
Applications . . . . . . . . . . . . . . 453--491
Susanne Albers and
Matthias Hellwig Online Makespan Minimization with
Parallel Schedules . . . . . . . . . . . 492--520
Jelena Marasevi\'c and
Clifford Stein and
Gil Zussman Max-min Fair Rate Allocation and Routing
in Energy Harvesting Networks:
Algorithmic Analysis . . . . . . . . . . 521--557
Carola Doerr and
Francisco Chicano Preface to the Special Issue on Theory
of Genetic and Evolutionary Computation 558--560
Benjamin Doerr and
Frank Neumann and
Andrew M. Sutton Time Complexity Analysis of Evolutionary
Algorithms on Random Satisfiable $k$-CNF
Formulas . . . . . . . . . . . . . . . . 561--586
Christian Gießen and
Carsten Witt The Interplay of Population Size and
Mutation Probability in the $ (1 +
\lambda) $ EA on OneMax . . . . . . . . 587--609
Carola Doerr and
Johannes Lengler OneMax in Black-Box Models with Several
Restrictions . . . . . . . . . . . . . . 610--640
Andrei Lissovoi and
Carsten Witt A Runtime Analysis of Parallel
Evolutionary Algorithms in Dynamic
Optimization . . . . . . . . . . . . . . 641--659
Duc-Cuong Dang and
Thomas Jansen and
Per Kristian Lehre Populations Can Be Essential in Tracking
Dynamic Optima . . . . . . . . . . . . . 660--680
Tiago Paixão and
Jorge Pérez Heredia and
Dirk Sudholt and
Barbora Trubenová Towards a Runtime Comparison of Natural
and Artificial Evolution . . . . . . . . 681--713
Dogan Corus and
Jun He and
Thomas Jansen and
Pietro S. Oliveto and
Dirk Sudholt and
Christine Zarges On Easiest Functions for Mutation
Operators in Bio-Inspired Optimisation 714--740
Hu Ding and
Jinhui Xu FPTAS for Minimizing the Earth Mover's
Distance Under Rigid Transformations and
Related Problems . . . . . . . . . . . . 741--770
S. Thomas McCormick and
Britta Peis and
José Verschae and
Andreas Wierz Primal-Dual Algorithms for Precedence
Constrained Covering Problems . . . . . 771--787
Dimitris Fotakis and
Alexis C. Kaporis and
Thanasis Lianeas and
Paul G. Spirakis Resolving Braess's Paradox in Random
Networks . . . . . . . . . . . . . . . . 788--818
Guy Even and
Moti Medina Online Packet-Routing in Grids with
Bounded Buffers . . . . . . . . . . . . 819--868
Evangelos Bampas and
Leszek Gasieniec and
Nicolas Hanusse and
David Ilcinkas and
Ralf Klasing and
Adrian Kosowski and
Tomasz Radzik Robustness of the Rotor--Router
Mechanism . . . . . . . . . . . . . . . 869--895
Frantisek Galcík and
Ján Katrenic and
Gabriel Semanisin On Computing an Optimal Semi-matching 896--913
Florent Foucaud and
George B. Mertzios and
Reza Naserasr and
Aline Parreau and
Petru Valicov Identification, Location-Domination and
Metric Dimension on Interval and
Permutation Graphs. II. Algorithms and
Complexity . . . . . . . . . . . . . . . 914--944
Pavel Klavík and
Jan Kratochvíl and
Yota Otachi and
Toshiki Saitoh and
Tomás Vyskocil Extending Partial Representations of
Interval Graphs . . . . . . . . . . . . 945--967
K. Panagiotou and
L. Speidel Asynchronous Rumor Spreading on Random
Graphs . . . . . . . . . . . . . . . . . 968--989
Erin Chambers and
Alejandro Erickson and
Sándor P. Fekete and
Jonathan Lenchner and
Jeff Sember and
Venkatesh Srinivasan and
Ulrike Stege and
Svetlana Stolpner and
Christophe Weibel and
Sue Whitesides Connectivity Graphs of Uncertainty
Regions . . . . . . . . . . . . . . . . 990--1019
Hicham El-Zein and
Moshe Lewenstein and
J. Ian Munro and
Venkatesh Raman and
Timothy M. Chan On the Succinct Representation of
Equivalence Classes . . . . . . . . . . 1020--1040
Jiecao Chen and
Qin Zhang Improved Algorithms for Distributed
Entropy Monitoring . . . . . . . . . . . 1041--1066
Elliot Anshelevich and
Onkar Bhardwaj and
Martin Hoefer Stable Matching with Network
Externalities . . . . . . . . . . . . . 1067--1106
Nikhil Bansal and
Irene Finocchi Guest Editors' Foreword . . . . . . . . 1107--1108
Kyle Genova and
David P. Williamson An Experimental Evaluation of the
Best-of-Many Christofides' Algorithm for
the Traveling Salesman Problem . . . . . 1109--1130
Anna Großwendt and
Heiko Röglin Improved Analysis of Complete-Linkage
Clustering . . . . . . . . . . . . . . . 1131--1150
Daniel Graf How to Sort by Walking and Swapping on
Paths and Trees . . . . . . . . . . . . 1151--1181
Sreyash Kenkre and
Vinayaka Pandit and
Manish Purohit and
Rishi Saket On the Approximability of Digraph
Ordering . . . . . . . . . . . . . . . . 1182--1205
Éric Colin de Verdi\`ere Multicuts in Planar and Bounded-Genus
Graphs with Bounded Number of Terminals 1206--1224
Michael Dinitz and
Michael Schapira and
Asaf Valadarsky Explicit Expanding Expanders . . . . . . 1225--1245
Yossi Azar and
Oren Gilon Scheduling with Deadlines and Buffer
Management with Processing Requirements 1246--1262
Rasmus Pagh and
Ninh Pham and
Francesco Silvestri and
Morten Stöckel I/O-Efficient Similarity Join . . . . . 1263--1283
Thore Husfeldt and
Iyad Kanj Guest Editorial: Special Issue on
Parameterized and Exact Computation . . 1--2
Bart M. P. Jansen and
Astrid Pieterse Sparsification Upper and Lower Bounds
for Graph Problems and Not-All-Equal SAT 3--28
Ilario Bonacina and
Navid Talebanfard Strong ETH and Resolution via Games and
the Multiplicity of Strategies . . . . . 29--41
Hanna Sumita and
Naonori Kakimura and
Kazuhisa Makino Parameterized Complexity of Sparse
Linear Complementarity Problems . . . . 42--65
Mamadou Moustapha Kanté and
Eun Jung Kim and
O-joung Kwon and
Christophe Paul An FPT Algorithm and a Polynomial Kernel
for Linear Rankwidth-1 Vertex Deletion 66--95
Stefan Kratsch and
Manuel Sorge On Kernelization and Approximation for
the Vector Connectivity Problem . . . . 96--138
Jannis Bulian and
Anuj Dawar Fixed-Parameter Tractable Distances to
Sparse Graph Classes . . . . . . . . . . 139--158
Marthe Bonamy and
Lukasz Kowalik and
Michal Pilipczuk and
Arkadiusz Socala Linear Kernels for Outbranching Problems
in Sparse Digraphs . . . . . . . . . . . 159--188
Ondrej Suchý Extending the Kernel for Planar Steiner
Tree to the Number of Steiner Vertices 189--210
F. Barbero and
G. Gutin and
M. Jones and
B. Sheng Parameterized and Approximation
Algorithms for the Load Coloring Problem 211--229
Holger Dell and
Eun Jung Kim and
Michael Lampis and
Valia Mitsou and
Tobias Mömke Complexity and Approximability of
Parameterized MAX--CSPs . . . . . . . . 230--250
Eun Jung Kim and
O-Joung Kwon A Polynomial Kernel for Block Graph
Deletion . . . . . . . . . . . . . . . . 251--270
Sudeshna Kolay and
Daniel Lokshtanov and
Fahad Panolan and
Saket Saurabh Quick but Odd Growth of Cacti . . . . . 271--290
Kazuyuki Narisawa and
Hideharu Hiratsuka and
Shunsuke Inenaga and
Hideo Bannai and
Masayuki Takeda Efficient Computation of Substring
Equivalence Classes with Suffix Arrays 291--318
Lukás Folwarczný and
Jirí Sgall General Caching Is Hard: Even with Small
Pages . . . . . . . . . . . . . . . . . 319--339
Pankaj K. Agarwal and
Sariel Har-Peled and
Subhash Suri and
Hakan Yildiz and
Wuzhou Zhang Convex Hulls Under Uncertainty . . . . . 340--367
Amotz Bar-Noy and
Ben Baumer and
Dror Rawitz Set It and Forget It: Approximating the
Set Once Strip Cover Problem . . . . . . 368--386
Gregory Kucherov and
Yakov Nekrich Full-Fledged Real-Time Indexing for
Constant Size Alphabets . . . . . . . . 387--400
Michael A. Bekos and
Sabine Cornelsen and
Luca Grilli and
Seok-Hee Hong and
Michael Kaufmann On the Recognition of Fan-Planar and
Maximal Outer-Fan-Planar Graphs . . . . 401--427
Leszek Gasieniec and
Christos Levcopoulos and
Andrzej Lingas and
Rasmus Pagh and
Takeshi Tokuyama Efficiently Correcting Matrix Products 428--443
Michael A. Bekos and
Till Bruckdorfer and
Michael Kaufmann and
Chrysanthi N. Raftopoulou The Book Thickness of $1$-Planar Graphs
is Constant . . . . . . . . . . . . . . 444--465
Surender Baswana and
Shahbaz Khan Incremental Algorithm for Maintaining a
DFS Tree for Undirected Graphs . . . . . 466--483
Karl Bringmann and
Konstantinos Panagiotou Efficient Sampling Methods for Discrete
Distributions . . . . . . . . . . . . . 484--508
Stacey Jeffery and
Frederic Magniez and
Ronald de Wolf Optimal Parallel Quantum Query
Algorithms . . . . . . . . . . . . . . . 509--529
Jean-Daniel Boissonnat and
Karthik C. S. and
Sébastien Tavenas Building Efficient and Compact Data
Structures for Simplicial Complexes . . 530--567
Antonios Antoniadis and
Neal Barcelo and
Mario Consuegra and
Peter Kling and
Michael Nugent and
Kirk Pruhs and
Michele Scquizzato Efficient Computation of Optimal Energy
and Fractional Weighted Flow Trade-Off
Schedules . . . . . . . . . . . . . . . 568--597
Susanne Albers and
Matthias Hellwig On the Value of Job Migration in Online
Makespan Minimization . . . . . . . . . 598--623
Chia-Chen Wei and
Sun-Yuan Hsieh Random and Conditional $ (t,
k)$-Diagnosis of Hypercubes . . . . . . 625--644
Lior Kamma and
Robert Krauthgamer Metric Decompositions of Path-Separable
Graphs . . . . . . . . . . . . . . . . . 645--653
N. R. Aravind and
R. B. Sandeep and
Naveen Sivadasan On Polynomial Kernelization of $
\mathcal {H} $-free Edge Deletion . . . 654--666
Pradeesha Ashok and
Sudeshna Kolay and
Saket Saurabh Multivariate Complexity Analysis of
Geometric Red Blue Set Cover . . . . . . 667--697
Jaroslaw Blasiok and
Marcin Kami\'nski Chain Minors are FPT . . . . . . . . . . 698--707
Shiri Chechik and
M. P. Johnson and
Merav Parter and
David Peleg Secluded Connectivity Problems . . . . . 708--741
Stephen DeSalvo Exact Sampling Algorithms for Latin
Squares and Sudoku Matrices via
Probabilistic Divide-and-Conquer . . . . 742--762
Ferdinando Cicalese and
Eduardo Laber and
Aline Saettler Decision Trees for Function Evaluation:
Simultaneous Optimization of Worst and
Expected Cost . . . . . . . . . . . . . 763--796
Anonymous Editor's Note: Special Issue on
Combinatorial Pattern Matching . . . . . 797--797
Ivan Bliznets and
Fedor V. Fomin and
Petr A. Golovach and
Nikolay Karpov and
Alexander S. Kulikov and
Saket Saurabh Parameterized Complexity of Superstring
Problems . . . . . . . . . . . . . . . . 798--813
Tomasz Kociumaka and
Jakub Radoszewski and
Wojciech Rytter and
Tomasz Wale\'n String Powers in Trees . . . . . . . . . 814--834
Jozef Hales and
Alice Héliou and
Ján Manuch and
Yann Ponty and
Ladislav Stacho Combinatorial RNA Design: Designability
and Structure-Approximating Algorithm in
Watson--Crick and Nussinov--Jacobson
Energy Models . . . . . . . . . . . . . 835--856
Djamal Belazzougui and
Fabio Cunial A Framework for Space-Efficient String
Kernels . . . . . . . . . . . . . . . . 857--883
Khaled Elbassioni and
Kazuhisa Makino Guest Editors' Foreword . . . . . . . . 884--885
Aline Saettler and
Eduardo Laber and
Ferdinando Cicalese Trading Off Worst and Expected Cost in
Decision Tree Problems . . . . . . . . . 886--908
Sumedh Tirodkar and
Sundar Vishwanathan On the Approximability of the Minimum
Rainbow Subgraph Problem and Other
Related Problems . . . . . . . . . . . . 909--924
Jurek Czyzowicz and
Leszek Gasieniec and
Adrian Kosowski and
Evangelos Kranakis and
Danny Krizanc and
Najmeh Taleb When Patrolmen Become Corrupted:
Monitoring a Graph Using Faulty Mobile
Robots . . . . . . . . . . . . . . . . . 925--940
François Le Gall and
Shogo Nakajima Quantum Algorithm for Triangle Finding
in Sparse Graphs . . . . . . . . . . . . 941--959
Qin Huang and
Xingwu Liu and
Xiaoming Sun and
Jialin Zhang Partial Sorting Problem on Evolving Data 960--983
Juan A. Garay and
Rafail Ostrovsky Special Issue: Algorithmic Tools in
Cryptography . . . . . . . . . . . . . . 985--986
Oriol Farr\`as and
Torben Brandt Hansen and
Tarik Kaced and
Carles Padró On the Information Ratio of Non-perfect
Secret Sharing Schemes . . . . . . . . . 987--1013
Nir Bitansky and
Ran Canetti and
Yael Tauman Kalai and
Omer Paneth On Virtual Grey Box Obfuscation for
General Circuits . . . . . . . . . . . . 1014--1051
Per Austrin and
Kai-Min Chung and
Mohammad Mahmoody and
Rafael Pass and
Karn Seth On the Impossibility of Cryptography
with Tamperable Randomness . . . . . . . 1052--1101
Eli Ben-Sasson and
Alessandro Chiesa and
Eran Tromer and
Madars Virza Scalable Zero Knowledge Via Cycles of
Elliptic Curves . . . . . . . . . . . . 1102--1160
Itai Dinur and
Gaëtan Leurent Improved Generic Attacks Against
Hash-Based MACs and HAIFA . . . . . . . 1161--1195
Yevgeniy Dodis and
Adi Shamir and
Noah Stephens-Davidowitz and
Daniel Wichs How to Eat Your Entropy and Have it Too:
Optimal Recovery Strategies for
Compromised RNGs . . . . . . . . . . . . 1196--1232
Dan Boneh and
Mark Zhandry Multiparty Key Exchange, Efficient
Traitor Tracing, and More from
Indistinguishability Obfuscation . . . . 1233--1285
Takashi Yamakawa and
Shota Yamada and
Goichiro Hanaoka and
Noboru Kunihiro Self-Bilinear Map on Unknown Order
Groups from Indistinguishability
Obfuscation and Its Applications . . . . 1286--1317
San Ling and
Duong Hieu Phan and
Damien Stehlé and
Ron Steinfeld Hardness of $k$-LWE and Applications in
Traitor Tracing . . . . . . . . . . . . 1318--1352
Sanjam Garg and
Craig Gentry and
Shai Halevi and
Daniel Wichs On the Implausibility of
Differing-Inputs Obfuscation and
Extractable Witness Encryption with
Auxiliary Input . . . . . . . . . . . . 1353--1373
Franz J. Brandenburg Recognizing Optimal $1$-Planar Graphs in
Linear Time . . . . . . . . . . . . . . 1--28
Rémy Belmonte and
Yota Otachi and
Pascal Schweitzer Induced Minor Free Graphs: Isomorphism
and Clique-Width . . . . . . . . . . . . 29--47
Fidaa Abed and
Ioannis Caragiannis and
Alexandros A. Voudouris Near-Optimal Asymmetric Binary Matrix
Partitions . . . . . . . . . . . . . . . 48--72
K. T. Huber and
G. E. Scholz Beyond Representing Orthology Relations
by Trees . . . . . . . . . . . . . . . . 73--103
Victor Campos and
Ana Silva Edge-$b$-Coloring Trees . . . . . . . . 104--115
Eun Jung Kim and
Sang-il Oum and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos An FPT $2$-Approximation for Tree-Cut
Decomposition . . . . . . . . . . . . . 116--135
Peter Floderus and
Jesper Jansson and
Christos Levcopoulos and
Andrzej Lingas and
Dzmitry Sledneu $3$D Rectangulations and Geometric
Matrix Multiplication . . . . . . . . . 136--154
Martin Böhm and
György Dósa and
Leah Epstein and
Jirí Sgall and
Pavel Veselý Colored Bin Packing: Online Algorithms
and Lower Bounds . . . . . . . . . . . . 155--184
Ashwin Arulselvan and
Ágnes Cseh and
Martin Groß and
David F. Manlove and
Jannik Matuschke Matchings with Lower Quotas: Algorithms
and Complexity . . . . . . . . . . . . . 185--208
Frédéric Giroire and
Frédéric Havet and
Joanna Moulierac On the Complexity of Compressing Two
Dimensional Routing Tables with Order 209--233
Stefan Felsner and
Alexander Pilz Ham-Sandwich Cuts for Abstract Order
Types . . . . . . . . . . . . . . . . . 234--257
Ildikó Schlotter and
Katarína Cechlárová A Connection Between Sports and
Matroids: How Many Teams Can We Beat? 258--278
Sariel Har-Peled and
Nirman Kumar Robust Proximity Search for Balls Using
Sublinear Space . . . . . . . . . . . . 279--299
Ghurumuruhan Ganesan Stretch and Diameter in Random Geometric
Graphs . . . . . . . . . . . . . . . . . 300--330
Abram Magner and
Wojciech Szpankowski Profiles of PATRICIA Tries . . . . . . . 331--397
Peng Zhang and
Bin Fu and
Linqing Tang Simpler and Better Approximation
Algorithms for the Unweighted Minimum
Label $s$--$t$ Cut Problem . . . . . . . 398--409
Bert Besser and
Matthias Poloczek Erratum to: Greedy Matching: Guarantees
and Limitations . . . . . . . . . . . . 410--413
Martin Milanic and
Irena Penev and
Nicolas Trotignon Stable Sets in ISK4,wheel-Free Graphs 415--447
Anil Maheshwari and
Subhas C. Nandy and
Drimit Pattanayak and
Sasanka Roy and
Michiel Smid Geometric Path Problems with Violations 448--471
Boaz Farbstein and
Asaf Levin Discounted Reward TSP . . . . . . . . . 472--495
Carl Barton and
Solon P. Pissis Crochemore's Partitioning on Weighted
Strings and Applications . . . . . . . . 496--514
Mohammad Ali Abam Spanners for Geodesic Graphs and
Visibility Graphs . . . . . . . . . . . 515--529
Joseph Cheriyan and
Zhihan Gao Approximating (Unweighted) Tree
Augmentation via Lift-and-Project, Part
I: Stemless TAP . . . . . . . . . . . . 530--559
Gábor Ivanyos and
Marek Karpinski and
Miklos Santha and
Nitin Saxena and
Igor E. Shparlinski Polynomial Interpolation and Identity
Testing from High Powers Over Finite
Fields . . . . . . . . . . . . . . . . . 560--575
Baruch Schieber and
Hadas Shachnai and
Gal Tamir and
Tami Tamir A Theory and Algorithms for
Combinatorial Reoptimization . . . . . . 576--607
Joseph Cheriyan and
Zhihan Gao Approximating (Unweighted) Tree
Augmentation via Lift-and-Project,Part
II . . . . . . . . . . . . . . . . . . . 608--651
Vladimir Braverman and
Zaoxing Liu and
Tejasvam Singh and
N. V. Vinodchandran and
Lin F. Yang New Bounds for the CLIQUE--GAP Problem
Using Graph Decomposition Theory . . . . 652--667
Maryam Aliakbarpour and
Amartya Shankha Biswas and
Themis Gouleakis and
John Peebles and
Ronitt Rubinfeld and
Anak Yodpinyanee Sublinear-Time Algorithms for Counting
Star Subgraphs via Edge Sampling . . . . 668--697
Wing-Kai Hon and
Tak-Wah Lam and
Rahul Shah and
Sharma V. Thankachan and
Hing-Fung Ting and
Yilin Yang Dictionary Matching with a Bounded Gap
in Pattern or in Text . . . . . . . . . 698--713
Petr A. Golovach and
Pinar Heggernes and
Mamadou Moustapha Kanté and
Dieter Kratsch and
Sigve H. Sæther and
Yngve Villanger Output-Polynomial Enumeration on Graphs
of Bounded (Local) Linear MIM-Width . . 714--741
Eduard Eiben and
Robert Ganian and
Stefan Szeider Solving Problems on Graphs of High
Rank-Width . . . . . . . . . . . . . . . 742--771
Bhaskar Das Gupta and
Marek Karpinski and
Nasim Mobasheri and
Farzane Yahyanejad Effect of Gromov-Hyperbolicity Parameter
on Cuts and Expansions in Graphs and
Some Algorithmic Implications . . . . . 772--800
Chih-Hung Liu and
Sandro Montanari Minimizing the Diameter of a Spanning
Tree for Imprecise Points . . . . . . . 801--826
Evangelos Kranakis and
Gonzalo Navarro Guest Editorial: Special Issue on
Theoretical Informatics . . . . . . . . 827--829
Haim Kaplan and
Wolfgang Mulzer and
Liam Roditty and
Paul Seiferth Routing in Unit Disk Graphs . . . . . . 830--848
Merc\`e Claverol and
Elena Khramtcova and
Evanthia Papadopoulou and
Maria Saumell and
Carlos Seara Stabbing Circles for Sets of Segments in
the Plane . . . . . . . . . . . . . . . 849--884
Moses Ganardi and
Danny Hucke and
Markus Lohrey and
Eric Noeth Tree Compression Using String Grammars 885--917
Andreas Wiese Independent Set of Convex Polygons: From
$ n^\epsilon $ to $ 1 + \epsilon $ via
Shrinking . . . . . . . . . . . . . . . 918--934
Prosenjit Bose and
Darryl Hill and
Michiel Smid Improved Spanning Ratio for Low Degree
Plane Spanners . . . . . . . . . . . . . 935--976
David Eppstein and
Philipp Kindermann and
Stephen Kobourov and
Giuseppe Liotta and
Anna Lubiw and
Aude Maignan and
Debajyoti Mondal and
Hamideh Vosoughpour and
Sue Whitesides and
Stephen Wismath On the Planar Split Thickness of Graphs 977--994
Alice Paul and
Matthias Poloczek and
David P. Williamson Simple Approximation Algorithms for
Balanced MAX 2SAT . . . . . . . . . . . 995--1012
Marek Chrobak and
Kevin P. Costello Faster Information Gathering in Ad-Hoc
Radio Tree Networks . . . . . . . . . . 1013--1040
Cristina G. Fernandes and
Samuel P. de Paula and
Lehilton L. C. Pedrosa Improved Approximation Algorithms for
Capacitated Fault-Tolerant $k$-Center 1041--1072
Kamal Al-Bawani and
Matthias Englert and
Matthias Westermann Comparison-Based Buffer Management in
QoS Switches . . . . . . . . . . . . . . 1073--1092
Jaroslaw Byrka and
Thomas Pensyl and
Bartosz Rybicki and
Joachim Spoerhase and
Aravind Srinivasan and
Khoa Trinh An Improved Approximation Algorithm for
Knapsack Median Using Sparsification . . 1093--1114
George Christodoulou and
Alkmini Sgouritsa and
Bo Tang On the Efficiency of All-Pay Mechanisms 1115--1145
Fedor V. Fomin and
Mathieu Liedloff and
Pedro Montealegre and
Ioan Todinca Algorithms Parameterized by Vertex Cover
and Modular Width, Through Potential
Maximal Cliques . . . . . . . . . . . . 1146--1169
Aparna Das and
Krzysztof Fleszar and
Stephen Kobourov and
Joachim Spoerhase and
Sankar Veeramoni and
Alexander Wolff Approximating the Generalized Minimum
Manhattan Network Problem . . . . . . . 1170--1190
Wiebke Höhn and
Julián Mestre and
Andreas Wiese How Unsplittable-Flow-Covering Helps
Scheduling with Job-Dependent Cost
Functions . . . . . . . . . . . . . . . 1191--1213
Thomas Bläsius and
Annette Karrer and
Ignaz Rutter Simultaneous Embedding: Edge Orderings,
Relative Positions, Cutvertices . . . . 1214--1277
David Eppstein and
Daniel S. Hirschberg From Discrepancy to Majority . . . . . . 1278--1297
Ulrich Faigle and
Walter Kern and
Britta Peis Greedy Oriented Flows . . . . . . . . . 1298--1314
Xiaocheng Hu and
Yufei Tao and
Yi Yang and
Shuigeng Zhou Semi-Group Range Sum Revisited:
Query-Space Lower Bound Tightened . . . 1315--1329
Dimitris Chatzidimitriou and
Jean-Florent Raymond and
Ignasi Sau and
Dimitrios M. Thilikos An $ O(\log \mathrm {OPT})
$-Approximation for Covering and Packing
Minor Models of $ \theta_r $ . . . . . . 1330--1356
Klaus Jansen and
Kati Land and
Marten Maack Estimating the Makespan of the
Two-Valued Restricted Assignment Problem 1357--1382
Cameron Chalk and
Eric Martinez and
Robert Schweller and
Luis Vega and
Andrew Winslow and
Tim Wylie Optimal Staged Self-Assembly of General
Shapes . . . . . . . . . . . . . . . . . 1383--1409
Donglei Du and
Dachuan Xu Editorial: Special Issue on Computing
and Combinatorics . . . . . . . . . . . 1411--1411
Peng Zhang and
Yao Xu and
Tao Jiang and
Angsheng Li and
Guohui Lin and
Eiji Miyano Improved Approximation Algorithms for
the Maximum Happy Vertices and Edges
Problems . . . . . . . . . . . . . . . . 1412--1438
Anup Bhattacharya and
Davis Issac and
Ragesh Jaiswal and
Amit Kumar Sampling in Space Restricted Settings 1439--1458
Daniel König and
Markus Lohrey Evaluation of Circuits Over Nilpotent
and Polycyclic Groups . . . . . . . . . 1459--1492
Benjamin Niedermann and
Jan-Henrik Haunert An Algorithmic Framework for Labeling
Network Maps . . . . . . . . . . . . . . 1493--1533
Zhenbo Wang and
Xin Han and
György Dósa and
Zsolt Tuza A General Bin Packing Game: Interest
Taken into Account . . . . . . . . . . . 1534--1555
Shouwei Li and
Christine Markarian and
Friedhelm Meyer auf der Heide Towards Flexible Demands in Online
Leasing Problems . . . . . . . . . . . . 1556--1574
Timo Kötzing and
Dirk Sudholt Preface to the Special Issue on Theory
of Genetic and Evolutionary Computation 1575--1578
Carola Doerr and
Johannes Lengler The $ (1 + 1) $ Elitist Black-Box
Complexity of LeadingOnes . . . . . . . 1579--1603
Pietro S. Oliveto and
Tiago Paixão and
Jorge Pérez Heredia and
Dirk Sudholt and
Barbora Trubenová How to Escape Local Optima in Black Box
Optimisation: When Non-elitism
Outperforms Elitism . . . . . . . . . . 1604--1633
Andrei Lissovoi and
Carsten Witt The Impact of a Sparse Migration
Topology on the Runtime of Island Models
in Dynamic Optimization . . . . . . . . 1634--1657
Benjamin Doerr and
Carola Doerr Optimal Static and Self-Adjusting
Parameter Choices for the $ (1 +
(\lambda, \lambda)) $ Genetic Algorithm 1658--1709
Christian Gießen and
Carsten Witt Optimal Mutation Rates for the (1+ $
\lambda $ ) EA on OneMax Through
Asymptotically Tight Drift Analysis . . 1710--1731
Benjamin Doerr and
Carola Doerr and
Timo Kötzing Static and Self-Adjusting Mutation
Strengths for Multi-valued Decision
Variables . . . . . . . . . . . . . . . 1732--1768
Zaixin Lu and
Donghyun Kim Guest Editorial: Special Issue on
Combinatorial Optimization and
Applications . . . . . . . . . . . . . . 1769--1770
Mathias Weller and
Annie Chateau and
Clément Dallard and
Rodolphe Giroudeau Scaffolding Problems Revisited:
Complexity, Approximation and Fixed
Parameter Tractable Algorithms, and Some
Special Cases . . . . . . . . . . . . . 1771--1803
Gennaro Cordasco and
Luisa Gargano and
Marco Mecchia and
Adele A. Rescigno and
Ugo Vaccaro Discovering Small Target Sets in Social
Networks: A Fast and Effective Algorithm 1804--1833
Yuichi Asahiro and
Yuya Doi and
Eiji Miyano and
Kazuaki Samizo and
Hirotaka Shimizu Optimal Approximation Algorithms for
Maximum Distance-Bounded Subgraph
Problems . . . . . . . . . . . . . . . . 1834--1856
Jessica Enright and
Kitty Meeks Deleting Edges to Restrict the Size of
an Epidemic: A New Application for
Treewidth . . . . . . . . . . . . . . . 1857--1889
Cristina Bazgan and
Janka Chlebikova and
Thomas Pontoizeau Structural and Algorithmic Properties of
$2$-Community Structures . . . . . . . . 1890--1908
David Furcy and
Scott M. Summers Optimal Self-Assembly of Finite Shapes
at Temperature 1 in $3$D . . . . . . . . 1909--1963
Minghui Jiang Trees, Paths, Stars, Caterpillars and
Spiders . . . . . . . . . . . . . . . . 1964--1982
Travis Gagie and
Gonzalo Navarro Guest Editorial: Special Issue on
Compact Data Structures . . . . . . . . 1983--1985
Alberto Policriti and
Nicola Prezza LZ77 Computation Based on the Run-Length
Encoded BWT . . . . . . . . . . . . . . 1986--2011
Julian Arz and
Johannes Fischer Lempel--Ziv-78 Compressed String
Dictionaries . . . . . . . . . . . . . . 2012--2047
Johannes Fischer and
Tomohiro I and
Dominik Köppl and
Kunihiko Sadakane Lempel--Ziv Factorization Powered by
Space Efficient Suffix Trees . . . . . . 2048--2081
Markus Lohrey and
Sebastian Maneth and
Carl Philipp Reh Constant-Time Tree Traversal and Subtree
Equality Check for Grammar-Compressed
Trees . . . . . . . . . . . . . . . . . 2082--2105
Shahin Kamali Compact Representation of Graphs of
Small Clique-Width . . . . . . . . . . . 2106--2131
Seok-Hee Hong Editorial: Special Issue on Algorithms
and Computation . . . . . . . . . . . . 2132--2133
Yasushi Kawase and
Kazuhisa Makino and
Kento Seimi Optimal Composition Ordering Problems
for Piecewise Linear Functions . . . . . 2134--2159
Hans L. Bodlaender and
Hirotaka Ono and
Yota Otachi Degree-Constrained Orientation of
Maximum Satisfaction: Graph Classes and
Parameterized Complexity . . . . . . . . 2160--2180
T.-H. Hubert Chan and
Zhihao Gavin Tang and
Xiaowei Wu On $ (1, \epsilon)$-Restricted Max--Min
Fair Allocation Problem . . . . . . . . 2181--2200
Shahram Ghandeharizadeh and
Sandy Irani and
Jenny Lam The Subset Assignment Problem for Data
Placement in Caches . . . . . . . . . . 2201--2220
Samuel Fiorini and
R. Krithika and
N. S. Narayanaswamy and
Venkatesh Raman Approximability of Clique Transversal in
Perfect Graphs . . . . . . . . . . . . . 2221--2239
Magnus Bordewich and
Charles Semple and
Nihan Tokac Constructing Tree-Child Networks from
Distance Matrices . . . . . . . . . . . 2240--2259
Till Bruckdorfer and
Stefan Felsner and
Michael Kaufmann Planar Bus Graphs . . . . . . . . . . . 2260--2285
Steven Chaplick and
Grzegorz Gu\'spiel and
Grzegorz Gutowski and
Tomasz Krawczyk and
Giuseppe Liotta The Partial Visibility Representation
Extension Problem . . . . . . . . . . . 2286--2323
Thomas Bläsius and
Tobias Friedrich and
Anton Krohmer Cliques in Hyperbolic Random Graphs . . 2324--2344
Emilio Di Giacomo and
Walter Didimo and
William S. Evans and
Giuseppe Liotta and
Henk Meijer and
Fabrizio Montecchiani and
Stephen K. Wismath Ortho-polygon Visibility Representations
of Embedded Graphs . . . . . . . . . . . 2345--2383
Vadim E. Levit and
David Tankus Complexity Results for Generating
Subgraphs . . . . . . . . . . . . . . . 2384--2399
Rinat Ben-Avraham and
Matthias Henze and
Rafel Jaume and
Balázs Keszegh and
Orit E. Raz and
Micha Sharir and
Igor Tubis Partial-Matching RMS Distance Under
Translation: Combinatorics and
Algorithms . . . . . . . . . . . . . . . 2400--2421
Sander P. A. Alewijnse and
Kevin Buchin and
Maike Buchin and
Stef Sijben and
Michel A. Westenberg Model-Based Segmentation and
Classification of Trajectories . . . . . 2422--2452
Yun Deng and
David Fernández-Baca Fast Compatibility Testing for Rooted
Phylogenetic Trees . . . . . . . . . . . 2453--2477
Hiroshi Hirai and
Hiroyuki Namba Shortest $ (A + B) $-Path Packing Via
Hafnian . . . . . . . . . . . . . . . . 2478--2491
Christopher S. Martin and
Mohammad R. Salavatipour Minimizing Latency of Capacitated
$k$-Tours . . . . . . . . . . . . . . . 2492--2511
Fedor V. Fomin and
Saket Saurabh Preface to Special Issue Dedicated to
the 60th Birthday of Gregory Gutin . . . 2513--2515
Anonymous Editor's Note: Special Issue Dedicated
to the 60th Birthday of Gregory Gutin 2516--2516
Faisal N. Abu-Khzam and
Cristina Bazgan and
Katrin Casel and
Henning Fernau Clustering with Lower-Bounded Sizes . . 2517--2550
Sushmita Gupta and
Sanjukta Roy Stable Matching Games: Manipulation via
Subgraph Isomorphism . . . . . . . . . . 2551--2573
Michael Etscheid and
Matthias Mnich Linear Kernels and Linear-Time
Algorithms for Finding Large Cuts . . . 2574--2615
Aritra Banik and
Fahad Panolan and
Venkatesh Raman and
Vibha Sahlot Fréchet Distance Between a Line and
Avatar Point Set . . . . . . . . . . . . 2616--2636
R. Krithika and
Abhishek Sahu and
Prafullkumar Tale Dynamic Parameterized Problems . . . . . 2637--2655
Édouard Bonnet and
Tillmann Miltzow and
Pawel Rzazewski Complexity of Token Swapping and Its
Variants . . . . . . . . . . . . . . . . 2656--2682
Diptapriyo Majumdar and
Venkatesh Raman Structural Parameterizations of
Undirected Feedback Vertex Set: FPT
Algorithms and Kernelization . . . . . . 2683--2724
Atsuki Nagao and
Kazuhisa Seto and
Junichi Teruyama A Moderately Exponential Time Algorithm
for $k$-IBDD Satisfiability . . . . . . 2725--2741
Zahed Rahmati and
Timothy M. Chan A Clustering-Based Approach to Kinetic
Closest Pair . . . . . . . . . . . . . . 2742--2756
Syed M. Meesum and
Saket Saurabh Rank Reduction of Oriented Graphs by
Vertex and Edge Deletions . . . . . . . 2757--2776
Riley Murray and
Samir Khuller and
Megan Chao Scheduling Distributed Clusters of
Parallel Machines: Primal-Dual and
LP-based Approximation Algorithms . . . 2777--2798
Hassan AbouEisha and
Shahid Hussain and
Vadim Lozin and
Jérôme Monnot and
Bernard Ries and
Viktor Zamaraev Upper Domination: Towards a Dichotomy
Through Boundary Properties . . . . . . 2799--2817
Martijn van Ee and
René Sitters The A Priori Traveling Repairman Problem 2818--2833
Emile Ziedan and
Deepak Rajendraprasad and
Rogers Mathew and
Martin Charles Golumbic and
Jérémie Dusart The Induced Separation Dimension of a
Graph . . . . . . . . . . . . . . . . . 2834--2848
Benjamin Grimmer Dual-Based Approximation Algorithms for
Cut-Based Network Connectivity Problems 2849--2873
Uriel Feige and
Yael Hitron The Ordered Covering Problem . . . . . . 2874--2908
Bernhard Bliem and
Stefan Woltran Complexity of Secure Sets . . . . . . . 2909--2940
Tim Nonner Clique Clustering Yields a PTAS for
Max-Coloring Interval Graphs . . . . . . 2941--2956
Naoyuki Kamiyama A Note on Submodular Function
Minimization with Covering Type Linear
Constraints . . . . . . . . . . . . . . 2957--2971
Cristina G. Fernandes and
Rafael C. S. Schouery Approximation Algorithms for the
Max-Buying Problem with Limited Supply 2973--2992
Leo van Iersel and
Steven Kelk and
Georgios Stamoulis and
Leen Stougie and
Olivier Boes On Unrooted and Root-Uncertain Variants
of Several Well-Known Phylogenetic
Network Problems . . . . . . . . . . . . 2993--3022
Maitri Chakraborty and
Alessia Milani and
Miguel A. Mosteiro A Faster Exact-Counting Protocol for
Anonymous Dynamic Networks . . . . . . . 3023--3049
Paz Carmi and
Lilach Chaitman-Yerushalmi and
Ohad Trabelsi Bounded-Hop Communication Networks . . . 3050--3077
Vincenzo Auletta and
Diodato Ferraioli and
Francesco Pasquale and
Giuseppe Persiano Metastability of Logit Dynamics for
Coordination Games . . . . . . . . . . . 3078--3131
Endre Boros and
Khaled Elbassioni and
Mahmoud Fouz and
Vladimir Gurvich and
Kazuhisa Makino and
Bodo Manthey Approximation Schemes for Stochastic
Mean Payoff Games with Perfect
Information and Few Random Positions . . 3132--3157
Wenchang Luo and
Yao Xu and
Boyuan Gu and
Weitian Tong and
Randy Goebel and
Guohui Lin Algorithms for Communication Scheduling
in Data Gathering Network with Data
Compression . . . . . . . . . . . . . . 3158--3176
Ahmad Biniaz and
Prosenjit Bose and
David Eppstein and
Anil Maheshwari and
Pat Morin and
Michiel Smid Spanning Trees in Multipartite Geometric
Graphs . . . . . . . . . . . . . . . . . 3177--3191
Peyman Afshani and
Konstantinos Tsakalidis Optimal Deterministic Shallow Cuttings
for $3$-d Dominance Ranges . . . . . . . 3192--3206
Philip Bille and
Anders Roy Christiansen and
Patrick Hagge Cording and
Inge Li Gòrtz and
Frederik Rye Skjoldjensen and
Hjalte Wedel Vildhòj and
Sòren Vind Dynamic Relative Compression, Dynamic
Partial Sums, and Substring
Concatenation . . . . . . . . . . . . . 3207--3224
Alok Baveja and
Amit Chavan and
Andrei Nikiforov and
Aravind Srinivasan and
Pan Xu Improved Bounds in Stochastic Matching
and Optimization . . . . . . . . . . . . 3225--3252
Mark de Berg and
Joachim Gudmundsson and
Ali D. Mehrabi Finding Pairwise Intersections Inside a
Query Range . . . . . . . . . . . . . . 3253--3269
Takuro Fukunaga Approximation Algorithms for Highly
Connected Multi-dominating Sets in Unit
Disk Graphs . . . . . . . . . . . . . . 3270--3292
Joan Boyar and
Leah Epstein and
Lene M. Favrholdt and
Kim S. Larsen and
Asaf Levin Batch Coloring of Graphs . . . . . . . . 3293--3315
Boris Aronov and
Prosenjit Bose and
Erik D. Demaine and
Joachim Gudmundsson and
John Iacono and
Stefan Langerman and
Michiel Smid Data Structures for Halfplane Proximity
Queries and Incremental Voronoi Diagrams 3316--3334
Jiawei Qian and
Seeun William Umboh and
David P. Williamson Online Constrained Forest and
Prize-Collecting Network Design . . . . 3335--3364
Raphael Reitzig and
Sebastian Wild Building Fences Straight and High: An
Optimal Algorithm for Finding the
Maximum Length You Can Cut $k$ Times
from Given Sticks . . . . . . . . . . . 3365--3396
Karl Bringmann and
Tobias Friedrich and
Anton Krohmer De-anonymization of Heterogeneous Random
Graphs in Quasilinear Time . . . . . . . 3397--3427
Ildikó Schlotter and
Katarína Cechlárová Correction to: A Connection Between
Sports and Matroids: How Many Teams Can
We Beat? . . . . . . . . . . . . . . . . 3428--3430
Aline Saettler and
Eduardo Laber and
Ferdinando Cicalese Correction to: Trading Off Worst and
Expected Cost in Decision Tree Problems 3431--3436
Davide Bil\`o and
Luciano Gual\`a and
Stefano Leucci and
Guido Proietti Fault-Tolerant Approximate Shortest-Path
Trees . . . . . . . . . . . . . . . . . 3437--3460
Yasushi Kawase and
Atsushi Miyauchi The Densest Subgraph Problem with a
Convex/Concave Size Function . . . . . . 3461--3480
Pål Grònås Drange and
Micha\l Pilipczuk A Polynomial Kernel for Trivially
Perfect Editing . . . . . . . . . . . . 3481--3524
Carlo Comin and
Romeo Rizzi An Improved Upper Bound on Maximal
Clique Listing via Rectangular Fast
Matrix Multiplication . . . . . . . . . 3525--3562
Susanne Albers and
Dario Frascaria Quantifying Competitiveness in Paging
with Locality of Reference . . . . . . . 3563--3596
Pavel Dvorák and
Dusan Knop Parameterized Complexity of
Length-bounded Cuts and Multicuts . . . 3597--3617
Maria Chudnovsky and
Celina M. H. de Figueiredo and
Sophie Spirkl The Sandwich Problem for Decompositions
and Almost Monotone Properties . . . . . 3618--3645
Maurice Chandoo Canonical Representations for
Circular-Arc Graphs Using Flip Sets . . 3646--3672
Petra Berenbrink and
Tom Friedetzky and
Peter Kling and
Frederik Mallmann-Trenn and
Lars Nagel and
Chris Wastell Self-Stabilizing Balls and Bins in
Batches . . . . . . . . . . . . . . . . 3673--3703
Ali Dehghan and
Mohammad-Reza Sadeghi and
Arash Ahadi Not-All-Equal and $1$-in-Degree
Decompositions: Algorithmic Complexity
and Applications . . . . . . . . . . . . 3704--3727
Meng He and
J. Ian Munro and
Gelin Zhou Dynamic Path Queries in Linear Space . . 3728--3765
Amin Gheibi and
Anil Maheshwari and
Jörg-Rüdiger Sack and
Christian Scheffer Path Refinement in Weighted Regions . . 3766--3802
Facundo Mémoli and
Anastasios Sidiropoulos and
Vijay Sridhar Quasimetric Embeddings and Their
Applications . . . . . . . . . . . . . . 3803--3824
Imed Kacem and
Hans Kellerer Approximation Schemes for Minimizing the
Maximum Lateness on a Single Machine
with Release Times Under
Non-availability or Deadline Constraints 3825--3843
Saket Saurabh and
Meirav Zehavi $ (k, n - k)$-Max-Cut: An $ \mathcal
{O}^*(2^p)$-Time Algorithm and a
Polynomial Kernel . . . . . . . . . . . 3844--3860
Kamal Al-Bawani and
Matthias Englert and
Matthias Westermann Online Packet Scheduling for CIOQ and
Buffered Crossbar Switches . . . . . . . 3861--3888
Katherine Edwards and
W. Sean Kennedy and
Iraj Saniee Fast Approximation Algorithms for
$p$-Centers in Large $ \delta
$-Hyperbolic Graphs . . . . . . . . . . 3889--3907
Koyo Hayashi and
Satoru Iwata Counting Minimum Weight Arborescences 3908--3919
Eden Chlamtác and
Zachary Friggstad and
Konstantinos Georgiou Lift-and-Project Methods for Set Cover
and Knapsack . . . . . . . . . . . . . . 3920--3942
Andrzej Lingas and
Mia Persson Extreme Witnesses and Their Applications 3943--3957
Susanne Albers and
Achim Passen New Online Algorithms for Story
Scheduling in Web Advertising . . . . . 1--25
Neeldhara Misra and
Fahad Panolan and
Ashutosh Rai and
Venkatesh Raman and
Saket Saurabh Parameterized Algorithms for Max
Colorable Induced Subgraph Problem on
Perfect Graphs . . . . . . . . . . . . . 26--46
Amir Carmel and
Dekel Tsur and
Michal Ziv-Ukelson On Almost Monge All Scores Matrices . . 47--68
Therese Biedl and
Timothy M. Chan and
Stephanie Lee and
Saeed Mehrabi and
Fabrizio Montecchiani and
Hamideh Vosoughpour and
Ziting Yu Guarding Orthogonal Art Galleries with
Sliding $k$-Transmitters: Hardness and
Approximation . . . . . . . . . . . . . 69--97
Julien Lesca and
Michel Minoux and
Patrice Perny The Fair OWA One-to-One Assignment
Problem: NP-Hardness and Polynomial Time
Special Cases . . . . . . . . . . . . . 98--123
Eleftherios Anastasiadis and
Xiaotie Deng and
Piotr Krysta and
Minming Li and
Han Qiao and
Jinshan Zhang Network Pollution Games . . . . . . . . 124--166
Tomonari Kitahara and
Noriyoshi Sukegawa A Simple Projection Algorithm for Linear
Programming Problems . . . . . . . . . . 167--178
Harry Buhrman and
Leen Torenvliet and
Falk Unger and
Nikolay Vereshchagin Sparse Selfreducible Sets and Nonuniform
Lower Bounds . . . . . . . . . . . . . . 179--200
Robert Ganian and
Martin Kronegger and
Andreas Pfandler and
Alexandru Popa Parameterized Complexity of Asynchronous
Border Minimization . . . . . . . . . . 201--223
Cédric Bentz An FPT Algorithm for Planar Multicuts
with Sources and Sinks on the Outer Face 224--237
Yoann Dieudonné and
Andrzej Pelc Impact of Knowledge on Election Time in
Anonymous Networks . . . . . . . . . . . 238--288
Joseph S. B. Mitchell and
Valentin Polishchuk and
Mikko Sysikaski and
Haitao Wang An Optimal Algorithm for Minimum-Link
Rectilinear Paths in Triangulated
Rectilinear Domains . . . . . . . . . . 289--316
Evangelos Bampas and
Jurek Czyzowicz and
Leszek G\kasieniec and
David Ilcinkas and
Ralf Klasing and
Tomasz Kociumaka and
Dominik Paj\kak Linear Search by a Pair of
Distinct-Speed Robots . . . . . . . . . 317--342
Takehiro Ito and
Naonori Kakimura and
Naoyuki Kamiyama and
Yusuke Kobayashi and
Yoshio Okamoto Minimum-Cost $b$-Edge Dominating Sets on
Trees . . . . . . . . . . . . . . . . . 343--366
Marc Bury and
Elena Grigorescu and
Andrew McGregor and
Morteza Monemizadeh and
Chris Schwiegelshohn and
Sofya Vorotnikova and
Samson Zhou Structural Results on Matching
Estimation with Applications to
Streaming . . . . . . . . . . . . . . . 367--392
Danny Segev Assortment Planning with Nested
Preferences: Dynamic Programming with
Distributions as States? . . . . . . . . 393--417
Koyo Hayashi and
Satoru Iwata Correction to: Counting Minimum Weight
Arborescences . . . . . . . . . . . . . 418--418
Jiong Guo and
Danny Hermelin Foreword: Special Issue on Parameterized
and Exact Computation . . . . . . . . . 419--420
Gábor Bacsó and
Daniel Lokshtanov and
Dániel Marx and
Marcin Pilipczuk and
Zsolt Tuza and
Erik Jan van Leeuwen Subexponential-Time Algorithms for
Maximum Independent Set in $ P_t $-Free
and Broom-Free Graphs . . . . . . . . . 421--438
Serge Gaspers and
Joachim Gudmundsson and
Mitchell Jones and
Julián Mestre and
Stefan Rümmele Turbocharging Treewidth Heuristics . . . 439--475
Arne Meier and
Sebastian Ordyniak and
M. S. Ramanujan and
Irena Schindler Backdoors for Linear Temporal Logic . . 476--496
Micha\l W\lodarczyk Clifford Algebras Meet Tree
Decompositions . . . . . . . . . . . . . 497--518
Kitty Meeks Randomised Enumeration of Small
Witnesses Using a Decision Oracle . . . 519--540
Cornelius Brand and
Holger Dell and
Marc Roth Fine-Grained Dichotomies for the Tutte
Plane and Boolean #CSP . . . . . . . . . 541--556
Archontia C. Giannopoulou and
Micha\l Pilipczuk and
Jean-Florent Raymond and
Dimitrios M. Thilikos and
Marcin Wrochna Cutwidth: Obstructions and Algorithmic
Aspects . . . . . . . . . . . . . . . . 557--588
Carola Doerr and
Dirk Sudholt Preface to the Special Issue on Theory
of Genetic and Evolutionary Computation 589--592
Benjamin Doerr and
Christian Gießen and
Carsten Witt and
Jing Yang The $ (1 + \lambda) $ Evolutionary
Algorithm with Self-Adjusting Mutation
Rate . . . . . . . . . . . . . . . . . . 593--631
Carsten Witt Upper Bounds on the Running Time of the
Univariate Marginal Distribution
Algorithm on OneMax . . . . . . . . . . 632--667
Duc-Cuong Dang and
Per Kristian Lehre and
Phan Trung Hai Nguyen Level-Based Analysis of the Univariate
Marginal Distribution Algorithm . . . . 668--702
Benjamin Doerr and
Carola Doerr and
Timo Kötzing Solving Problems with Unknown Solution
Length at Almost No Extra Cost . . . . . 703--748
Chao Qian and
Chao Bian and
Wu Jiang and
Ke Tang Running Time Analysis of the $ (1 +
1)$-EA for OneMax and LeadingOnes Under
Bit-Wise Noise . . . . . . . . . . . . . 749--795
Tomás Gavenciak and
Barbara Geissmann and
Johannes Lengler Sorting by Swaps with Noisy Comparisons 796--827
Feng Shi and
Martin Schirneck and
Tobias Friedrich and
Timo Kötzing and
Frank Neumann Reoptimization Time Analysis of
Evolutionary Algorithms on Linear
Functions Under Dynamic Uniform
Constraints . . . . . . . . . . . . . . 828--857
Samadhi Nallaperuma and
Pietro S. Oliveto and
Jorge Pérez Heredia and
Dirk Sudholt On the Analysis of Trajectory-Based
Search Algorithms: When is it Beneficial
to Reject Improvements? . . . . . . . . 858--885
Benjamin Doerr and
Philipp Fischbeck and
Clemens Frahnow and
Tobias Friedrich and
Timo Kötzing and
Martin Schirneck Island Models Meet Rumor Spreading . . . 886--915
Marcin Pilipczuk and
Micha\l Pilipczuk and
Marcin Wrochna Edge Bipartization Faster than $ 2^k $ 917--966
Surender Baswana and
Keerti Choudhary and
Liam Roditty An Efficient Strongly Connected
Components Algorithm in the Fault
Tolerant Model . . . . . . . . . . . . . 967--985
Mathieu Liedloff and
Pedro Montealegre and
Ioan Todinca Beyond Classes of Graphs with ``Few''
Minimal Separators: FPT Results Through
Potential Maximal Cliques . . . . . . . 986--1005
Babak Behsaz and
Zachary Friggstad and
Mohammad R. Salavatipour and
Rohit Sivakumar Approximation Algorithms for Min-Sum
$k$-Clustering and Balanced $k$-Median 1006--1030
Andreas Emil Feldmann Fixed-Parameter Approximations for
$k$-Center Problems in Low Highway
Dimension Graphs . . . . . . . . . . . . 1031--1052
T. Karthick and
Frédéric Maffray and
Lucas Pastor Polynomial Cases for the Vertex Coloring
Problem . . . . . . . . . . . . . . . . 1053--1074
Zachary Friggstad and
Mohsen Rezapour and
Mohammad R. Salavatipour and
Jose A. Soto LP-Based Approximation Algorithms for
Facility Location in Buy-at-Bulk Network
Design . . . . . . . . . . . . . . . . . 1075--1095
Austin Halper and
Miguel A. Mosteiro and
Yulia Rossikova and
Prudence W. H. Wong Station Assignment with Reallocation . . 1096--1125
Yann Disser and
Stefan Kratsch and
Manuel Sorge The Minimum Feasible Tileset Problem . . 1126--1151
Spyros Angelopoulos and
Reza Dorrigiv and
Alejandro López-Ortiz On the Separation and Equivalence of
Paging Strategies and Other Online
Algorithms . . . . . . . . . . . . . . . 1152--1179
Frank Kammer and
Dieter Kratsch and
Moritz Laudahn Space-Efficient Biconnected Components
and Recognition of Outerplanar Graphs 1180--1204
Artur Czumaj and
Argyrios Deligkas and
Michail Fasoulakis and
John Fearnley and
Marcin Jurdzi\'nski and
Rahul Savani Distributed Methods for Computing
Approximate Equilibria . . . . . . . . . 1205--1231
Mourad Ba\"\iou and
Francisco Barahona Faster Algorithms for Security Games on
Matroids . . . . . . . . . . . . . . . . 1232--1246
Piotr Berman and
Meiram Murzabulatov and
Sofya Raskhodnikova The Power and Limitations of Uniform
Samples in Testing Properties of Figures 1247--1266
Fahad Panolan and
Saket Saurabh and
Meirav Zehavi Parameterized Algorithms for List
$K$-Cycle . . . . . . . . . . . . . . . 1267--1287
David G. Harris Deterministic Parallel Algorithms for
Bilinear Objective Functions . . . . . . 1288--1318
Luis Barba and
Jean Cardinal and
Matias Korman and
Stefan Langerman and
André van Renssen and
Marcel Roeloffzen and
Sander Verdonschot Dynamic Graph Coloring . . . . . . . . . 1319--1341
Marthe Bonamy and
Konrad K. Dabrowski and
Carl Feghali and
Matthew Johnson and
Daniël Paulusma Independent Feedback Vertex Set for $
P_5 $-Free Graphs . . . . . . . . . . . 1342--1369
Simon Gog and
Juha Kärkkäinen and
Dominik Kempa and
Matthias Petri and
Simon J. Puglisi Fixed Block Compression Boosting in
FM-Indexes: Theory and Practice . . . . 1370--1391
Prosenjit Bose and
Rolf Fagerberg and
André van Renssen and
Sander Verdonschot On Plane Constrained Bounded-Degree
Spanners . . . . . . . . . . . . . . . . 1392--1415
George B. Mertzios and
Othon Michail and
Paul G. Spirakis Temporal Network Optimization Subject to
Connectivity Constraints . . . . . . . . 1416--1449
Dirk Sudholt and
Carsten Witt On the Choice of the Update Strength in
Estimation-of-Distribution Algorithms
and Ant Colony Optimization . . . . . . 1450--1489
Pavel Klavík and
Yota Otachi and
Jirí Sejnoha On the Classes of Interval Graphs of
Limited Nesting and Count of Lengths . . 1490--1511
Ahmad Biniaz and
Prosenjit Bose and
Kimberly Crosbie and
Jean-Lou De Carufel and
David Eppstein and
Anil Maheshwari and
Michiel Smid Maximum Plane Trees in Multipartite
Geometric Graphs . . . . . . . . . . . . 1512--1534
Pietro Cenciarelli and
Daniele Gorla and
Ivano Salvo A Polynomial-Time Algorithm for
Detecting the Possibility of Braess
Paradox in Directed Graphs . . . . . . . 1535--1560
Michael J. Bannister and
William E. Devanny and
Vida Dujmovi\'c and
David Eppstein and
David R. Wood Track Layouts, Layered Path
Decompositions, and Leveled Planarity 1561--1583
Robert Bredereck and
Vincent Froese and
Marcel Koseler and
Marcelo Garlet Millani and
André Nichterlein and
Rolf Niedermeier A Parameterized Algorithmics Framework
for Degree Sequence Completion Problems
in Directed Graphs . . . . . . . . . . . 1584--1614
Valentin Garnero and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos Explicit Linear Kernels for Packing
Problems . . . . . . . . . . . . . . . . 1615--1656
E. Eiben and
R. Ganian and
K. Kangas and
S. Ordyniak Counting Linear Extensions:
Parameterizations by Treewidth . . . . . 1657--1683
Sushmita Gupta and
Sanjukta Roy and
Saket Saurabh and
Meirav Zehavi Parameterized Algorithms and Kernels for
Rainbow Matching . . . . . . . . . . . . 1684--1698
Clément Carbonnel and
David A. Cohen and
Martin C. Cooper and
Stanislav Zivný On Singleton Arc Consistency for CSPs
Defined by Monotone Patterns . . . . . . 1699--1727
Masoud Seddighin and
Majid Farhadi and
Mohammad Ghodsi and
Reza Alijani and
Ahmad S. Tajik Expand the Shares Together: Envy-Free
Mechanisms with a Small Number of Cuts 1728--1755
Argyrios Deligkas and
George B. Mertzios and
Paul G. Spirakis Binary Search in Graphs Revisited . . . 1757--1780
Niv Buchbinder and
Danny Segev and
Yevgeny Tkach Online Algorithms for Maximum
Cardinality Matching with Edge Arrivals 1781--1799
Mong-Jen Kao and
Hai-Lun Tu and
D. T. Lee $ O(f) $ Bi-criteria Approximation for
Capacitated Covering with Hard
Capacities . . . . . . . . . . . . . . . 1800--1817
Franz J. Brandenburg Characterizing and Recognizing $4$-Map
Graphs . . . . . . . . . . . . . . . . . 1818--1843
Viresh Patel and
Guus Regts Computing the Number of Induced Copies
of a Fixed Graph in a Bounded Degree
Graph . . . . . . . . . . . . . . . . . 1844--1858
Elisabet Burjons and
Dennis Komm and
Marcel Schöngens The $k$-Server Problem with Advice in
$d$ Dimensions and on the Sphere . . . . 1859--1880
Lena Schlipf and
Jens M. Schmidt Edge-Orders . . . . . . . . . . . . . . 1881--1900
A. Casteigts and
Y. Métivier and
J. M. Robson and
A. Zemmari Deterministic Leader Election Takes $
\Theta (D + \log n) $ Bit Rounds . . . . 1901--1920
Xiaocheng Hu and
Cheng Sheng and
Yufei Tao Building an Optimal Point-Location
Structure in $ O({\rm sort}(n)) $ I/Os 1921--1937
Joan Boyar and
Stephan J. Eidenbenz and
Lene M. Favrholdt and
Michal Kotrb\vc\'ìk and
Kim S. Larsen Online Dominating Set . . . . . . . . . 1938--1964
Zengfeng Huang and
Pan Peng Dynamic Graph Stream Algorithms in $
o(n) $ Space . . . . . . . . . . . . . . 1965--1987
Shay Golan and
Tsvi Kopelowitz and
Ely Porat Streaming Pattern Matching with $d$
Wildcards . . . . . . . . . . . . . . . 1988--2015
Till Fluschnik and
Christian Komusiewicz and
George B. Mertzios and
André Nichterlein and
Rolf Niedermeier and
Nimrod Talmon When Can Graph Hyperbolicity be Computed
in Linear Time? . . . . . . . . . . . . 2016--2045
Michael A. Bekos and
Henry Förster and
Michael Kaufmann On Smooth Orthogonal and Octilinear
Drawings: Relations, Complexity and
Kandinsky Drawings . . . . . . . . . . . 2046--2071
Ran Ben Basat and
Gil Einziger and
Roy Friedman and
Yaron Kassner Succinct Summing over Sliding Windows 2072--2091
Oguz Kaya and
Yves Robert Computing Dense Tensor Decompositions
with Optimal Dimension Trees . . . . . . 2092--2121
Amihood Amir and
Tsvi Kopelowitz and
Avivit Levy and
Seth Pettie and
Ely Porat and
B. Riva Shalom Mind the Gap! . . . . . . . . . . . . . 2123--2157
Tsuyoshi Ito and
Stacey Jeffery Approximate Span Programs . . . . . . . 2158--2195
Patrizio Angelini and
Michael A. Bekos Hierarchical Partial Planarity . . . . . 2196--2221
Zengfeng Huang and
Ke Yi and
Qin Zhang Randomized Algorithms for Tracking
Distributed Count, Frequencies, and
Ranks . . . . . . . . . . . . . . . . . 2222--2243
Ashwinkumar Badanidiyuru and
Shahar Dobzinski and
Sigal Oren Optimization with Demand Oracles . . . . 2244--2269
Ron Y. Pinter and
Hadas Shachnai and
Meirav Zehavi Improved Parameterized Algorithms for
Network Query Problems . . . . . . . . . 2270--2316
Cecilia Bohler and
Rolf Klein and
Chih-Hung Liu An Efficient Randomized Algorithm for
Higher-Order Abstract Voronoi Diagrams 2317--2345
Haitao Wang and
Jingru Zhang Covering Uncertain Points in a Tree . . 2346--2376
Khaled Elbassioni and
Kazuhisa Makino and
Waleed Najy A Multiplicative Weight Updates
Algorithm for Packing and Covering
Semi-infinite Linear Programs . . . . . 2377--2429
Danny Z. Chen and
Haitao Wang Computing $ L_1 $ Shortest Paths Among
Polygonal Obstacles in the Plane . . . . 2430--2483
Patrizio Angelini and
Giordano Da Lozzo Clustered Planarity with Pipes . . . . . 2484--2526
Patrizio Angelini and
Michael A. Bekos and
Giuseppe Liotta and
Fabrizio Montecchiani Universal Slope Sets for $1$-Bend Planar
Drawings . . . . . . . . . . . . . . . . 2527--2556
Ágnes Cseh and
Jannik Matuschke New and Simple Algorithms for Stable
Flow Problems . . . . . . . . . . . . . 2557--2591
Samir Khuller and
Sheng Yang Revisiting Connected Dominating Sets: An
Almost Optimal Local Information
Algorithm . . . . . . . . . . . . . . . 2592--2605
R. Ganian and
N. S. Narayanaswamy and
S. Ordyniak and
C. S. Rahul and
M. S. Ramanujan On the Complexity Landscape of Connected
$f$-Factor Problems . . . . . . . . . . 2606--2632
Tomasz Kociumaka and
Jakub Radoszewski and
Tatiana Starikovskaya Longest Common Substring with
Approximately $k$ Mismatches . . . . . . 2633--2652
Hugo Gilbert and
Olivier Spanjaard Optimizing a Generalized Gini Index in
Stable Marriage Problems: NP-Hardness,
Approximation and a Polynomial Time
Special Case . . . . . . . . . . . . . . 2653--2681
Kevin Buchin and
Irina Kostitsyna and
Maarten Löffler and
Rodrigo I. Silveira Region-Based Approximation of
Probability Distributions (for
Visibility Between Imprecise Points
Among Obstacles) . . . . . . . . . . . . 2682--2715
Pierre-Louis Giscard and
Nils Kriege and
Richard C. Wilson A General Purpose Algorithm for Counting
Simple Cycles and Simple Paths of Any
Length . . . . . . . . . . . . . . . . . 2716--2737
Florian Brandl and
Telikepalli Kavitha Two Problems in Max-Size Popular
Matchings . . . . . . . . . . . . . . . 2738--2764
K. Subramani and
Piotr Wojciechowki A Polynomial Time Algorithm for
Read-Once Certification of Linear
Infeasibility in UTVPI Constraints . . . 2765--2794
Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Paloma T. Lima and
Daniël Paulusma Algorithms for Outerplanar Graph Roots
and Graph Roots of Pathwidth at Most 402 2795--2828
Eunjin Oh and
Hee-Kap Ahn A New Balanced Subdivision of a Simple
Polygon for Time--Space Trade-Off
Algorithms . . . . . . . . . . . . . . . 2829--2856
Amihood Amir and
Avivit Levy and
Moshe Lewenstein and
Ronit Lubin and
Benny Porat Can We Recover the Cover? . . . . . . . 2857--2875
Shaojiang Wang and
Kun He and
Yicheng Pan and
Mingji Xia Rectangle Transformation Problem . . . . 2876--2898
Lucila M. S. Bento and
Davidson R. Boccardo and
Raphael C. S. Machado and
Vin\'ìcius G. Pereira de Sá and
Jayme L. Szwarcfiter Full Characterization of a Class of
Graphs Tailored for Software
Watermarking . . . . . . . . . . . . . . 2899--2916
Antonios Antoniadis and
Neal Barcelo and
Michael Nugent and
Kirk Pruhs and
Michele Scquizzato A $ o \left (n \right)$-Competitive
Deterministic Algorithm for Online
Matching on a Line . . . . . . . . . . . 2917--2933
Mark de Berg and
Hans L. Bodlaender and
Sándor Kisfaludi-Bak The Homogeneous Broadcast Problem in
Narrow and Wide Strips I: Algorithms . . 2934--2962
Mark de Berg and
Hans L. Bodlaender and
Sándor Kisfaludi-Bak The Homogeneous Broadcast Problem in
Narrow and Wide Strips II: Lower Bounds 2963--2990
Marvin Künnemann and
Daniel Moeller and
Ramamohan Paturi and
Stefan Schneider Subquadratic Algorithms for Succinct
Stable Matching . . . . . . . . . . . . 2991--3024
Ishai Kones and
Asaf Levin A Unified Framework for Designing EPTAS
for Load Balancing on Parallel Machines 3025--3046
Édouard Bonnet and
Pawe\l Rzazewski Optimality Program in Segment and String
Graphs . . . . . . . . . . . . . . . . . 3047--3073
Tomasz Kociumaka and
Jakub Radoszewski and
Tatiana Starikovskaya Correction to: Longest Common Substring
with Approximately $k$ Mismatches . . . 3074--3074
Timothy M. Chan and
Dimitrios Skrepetos Faster Approximate Diameter and Distance
Oracles in Planar Graphs . . . . . . . . 3075--3098
Mourad Ba\"\iou and
Francisco Barahona An Algorithm to Compute the Nucleolus of
Shortest Path Games . . . . . . . . . . 3099--3113
Robert Schweller and
Andrew Winslow and
Tim Wylie Nearly Constant Tile Complexity for any
Shape in Two-Handed Tile Assembly . . . 3114--3135
Yakov Babichenko and
Yuval Emek and
Michal Feldman and
Boaz Patt-Shamir and
Ron Peretz and
Rann Smorodinsky Stable Secretaries . . . . . . . . . . . 3136--3161
Tobias Maier and
Peter Sanders and
Stefan Walzer Dynamic Space Efficient Hashing . . . . 3162--3185
Maria Chudnovsky and
Oliver Schaudt and
Sophie Spirkl and
Maya Stein and
Mingxian Zhong Approximately Coloring Graphs Without
Long Induced Paths . . . . . . . . . . . 3186--3199
Rajesh Chitnis and
Andreas Emil Feldmann and
Ondrej Suchý A Tight Lower Bound for Planar Steiner
Orientation . . . . . . . . . . . . . . 3200--3216
Dmitriy Katz and
Baruch Schieber and
Hadas Shachnai Flexible Resource Allocation to Interval
Jobs . . . . . . . . . . . . . . . . . . 3217--3244
Pratish Datta and
Ratna Dutta and
Sourav Mukhopadhyay Constrained Pseudorandom Functions for
Turing Machines Revisited: How to
Achieve Verifiability and Key Delegation 3245--3390
Spyros Angelopoulos and
Giorgio Lucarelli and
Thang Nguyen Kim Primal-Dual and Dual-Fitting Analysis of
Online Scheduling Algorithms for
Generalized Flow-Time Problems . . . . . 3391--3421
Piotr Krysta and
David Manlove and
Baharak Rastegari and
Jinshan Zhang Size Versus Truthfulness in the House
Allocation Problem . . . . . . . . . . . 3422--3463
Emilio Di Giacomo and
Giuseppe Liotta and
Maurizio Patrignani and
Ignaz Rutter and
Alessandra Tappini NodeTrix Planarity Testing with Small
Clusters . . . . . . . . . . . . . . . . 3464--3493
Luis Barba and
Malte Milatz and
Jerri Nummenpalo and
Xiaoming Sun and
Antonis Thomas and
Jialin Zhang and
Zhijie Zhang The Complexity of Optimization on Grids 3494--3518
Timothy M. Chan and
John Hershberger and
Simon Pratt Two Approaches to Building Time-Windowed
Geometric Data Structures . . . . . . . 3519--3533
Guru Prakash Arumugam and
John Augustine and
Mordecai J. Golin and
Prashanth Srikanthan Minmax Regret $k$-Sink Location on a
Dynamic Path Network with Uniform
Capacities . . . . . . . . . . . . . . . 3534--3585
Geevarghese Philip and
Varun Rajan and
Saket Saurabh and
Prafullkumar Tale Subset Feedback Vertex Set in Chordal
and Split Graphs . . . . . . . . . . . . 3586--3629
Pawe\l Gawrychowski and
Oleg Merkurev and
Arseny M. Shur and
Przemys\law Uzna\'nski Tight Tradeoffs for Real-Time
Approximation of Longest Palindromes in
Streams . . . . . . . . . . . . . . . . 3630--3654
Tomasz Kociumaka and
Marcin Pilipczuk Deleting Vertices to Graphs of Bounded
Genus . . . . . . . . . . . . . . . . . 3655--3691
David Bryant and
Celine Scornavacca An $ O(n \log n) $ Time Algorithm for
Computing the Path-Length Distance
Between Trees . . . . . . . . . . . . . 3692--3706
Megha Khosla and
Avishek Anand A Faster Algorithm for Cuckoo Insertion
and Bipartite Matching in Large Graphs 3707--3724
Antonios Antoniadis and
Chien-Chung Huang and
Sebastian Ott A Fully Polynomial-Time Approximation
Scheme for Speed Scaling with a Sleep
State . . . . . . . . . . . . . . . . . 3725--3745
Kyle Fox and
Sungjin Im and
Janardhan Kulkarni and
Benjamin Moseley Non-clairvoyantly Scheduling to Minimize
Convex Functions . . . . . . . . . . . . 3746--3764
E. Fischer and
O. Lachish and
Y. Vasudev Improving and Extending the Testing of
Distributions for Shape-Restricted
Properties . . . . . . . . . . . . . . . 3765--3802
R. Krithika and
Abhishek Sahu and
Saket Saurabh and
Meirav Zehavi The Parameterized Complexity of Cycle
Packing: Indifference is Not an Issue 3803--3841
Anonymous Editor's Note: Special Issue on
Parameterized and Exact Computation . . 3843--3843
Radu Curticapean and
Holger Dell and
Fedor Fomin and
Leslie Ann Goldberg and
John Lapinskas A Fixed-Parameter Perspective on #BIS 3844--3864
Bart M. P. Jansen and
Astrid Pieterse Optimal Data Reduction for Graph
Coloring Using Low-Degree Polynomials 3865--3889
Édouard Bonnet and
Nick Brettell and
O-joung Kwon and
Dániel Marx Generalized Feedback Vertex Set Problems
on Bounded-Treewidth Graphs: Chordality
is the Key to Single-Exponential
Parameterized Algorithms . . . . . . . . 3890--3935
Bart M. P. Jansen and
Marcin Pilipczuk and
Marcin Wrochna Turing Kernelization for Finding Long
Paths in Graph Classes Excluding a
Topological Minor . . . . . . . . . . . 3936--3967
Lech Duraj and
Marvin Künnemann and
Adam Polak Tight Conditional Lower Bounds for
Longest Common Increasing Subsequence 3968--3992
Nikhil Bansal and
Parinya Chalermsook and
Bundit Laekhanukit and
Danupon Nanongkai and
Jesper Nederlof New Tools and Connections for
Exponential-Time Approximation . . . . . 3993--4009
Andreas Björklund and
Petteri Kaski and
Ryan Williams Generalized Kakeya sets for polynomial
evaluation and faster computation of
fermionants . . . . . . . . . . . . . . 4010--4028
Nikolai Karpov and
Marcin Pilipczuk and
Anna Zych-Pawlewicz An Exponential Lower Bound for Cut
Sparsifiers in Planar Graphs . . . . . . 4029--4042
Marin Bougeret and
Ignasi Sau How Much Does a Treedepth Modulator Help
to Obtain Polynomial Kernels Beyond
Sparse Graphs? . . . . . . . . . . . . . 4043--4068
Anonymous Preface: Special Issue on WADS 2017 . . 4069--4069
Sebastian Brandt and
Roger Wattenhofer Approximating Small Balanced Vertex
Separators in Almost Linear Time . . . . 4070--4097
Philip Dasler and
David M. Mount Modular Circulation and Applications to
Traffic Management . . . . . . . . . . . 4098--4117
Ziyun Huang and
Hu Ding and
Jinhui Xu A Faster Algorithm for Truth Discovery
via Range Cover . . . . . . . . . . . . 4118--4133
Klaus Jansen and
Marten Maack An EPTAS for Scheduling on Unrelated
Machines of Few Different Types . . . . 4134--4164
Yixin Cao and
Jianer Chen Preface to the Special Issue on
Computing and Combinatorics . . . . . . 4165--4166
Zhi-Zhong Chen and
Guohui Lin and
Lusheng Wang and
Yong Chen and
Dan Wang Approximation Algorithms for the Maximum
Weight Internal Spanning Tree Problem 4167--4199
Yuval Filmus and
Hamed Hatami and
Yaqiao Li and
Suzin You Information Complexity of the AND
Function in the Two-Party and
Multi-party Settings . . . . . . . . . . 4200--4237
Stanley P. Y. Fung Optimal Online Two-Way Trading with
Bounded Number of Transactions . . . . . 4238--4257
Hoang-Oanh Le and
Van Bang Le Hardness and Structural Results for
Half-Squares of Restricted Tree Convex
Bipartite Graphs . . . . . . . . . . . . 4258--4274
Sumedh Tirodkar and
Sundar Vishwanathan Maximum Matching on Trees in the Online
Preemptive and the Incremental Graph
Models . . . . . . . . . . . . . . . . . 4275--4292
Aritra Banik and
Fahad Panolan and
Venkatesh Raman and
Vibha Sahlot and
Saket Saurabh Parameterized Complexity of Geometric
Covering Problems Having Conflicts . . . 1--19
Matthew Johnson and
Giacomo Paesani and
Daniël Paulusma Connected Vertex Cover for $ (s P_1 +
P_5)$-Free Graphs . . . . . . . . . . . 20--40
Aritra Banik and
Pratibha Choudhary and
Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh A Polynomial Sized Kernel for Tracking
Paths Problem . . . . . . . . . . . . . 41--63
Brian Brubach and
Karthik A. Sankararaman and
Aravind Srinivasan and
Pan Xu Attenuate Locally, Win Globally:
Attenuation-Based Frameworks for Online
Stochastic Matching with Timeouts . . . 64--87
Siu-Wing Cheng and
Kai Jin and
Lie Yan Extensions of Self-Improving Sorters . . 88--106
Arnab Ganguly and
Rahul Shah and
Sharma V. Thankachan Succinct Non-overlapping Indexing . . . 107--117
Lars Jaffke and
O-joung Kwon and
Jan Arne Telle Mim-Width II. The Feedback Vertex Set
Problem . . . . . . . . . . . . . . . . 118--145
Johanna E. Preißer and
Jens M. Schmidt Computing Vertex-Disjoint Paths in Large
Graphs Using MAOs . . . . . . . . . . . 146--162
Yoshio Okamoto Guest Editorial: Selected Papers from
ISAAC 2017 . . . . . . . . . . . . . . . 163--164
Aaron T. Becker and
Sándor P. Fekete and
Phillip Keldenich and
Dominik Krupke and
Christian Rieck and
Christian Scheffer and
Arne Schmidt Tilt Assembly: Algorithms for
Micro-factories That Build Objects with
Uniform External Forces . . . . . . . . 165--187
Yu Yokoi Envy-Free Matchings with Lower Quotas 188--211
Nathann Cohen and
Fionn Mc Inerney and
Nicolas Nisse and
Stéphane Pérennes Study of a Combinatorial Game in Graphs
Through Linear Programming . . . . . . . 212--244
Edvin Berglin and
Gerth Stòlting Brodal A Simple Greedy Algorithm for Dynamic
Graph Orientation . . . . . . . . . . . 245--259
Michel Habib and
Lalla Mouatadid Maximum Induced Matching Algorithms via
Vertex Ordering Characterizations . . . 260--278
Davide Bil\`o and
Feliciano Colella and
Luciano Gual\`a and
Stefano Leucci and
Guido Proietti An Improved Algorithm for Computing All
the Best Swap Edges of a Tree Spanner 279--299
Vincenzo Bonifaci On the Convergence Time of a Natural
Dynamics for Linear Programming . . . . 300--315
J. Ian Munro and
Gonzalo Navarro and
Yakov Nekrich Fast Compressed Self-indexes with
Deterministic Linear-Time Construction 316--337
Casper Benjamin Freksen and
Kasper Green Larsen On Using Toeplitz and Circulant Matrices
for Johnson--Lindenstrauss Transforms 338--354
Therese Biedl and
Markus Chimani and
Martin Derka and
Petra Mutzel Crossing Number for Graphs with Bounded
Pathwidth . . . . . . . . . . . . . . . 355--384
James Allen Fill and
Mark Daniel Ward Special Issue on Analysis of Algorithms 385--385
Andrei Asinowski and
Axel Bacher and
Cyril Banderier and
Bernhard Gittenberger Analytic Combinatorics of Lattice Paths
with Forbidden Patterns, the Vectorial
Kernel Method, and Generating Functions
for Pushdown Automata . . . . . . . . . 386--428
Clemens Heuberger and
Daniel Krenn Asymptotic Analysis of Regular Sequences 429--508
Stefan Edelkamp and
Armin Weiß and
Sebastian Wild QuickXsort: A Fast Sorting Scheme in
Theory and Practice . . . . . . . . . . 509--588
Michael Albert and
Cecilia Holmgren and
Tony Johansson and
Fiona Skerman Embedding Small Digraphs and
Permutations in Binary Trees and Split
Trees . . . . . . . . . . . . . . . . . 589--615
Svante Janson Patterns in Random Permutations Avoiding
Some Sets of Multiple Patterns . . . . . 616--641
Dimbinaina Ralaivaosaona and
Matas Sileikis and
Stephan Wagner A Central Limit Theorem for Almost Local
Additive Tree Functionals . . . . . . . 642--679
Gerardo Berbeglia and
Gwenaël Joret Assortment Optimisation Under a General
Discrete Choice Model: A Tight Analysis
of Revenue-Ordered Assortments . . . . . 681--720
Stefan Dobrev and
Evangelos Kranakis and
Danny Krizanc and
Manuel Lafond and
Ján Ma\vnuch and
Lata Narayanan and
Jaroslav Opatrny and
Ladislav Stacho Weak Coverage of a Rectangular Barrier 721--746
Reut Levi and
Dana Ron and
Ronitt Rubinfeld Local Algorithms for Sparse Spanning
Graphs . . . . . . . . . . . . . . . . . 747--786
Tatsuya Matsuoka and
Shun Sato Making Bidirected Graphs Strongly
Connected . . . . . . . . . . . . . . . 787--807
Hu Ding and
Jinhui Xu A Unified Framework for Clustering
Constrained Data Without Locality
Property . . . . . . . . . . . . . . . . 808--852
Niels Grüttemeier and
Christian Komusiewicz On the Relation of Strong Triadic
Closure and Cluster Deletion . . . . . . 853--880
Sushmita Gupta and
Sanjukta Roy and
Saket Saurabh and
Meirav Zehavi Quadratic Vertex Kernel for Rainbow
Matching . . . . . . . . . . . . . . . . 881--897
V. Acuña and
R. Grossi and
G. F. Italiano and
L. Lima and
R. Rizzi and
G. Sacomoto and
M.-F. Sagot and
B. Sinaimeri On Bubble Generators in Directed Graphs 898--914
Chih-Hung Liu A Nearly Optimal Algorithm for the
Geodesic Voronoi Diagram of Points in a
Simple Polygon . . . . . . . . . . . . . 915--937
Marek Chrobak and
Christoph Dürr and
Aleksander Fabijan and
Bengt J. Nilsson Online Clique Clustering . . . . . . . . 938--965
Yijie Han Sorting Real Numbers in $ O \big (n
\sqrt {\log n} \big) $ Time and Linear
Space . . . . . . . . . . . . . . . . . 966--978
Yijie Han Correction to: Sorting Real Numbers in $
O \big (n \sqrt {\log n} \big) $ Time
and Linear Space . . . . . . . . . . . . 979--979
Titouan Carette and
Mathieu Lauri\`ere and
Frédéric Magniez Extended Learning Graphs for Triangle
Finding . . . . . . . . . . . . . . . . 980--1005
Chien-Chung Huang and
Naonori Kakimura and
Yuichi Yoshida Streaming Algorithms for Maximizing
Monotone Submodular Functions Under a
Knapsack Constraint . . . . . . . . . . 1006--1032
Torben Hagerup Space-Efficient DFS and Applications to
Connectivity Problems: Simpler, Leaner,
Faster . . . . . . . . . . . . . . . . . 1033--1056
Sayan Bhattacharya and
Deeparnab Chakrabarty and
Monika Henzinger Deterministic Dynamic Matching in $ O(1)
$ Update Time . . . . . . . . . . . . . 1057--1080
Boris Aronov and
Mark de Berg and
Aleksandar Markovic and
Gerhard Woeginger Non-Monochromatic and Conflict-Free
Colorings on Tree Spaces and Planar
Network Spaces . . . . . . . . . . . . . 1081--1100
Spyros Angelopoulos and
Marc P. Renault and
Pascal Schweitzer Stochastic Dominance and the Bijective
Ratio of Online Algorithms . . . . . . . 1101--1135
Matthias Mnich and
Ildikó Schlotter Stable Matchings with Covering
Constraints: A Complete Computational
Trichotomy . . . . . . . . . . . . . . . 1136--1188
Stefano Coniglio and
Nicola Gatti and
Alberto Marchesi Computing a Pessimistic Stackelberg
Equilibrium with Multiple Followers: The
Mixed--Pure Case . . . . . . . . . . . . 1189--1238
Torsten Mütze and
Jerri Nummenpalo A Constant-Time Algorithm for Middle
Levels Gray Codes . . . . . . . . . . . 1239--1258
Haim Kaplan and
Wolfgang Mulzer and
Liam Roditty and
Paul Seiferth Reachability Oracles for Directed
Transmission Graphs . . . . . . . . . . 1259--1276
Kohei Hayashi and
Yuichi Yoshida Testing Proximity to Subspaces:
Approximate $ \ell_\infty $ Minimization
in Constant Time . . . . . . . . . . . . 1277--1297
Peter Damaschke Dividing Splittable Goods Evenly and
With Limited Fragmentation . . . . . . . 1298--1328
David Avis and
Luc Devroye An Analysis of Budgeted Parallel Search
on Conditional Galton--Watson Trees . . 1329--1345
Takuya Takagi and
Shunsuke Inenaga and
Hiroki Arimura and
Dany Breslauer and
Diptarama Hendrian Fully-Online Suffix Tree and Directed
Acyclic Word Graph Construction for
Multiple Texts . . . . . . . . . . . . . 1346--1377
Laurent Bulteau and
Markus L. Schmid Consensus Strings with Small Maximum
Distance and Small Distance Sum . . . . 1378--1409
Haris Aziz and
Péter Biró and
Serge Gaspers and
Ronald de Haan and
Nicholas Mattei and
Baharak Rastegari Stable Matching with Uncertain Linear
Preferences . . . . . . . . . . . . . . 1410--1433
Eunjin Oh and
Luis Barba and
Hee-Kap Ahn The Geodesic Farthest-Point Voronoi
Diagram in a Simple Polygon . . . . . . 1434--1473
Jean Cardinal and
Jerri Nummenpalo and
Emo Welzl Solving and Sampling with Many Solutions 1474--1489
Moritz Baum and
Julian Dibbelt and
Thomas Pajor and
Jonas Sauer and
Dorothea Wagner and
Tobias Zündorf Energy-Optimal Routes for Battery
Electric Vehicles . . . . . . . . . . . 1490--1546
Alessio Conte and
Roberto Grossi and
Andrea Marino and
Luca Versari Sublinear-Space and Bounded-Delay
Algorithms for Maximal Clique
Enumeration in Graphs . . . . . . . . . 1547--1573
Guillaume Ducoffe and
Sylvain Legay and
Nicolas Nisse On the Complexity of Computing
Treebreadth . . . . . . . . . . . . . . 1574--1600
Charles Maske and
Jaime Cohen and
Elias P. Duarte Jr. Speeding Up the Gomory--Hu Parallel Cut
Tree Algorithm with Efficient Graph
Contractions . . . . . . . . . . . . . . 1601--1615
Júlio Araújo and
Victor A. Campos and
Ana Karolinna Maia and
Ignasi Sau and
Ana Silva On the Complexity of Finding Internally
Vertex-Disjoint Long Directed Paths . . 1616--1639
Nikhil Bansal and
Martin Böhm and
Marek Eliá\vs and
Grigorios Koumoutsos and
Seeun William Umboh Nested Convex Bodies are Chaseable . . . 1640--1653
Benjamin Bergougnoux and
Mamadou Moustapha Kanté and
O-joung Kwon An Optimal XP Algorithm for Hamiltonian
Cycle on Graphs of Bounded Clique-Width 1654--1674
Z. Avarikioti and
I. Z. Emiris and
L. Kavouras and
I. Psarros High-Dimensional Approximate $r$-Nets 1675--1702
Micha\l Pilipczuk and
Erik Jan van Leeuwen and
Andreas Wiese Quasi-Polynomial Time Approximation
Schemes for Packing and Covering
Problems in Planar Graphs . . . . . . . 1703--1739
Bhaskar DasGupta and
Mano Vikash Janardhanan and
Farzane Yahyanejad Why Did the Shape of Your Network
Change? (On Detecting Network Anomalies
via Non-local Curvatures) . . . . . . . 1741--1783
Saeed Akhoondian Amiri and
Klaus-Tycho Foerster and
Stefan Schmid Walking Through Waypoints . . . . . . . 1784--1812
John Hershberger and
Neeraj Kumar and
Subhash Suri Shortest Paths in the Plane with
Obstacle Violations . . . . . . . . . . 1813--1832
Tereza Klimosová and
Josef Malík and
Tomás Masarík and
Jana Novotná and
Daniël Paulusma and
Veronika Slívová Colouring $ (P_r + P_s) $-Free Graphs 1833--1858
Fedor V. Fomin and
Petr A. Golovach and
Torstein J. F. Stròmme and
Dimitrios M. Thilikos Subgraph Complementation . . . . . . . . 1859--1880
Andreas Gemsa and
Benjamin Niedermann and
Martin Nöllenburg Placing Labels in Road Maps: Algorithms
and Complexity . . . . . . . . . . . . . 1881--1908
Tesshu Hanaka and
Ioannis Katsikarelis and
Michael Lampis and
Yota Otachi and
Florian Sikora Parameterized Orientable Deletion . . . 1909--1938
Akanksha Agrawal and
Pallavi Jain and
Lawqueen Kanesh and
Saket Saurabh Parameterized Complexity of
Conflict-Free Matchings and Paths . . . 1939--1965
Keshav Goyal and
Tobias Mömke Robust Reoptimization of Steiner Trees 1966--1988
Andreas Emil Feldmann and
Dániel Marx The Parameterized Hardness of the
$k$-Center Problem in Transportation
Networks . . . . . . . . . . . . . . . . 1989--2005
Petr A. Golovach and
Pinar Heggernes and
Athanasios L. Konstantinidis and
Paloma T. Lima and
Charis Papadopoulos Parameterized Aspects of Strong Subgraph
Closure . . . . . . . . . . . . . . . . 2006--2038
Huang-Ting Chan and
Hsuan-Tsung Chiu and
Chang-Biau Yang and
Yung-Hsing Peng The Generalized Definitions of the
Two-Dimensional Largest Common
Substructure Problems . . . . . . . . . 2039--2062
Travis Gagie and
Meng He and
Gonzalo Navarro Compressed Dynamic Range Majority and
Minority Data Structures . . . . . . . . 2063--2086
Naoyuki Kamiyama The Distance-Constrained Matroid Median
Problem . . . . . . . . . . . . . . . . 2087--2106
Qian Li and
Xiaoming Sun and
Jialin Zhang On the Optimality of Tape Merge of Two
Lists with Similar Size . . . . . . . . 2107--2132
Andreas Gemsa and
Benjamin Niedermann and
Martin Nöllenburg A Unified Model and Algorithms for
Temporal Map Labeling . . . . . . . . . 2709--2736
Brian Brubach and
Karthik Abinav Sankararaman and
Pan Xu Online Stochastic Matching: New
Algorithms and Bounds . . . . . . . . . 2737--2783
Harel Yedidsion and
Stav Ashur and
Michael Segal Sensor Network Topology Design and
Analysis for Efficient Data Gathering by
a Mobile Mule . . . . . . . . . . . . . 2784--2808
Ching-Chi Lin and
Keng-Chu Ku and
Chan-Hung Hsu Paired-Domination Problem on
Distance-Hereditary Graphs . . . . . . . 2809--2840
Konrad K. Dabrowski and
Carl Feghali and
Pawe\l Rzazewski On Cycle Transversals and Their
Connected Variants in the Absence of a
Small Linear Forest . . . . . . . . . . 2841--2866
Julien Bensmail and
Dorian Mazauric and
Stéphane Pérennes Sequential Metric Dimension . . . . . . 2867--2901
Diptapriyo Majumdar and
M. S. Ramanujan and
Saket Saurabh On the Approximate Compressibility of
Connected Vertex Cover . . . . . . . . . 2902--2926
Argyrios Deligkas and
John Fearnley and
Paul Spirakis Lipschitz Continuity and Approximate
Equilibria . . . . . . . . . . . . . . . 2927--2954
Roland Glück and
Dominik Köppl Computational Aspects of Ordered Integer
Partitions with Bounds . . . . . . . . . 2955--2984
Giordano Da Lozzo and
Giuseppe Di Battista and
Vincenzo Roselli Upward Planar Morphs . . . . . . . . . . 2985--3017
Édouard Bonnet and
Sergio Cabello and
Hebert Pérez-Rosés The Inverse Voronoi Problem in Graphs I:
Hardness . . . . . . . . . . . . . . . . 3018--3040
An Zhang and
Yong Chen and
Guohui Lin Improved Approximation Algorithms for
Path Vertex Covers in Regular Graphs . . 3041--3064
Anonymous Special Issue on Computing and
Combinatorics . . . . . . . . . . . . . 3065--3065
Mingyu Xiao and
Hiroshi Nagamochi Characterizing Star-PCGs . . . . . . . . 3066--3090
Shi Li and
Jinhui Xu and
Minwei Ye Approximating Global Optimum for
Probabilistic Truth Discovery . . . . . 3091--3116
Feng Shi and
Martin Schirneck and
Frank Neumann Correction to: Reoptimization Time
Analysis of Evolutionary Algorithms on
Linear Functions Under Dynamic Uniform
Constraints . . . . . . . . . . . . . . 3117--3123
Yoad Zur and
Michael Segal Improved Solution to Data Gathering with
Mobile Mule . . . . . . . . . . . . . . 3125--3164
Gilad Kutiel and
Dror Rawitz Local Search Algorithms for the Maximum
Carpool Matching Problem . . . . . . . . 3165--3182
Monika Henzinger and
Dariusz Leniowski and
Claire Mathieu Dynamic Clustering to Minimize the Sum
of Radii . . . . . . . . . . . . . . . . 3183--3194
Dmitry Kosolobov and
Daniel Valenzuela and
Simon J. Puglisi Lempel--Ziv-Like Parsing in Small Space 3195--3215
Paulina Grzegorek and
Janusz Januszewski and
Lukasz Zielonka Efficient $1$-Space Bounded Hypercube
Packing Algorithm . . . . . . . . . . . 3216--3249
Sébastien Bouchard and
Yoann Dieudonné and
Franck Petit Deterministic Treasure Hunt in the Plane
with Angular Hints . . . . . . . . . . . 3250--3281
Radoslav Fulek Embedding Graphs into Embedded Graphs 3282--3305
Matti Karppa and
Petteri Kaski and
Padraig Ó Catháin Explicit Correlation Amplifiers for
Finding Outlier Correlations in
Deterministic Subquadratic Time . . . . 3306--3337
Ankit Chauhan and
Tobias Friedrich and
Ralf Rothenberger Greed is Good for Deterministic
Scale-Free Networks . . . . . . . . . . 3338--3389
Simone Faro and
Francesco Pio Marino and
Arianna Pavone Efficient Online String Matching Based
on Characters Distance Text Sampling . . 3390--3412
Zengfeng Huang and
Ke Yi and
Qin Zhang Correction to: Randomized Algorithms for
Tracking Distributed Count, Frequencies,
and Ranks . . . . . . . . . . . . . . . 3413--3413
Fu-Hong Liu and
Hsiang-Hsuan Liu and
Prudence W. H. Wong Non-preemptive Scheduling in a Smart
Grid Model and Its Implications on
Machine Minimization . . . . . . . . . . 3415--3457
Merav Parter and
David Peleg Fault Tolerant Approximate BFS
Structures with Additive Stretch . . . . 3458--3491
Gregor Matl and
Stanislav Zivný Using a Min-Cut Generalisation to Go
Beyond Boolean Surjective VCSPs . . . . 3492--3520
George B. Mertzios and
André Nichterlein and
Rolf Niedermeier The Power of Linear-Time Data Reduction
for Maximum Matching . . . . . . . . . . 3521--3565
Hans L. Bodlaender and
Tesshu Hanaka and
Tom C. van der Zanden Subgraph Isomorphism on Graph Classes
that Exclude a Substructure . . . . . . 3566--3587
Sarah Blind and
Kolja Knauer and
Petru Valicov Enumerating $k$-Arc-Connected
Orientations . . . . . . . . . . . . . . 3588--3603
Saba Ahmadi and
Samir Khuller and
Sheng Yang On Scheduling Coflows . . . . . . . . . 3604--3629
Christoph Dürr and
Thomas Erlebach and
Julie Meißner An Adversarial Model for Scheduling with
Testing . . . . . . . . . . . . . . . . 3630--3675
Dogan Corus and
Pietro S. Oliveto On the Benefits of Populations for the
Exploitation Speed of Standard
Steady-State Genetic Algorithms . . . . 3676--3706
Amihood Amir and
Panagiotis Charalampopoulos and
Jakub Radoszewski Dynamic and Internal Longest Common
Substring . . . . . . . . . . . . . . . 3707--3743
Christophe Paul and
Micha\l Pilipczuk Special Issue Dedicated to the 13th
International Symposium on Parameterized
and Exact Computation . . . . . . . . . 2133--2134
Stefan Kratsch and
Shaohua Li and
Magnus Wahlström Multi-budgeted Directed Cuts . . . . . . 2135--2155
Kustaa Kangas and
Mikko Koivisto and
Sami Salonen A Faster Tree-Decomposition Based
Algorithm for Counting Linear Extensions 2156--2173
Kitty Meeks and
Fiona Skerman The Parameterised Complexity of
Computing the Maximum Modularity of a
Graph . . . . . . . . . . . . . . . . . 2174--2199
Hubie Chen and
Bart M. P. Jansen and
Astrid Pieterse Best-Case and Worst-Case Sparsifiability
of Boolean CSPs . . . . . . . . . . . . 2200--2242
Florian Barbero and
Lucas Isenmann and
Jocelyn Thiebaut On the Distance Identifying Set
Meta-problem and Applications to the
Complexity of Identifying Problems on
Graphs . . . . . . . . . . . . . . . . . 2243--2266
Marc Roth and
Johannes Schmitt Counting Induced Subgraphs: A
Topological Approach to $ \# W[1]
$-hardness . . . . . . . . . . . . . . . 2267--2291
Karl Bringmann and
Thore Husfeldt and
Måns Magnusson Multivariate Analysis of Orthogonal
Range Searching and Graph Distances . . 2292--2315
Júlio Araújo and
Victor A. Campos and
Ana Silva Dual Parameterization of Weighted
Coloring . . . . . . . . . . . . . . . . 2316--2336
David Eppstein and
Elham Havvaei Parameterized Leaf Power Recognition via
Embedding into Graph Products . . . . . 2337--2359
Édouard Bonnet and
Nicolas Bousquet and
Rémi Watrigant Parameterized Complexity of Independent
Set in $H$-Free Graphs . . . . . . . . . 2360--2394
Manouchehr Zaker A New Vertex Coloring Heuristic and
Corresponding Chromatic Number . . . . . 2395--2414
Ziyun Huang and
Jinhui Xu An Efficient Sum Query Algorithm for
Distance-Based Locally Dominating
Functions . . . . . . . . . . . . . . . 2415--2431
Fedor V. Fomin and
Petr A. Golovach and
Jean-Florent Raymond On the Tractability of Optimization
Problems on $H$-Graphs . . . . . . . . . 2432--2473
Refael Hassin and
R. Ravi and
Danny Segev The Approximability of Multiple Facility
Location on Directed Networks with
Random Arc Failures . . . . . . . . . . 2474--2501
Yuichi Nagata and
Shinji Imahori An Efficient Exhaustive Search Algorithm
for the Escherization Problem . . . . . 2502--2534
Akira Matsubayashi A $ 3 + \Omega (1) $ Lower Bound for
Page Migration . . . . . . . . . . . . . 2535--2563
Jawaherul Md. Alam and
Michael A. Bekos and
Sergey Pupyrev Queue Layouts of Planar $3$-Trees . . . 2564--2585
Rémy Belmonte and
Tesshu Hanaka and
Yota Otachi Independent Set Reconfiguration
Parameterized by Modular-Width . . . . . 2586--2605
Zhao An and
Qilong Feng and
Ge Xia The Complexity of Tree Partitioning . . 2606--2643
Danny Hermelin and
George Manoussakis and
Liron Yedidsion Parameterized Multi-Scenario
Single-Machine Scheduling Problems . . . 2644--2667
Robert Chiang and
Kanstantsin Pashkovich On the Approximability of the Stable
Matching Problem with Ties of Size Two 2668--2686
Krzysztof Turowski and
Abram Magner and
Wojciech Szpankowski Compression of Dynamic Graphs Generated
by a Duplication Model . . . . . . . . . 2687--2707
Junjie Luo and
Hendrik Molter and
Rolf Niedermeier Parameterized Dynamic Cluster Editing 1--44
Mong-Jen Kao Iterative Partial Rounding for Vertex
Cover with Hard Capacities . . . . . . . 45--71
Céline Chevalier and
Fabien Laguillaumie and
Damien Vergnaud Privately Outsourcing Exponentiation to
a Single Server: Cryptanalysis and
Optimal Constructions . . . . . . . . . 72--115
Oswin Aichholzer and
Jean Cardinal and
Birgit Vogtenhuber Flip Distances Between Graph
Orientations . . . . . . . . . . . . . . 116--143
Jurek Czyzowicz and
Dariusz Dereniowski and
Andrzej Pelc Building a Nest by an Automaton . . . . 144--176
Amos Beimel and
Kobbi Nissim and
Uri Stemmer Learning Privately with Labeled and
Unlabeled Examples . . . . . . . . . . . 177--215
Maria Chudnovsky and
Shenwei Huang and
Mingxian Zhong List $3$-Coloring Graphs with No Induced
$ P_6 + r P_3$ . . . . . . . . . . . . . 216--251
Victor Chepoi and
Arnaud Labourel and
Sébastien Ratel Distance and Routing Labeling Schemes
for Cube-Free Median Graphs . . . . . . 252--296
Robert Ganian and
Fabian Klute and
Sebastian Ordyniak On Structural Parameterizations of the
Bounded-Degree Vertex Deletion Problem 297--336
Susanne Albers and
Sebastian Schraink Tight Bounds for Online Coloring of
Basic Graph Classes . . . . . . . . . . 337--360
Jeremy Kun and
Michael P. O'Brien and
Blair D. Sullivan Polynomial Treedepth Bounds in Linear
Colorings . . . . . . . . . . . . . . . 361--386
Sándor P. Fekete and
Robert Gmyr and
Arne Schmidt CADbots: Algorithmic Aspects of
Manipulating Programmable Matter with
Finite Automata . . . . . . . . . . . . 387--412
Santanu Bhowmick and
Tanmay Inamdar and
Kasturi Varadarajan Fault-Tolerant Covering Problems in
Metric Spaces . . . . . . . . . . . . . 413--446
Vittorio Bil\`o and
Marios Mavronicolas The Complexity of Computational Problems
About Nash Equilibria in Symmetric
Win-Lose Games . . . . . . . . . . . . . 447--530
Angel A. Cantu and
Austin Luchsinger and
Tim Wylie Covert Computation in Self-Assembled
Circuits . . . . . . . . . . . . . . . . 531--552
Zeev Nutov On the Tree Augmentation Problem . . . . 553--575
Ghurumuruhan Ganesan Constrained Minimum Passage Time in
Random Geometric Graphs . . . . . . . . 576--588
Myriam Preissmann and
Cléophée Robin and
Nicolas Trotignon On the Complexity of Colouring
Antiprismatic Graphs . . . . . . . . . . 589--612
Akira Matsubayashi Non-Greedy Online Steiner Trees on
Outerplanar Graphs . . . . . . . . . . . 613--640
Therese Biedl and
Saeed Mehrabi On Orthogonally Guarding Orthogonal
Polygons with Bounded Treewidth . . . . 641--666
Harry Buhrman and
Matthias Christandl and
Nikolay Vereshchagin High Entropy Random Selection Protocols 667--694
Diodato Ferraioli and
Carmine Ventre Approximation Guarantee of OSP
Mechanisms: The Case of Machine
Scheduling and Facility Location . . . . 695--725
Robert Ganian and
Sebastian Ordyniak The Power of Cut-Based Parameters for
Computing Edge-Disjoint Paths . . . . . 726--752
Akanksha Agrawal and
Fahad Panolan and
Meirav Zehavi Simultaneous Feedback Edge Set: A
Parameterized Perspective . . . . . . . 753--774
Zachary Friggstad and
Jörg-Rüdiger Sack and
Mohammad R. Salavatipour Special Issue on Algorithms and Data
Structures (WADS 2019) . . . . . . . . . 775--775
Hüseyin Acan and
Sankardeep Chakraborty and
Srinivasa Rao Satti Succinct Encodings for Families of
Interval Graphs . . . . . . . . . . . . 776--794
Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen Online Bin Covering with Advice . . . . 795--821
Marthe Bonamy and
Nicolas Bousquet and
Théo Pierron Graph Isomorphism for $ (H_1, H_2)
$-Free Graphs: an Almost Complete
Dichotomy . . . . . . . . . . . . . . . 822--852
Moran Feldman Guess Free Maximization of Submodular
and Linear Sums . . . . . . . . . . . . 853--878
Chien-Chung Huang and
Naonori Kakimura Improved Streaming Algorithms for
Maximizing Monotone Submodular Functions
under a Knapsack Constraint . . . . . . 879--902
Anne Auger and
Per Kristian Lehre Preface to the Special Issue on Theory
of Genetic and Evolutionary Computation 903--905
Feng Shi and
Frank Neumann and
Jianxin Wang Runtime Performances of Randomized
Search Heuristics for the Dynamic
Weighted Vertex Cover Problem . . . . . 906--939
Chao Qian and
Chao Bian and
Xin Yao Analysis of Noisy Evolutionary
Optimization When Sampling Fails . . . . 940--975
Dirk Sudholt Analysing the Robustness of Evolutionary
Algorithms to Noise: Refined Runtime
Bounds and an Example Where Noise is
Beneficial . . . . . . . . . . . . . . . 976--1011
Benjamin Doerr and
Carsten Witt and
Jing Yang Runtime Analysis for Self-adaptive
Mutation Rates . . . . . . . . . . . . . 1012--1053
Denis Antipov and
Benjamin Doerr A Tight Runtime Analysis for the $ (\mu
+ \lambda) $ EA . . . . . . . . . . . . 1054--1095
Johannes Lengler and
Dirk Sudholt and
Carsten Witt The Complex Parameter Landscape of the
Compact Genetic Algorithm . . . . . . . 1096--1137
Andrew M. Sutton Fixed-Parameter Tractability of
Crossover: Steady-State GAs on the
Closest String Problem . . . . . . . . . 1138--1163
Édouard Bonnet and
Sergio Cabello and
Hebert Pérez-Rosés The Inverse Voronoi Problem in Graphs
II: Trees . . . . . . . . . . . . . . . 1165--1200
Benjamin Bergougnoux and
Eduard Eiben and
M. S. Ramanujan Towards a Polynomial Kernel for Directed
Feedback Vertex Set . . . . . . . . . . 1201--1221
Stefano Leonardi and
Gianpiero Monaco and
Qiang Zhang Budget Feasible Mechanisms on Matroids 1222--1237
Chi-Yeh Chen and
Sun-Yuan Hsieh and
Sheng-Lung Peng Matching Cut in Graphs with Large
Minimum Degree . . . . . . . . . . . . . 1238--1255
Marios Mavronicolas and
Loizos Michael and
Paul G. Spirakis The Price of Defense . . . . . . . . . . 1256--1315
Hugo A. Akitaya and
Esther M. Arkin and
Vera Sacristán Universal Reconfiguration of
Facet-Connected Modular Robots by
Pivots: The $ O(1) $ Musketeers . . . . 1316--1351
Yann Disser and
Andreas Emil Feldmann and
Jochen Könemann Travelling on Graphs with Small Highway
Dimension . . . . . . . . . . . . . . . 1352--1370
Marc Bury and
Michele Gentili and
Mara Sorella Polynomial Time Approximation Schemes
for All $1$-Center Problems on Metric
Rational Set Similarities . . . . . . . 1371--1392
Stéphane Bessy and
Marin Bougeret and
Meirav Zehavi Packing Arc-Disjoint Cycles in
Tournaments . . . . . . . . . . . . . . 1393--1420
Gabriel L. Duarte and
Hiroshi Eto and
Uéverton S. Souza Computing the Largest Bond and the
Maximum Connected Cut of a Graph . . . . 1421--1458
Fionn Mc Inerney and
Nicolas Nisse and
Stéphane Pérennes Eternal Domination: $D$-Dimensional
Cartesian and Strong Grids and
Everything in Between . . . . . . . . . 1459--1492
Ágnes Cseh and
Telikepalli Kavitha Popular Matchings in Complete Graphs . . 1493--1523
Erik D. Demaine and
Yamming Huang and
Kunihiko Sadakane Approximating the Canadian Traveller
Problem with Online Randomization . . . 1524--1543
Pat Morin A Fast Algorithm for the Product
Structure of Planar Graphs . . . . . . . 1544--1558
Britta Dorn and
Ronald de Haan and
Ildikó Schlotter Obtaining a Proportional Allocation by
Deleting Items . . . . . . . . . . . . . 1559--1603
Robert Ganian and
Sebastian Ordyniak and
M. S. Ramanujan On Structural Parameterizations of the
Edge Disjoint Paths Problem . . . . . . 1605--1637
Jie Zhang Average-Case Approximation Ratio of
Scheduling without Payments . . . . . . 1638--1652
Yasushi Kawase and
Kei Kimura and
Hanna Sumita Optimal Matroid Partitioning Problems 1653--1676
Guilherme C. M. Gomes and
Ignasi Sau Finding Cuts of Bounded Degree:
Complexity, FPT and Exact Algorithms,
and Kernelization . . . . . . . . . . . 1677--1706
Djamal Belazzougui and
Travis Gagie and
Yakov Nekrich Range Majorities and Minorities in
Arrays . . . . . . . . . . . . . . . . . 1707--1733
Alexander Grigoriev and
Tim A. Hartmann and
Gerhard J. Woeginger Dispersing Obnoxious Facilities on a
Graph . . . . . . . . . . . . . . . . . 1734--1749
Susanne Albers and
Arindam Khan and
Leon Ladewig Improved Online Algorithms for Knapsack
and GAP in the Random Order Model . . . 1750--1785
Jesper Jansson and
Konstantinos Mampentzidis and
Wing-Kin Sung Computing the Rooted Triplet Distance
Between Phylogenetic Networks . . . . . 1786--1828
Marc Roth Parameterized Counting of Partially
Injective Homomorphisms . . . . . . . . 1829--1860
Jayakrishnan Madathil and
Roohani Sharma and
Meirav Zehavi A Sub-exponential FPT Algorithm and a
Polynomial Kernel for Minimum Directed
Bisection on Semicomplete Digraphs . . . 1861--1884
Sariel Har-Peled and
Mitchell Jones and
Saladi Rahul Active-Learning a Convex Body in Low
Dimensions . . . . . . . . . . . . . . . 1885--1917
José A. Soto and
Claudio Telha Independent Sets and Hitting Sets of
Bicolored Rectangular Families . . . . . 1918--1952
Shu Zhang and
Daming Zhu and
Xiaowen Liu Sorting a Permutation by Best Short
Swaps . . . . . . . . . . . . . . . . . 1953--1979
Kook Jin Ahn and
Graham Cormode and
Anthony Wirth Correlation Clustering in Data Streams 1980--2017
Athanasios L. Konstantinidis and
Charis Papadopoulos Cluster Deletion on Interval Graphs and
Split Related Graphs . . . . . . . . . . 2018--2046
János Balogh and
József Békési and
Asaf Levin A New Lower Bound for Classic Online Bin
Packing . . . . . . . . . . . . . . . . 2047--2062
Tom Davot and
Annie Chateau and
Dorine Tabary Producing Genomic Sequences after Genome
Scaffolding with Ambiguous Paths:
Complexity, Approximation and Lower
Bounds . . . . . . . . . . . . . . . . . 2063--2095
Eun Jung Kim and
O-joung Kwon A Polynomial Kernel for
Distance-Hereditary Vertex Deletion . . 2096--2141
Panagiotis Charalampopoulos and
Tomasz Kociumaka and
Tomasz Wale'n Internal Dictionary Matching . . . . . . 2142--2169
Fedor V. Fomin and
Petr A. Golovach Subexponential Parameterized Algorithms
and Kernelization on Almost Chordal
Graphs . . . . . . . . . . . . . . . . . 2170--2214
Laurent Feuilloley and
Pierre Fraigniaud and
Ioan Todinca Compact Distributed Certification of
Planar Graphs . . . . . . . . . . . . . 2215--2244
Gill Barequet and
Minati De and
Michael T. Goodrich Convex-Straight-Skeleton Voronoi
Diagrams for Segments and Convex
Polygons . . . . . . . . . . . . . . . . 2245--2272
Ahmad Biniaz and
Sergio Cabello and
Michiel Smid On the Minimum Consistent Subset Problem 2273--2302
Arindam Biswas and
Venkatesh Raman and
Saket Saurabh Approximation in (Poly-) Logarithmic
Space . . . . . . . . . . . . . . . . . 2303--2331
Florian Hörsch and
Zoltán Szigeti The $ (2, k)$-Connectivity Augmentation
Problem: Algorithmic Aspects . . . . . . 2333--2350
Rémy Belmonte and
Ignasi Sau On the Complexity of Finding Large Odd
Induced Subgraphs and Odd Colorings . . 2351--2373
Evripidis Bampis and
Bruno Escoffier and
Alexandre Teiller Online Multistage Subset Maximization
Problems . . . . . . . . . . . . . . . . 2374--2399
Douglas S. Gonçalves and
Carlile Lavor and
Michael Souza A New Algorithm for the $^K$DMDGP
Subclass of Distance Geometry Problems
with Exact Distances . . . . . . . . . . 2400--2426
Karthekeyan Chandrasekaran and
Elena Grigorescu and
Minshen Zhu The Maximum Binary Tree Problem . . . . 2427--2468
Bart M. P. Jansen and
Jan Arne Telle Special Issue Dedicated to the 14th
International Symposium on Parameterized
and Exact Computation . . . . . . . . . 2469--2470
Giordano Da Lozzo and
David Eppstein and
Siddharth Gupta C-Planarity Testing of Embedded
Clustered Graphs with Bounded Dual
Carving-Width . . . . . . . . . . . . . 2471--2502
Yoichi Iwata and
Yusuke Kobayashi Improved Analysis of Highest-Degree
Branching for Feedback Vertex Set . . . 2503--2520
Gregory Rosenthal Beating Treewidth for Average-Case
Subgraph Isomorphism . . . . . . . . . . 2521--2551
Benjamin Aram Berendsohn and
László Kozma and
Dániel Marx Finding and Counting Permutations via
CSPs . . . . . . . . . . . . . . . . . . 2552--2577
Marco Bressan Faster algorithms for counting subgraphs
in sparse graphs . . . . . . . . . . . . 2578--2605
Édouard Bonnet and
Nidhi Purohit Metric Dimension Parameterized By
Treewidth . . . . . . . . . . . . . . . 2606--2633
Jana Novotná and
Karolina Okrasa and
Bartosz Walczak Subexponential-Time Algorithms for
Finding Large Induced Sparse Subgraphs 2634--2650
Florent Foucaud and
Benjamin Gras and
Florian Sikora On the Complexity of Broadcast
Domination and Multipacking in Digraphs 2651--2677
Koki Hamada and
Shuichi Miyazaki and
Kazuya Okamoto Strongly Stable and Maximum Weakly
Stable Noncrossing Matchings . . . . . . 2678--2696
Toru Hasunuma Connectivity Keeping Trees in
2-Connected Graphs with Girth Conditions 2697--2718
Li-Hsuan Chen and
Ling-Ju Hung and
Peter Rossmanith Online Node- and Edge-Deletion Problems
with Advice . . . . . . . . . . . . . . 2719--2753
Arnaud Casteigts and
Anne-Sophie Himmel and
Philipp Zschoche Finding Temporal Paths Under Waiting
Time Constraints . . . . . . . . . . . . 2754--2802
Susanne Albers and
Maximilian Janke Scheduling in the Random-Order Model . . 2803--2832
Susanne Albers and
Arindam Khan and
Leon Ladewig Best Fit Bin Packing with Random Order
Revisited . . . . . . . . . . . . . . . 2833--2858
Iqra Altaf Gillani and
Amitabha Bagchi A Queueing Network-Based Distributed
Laplacian Solver . . . . . . . . . . . . 2859--2894
Yiannis Giannakopoulos and
Alexander Hammerl and
Diogo Poças A New Lower Bound for Deterministic
Truthful Scheduling . . . . . . . . . . 2895--2913
Valentin Bartier and
Nicolas Bousquet and
Amer E. Mouawad On Girth and the Parameterized
Complexity of Token Sliding and Token
Jumping . . . . . . . . . . . . . . . . 2914--2951
Leah Epstein and
Elena Kleiman Selfish Vector Packing . . . . . . . . . 2952--2988
Dror Rawitz and
Adi Rosén Online Budgeted Maximum Coverage . . . . 2989--3014
Anonymous Editor's Note: Special Issue on Genetic
and Evolutionary Computation . . . . . . 3015--3016
Benjamin Doerr and
Timo Kötzing Multiplicative Up-Drift . . . . . . . . 3017--3058
Benjamin Doerr The Runtime of the Compact Genetic
Algorithm on Jump Functions . . . . . . 3059--3107
Benjamin Doerr and
Carola Doerr and
Johannes Lengler Self-Adjusting Mutation Rates with
Provably Optimal Success Rules . . . . . 3108--3147
Jakob Bossek and
Frank Neumann and
Dirk Sudholt Time Complexity Analysis of Randomized
Search Heuristics for the Dynamic Graph
Coloring Problem . . . . . . . . . . . . 3148--3179
Andrew M. Sutton and
Carsten Witt Lower Bounds on the Runtime of
Crossover-Based Algorithms via
Decoupling and Family Graphs . . . . . . 3180--3208
Frank Neumann and
Mojgan Pourhassan and
Carsten Witt Improved Runtime Results for Simple
Randomised Search Heuristics on Linear
Functions with a Uniform Constraint . . 3209--3237
Per Kristian Lehre and
Phan Trung Hai Nguyen Runtime Analyses of the Population-Based
Univariate Estimation of Distribution
Algorithms on \sc LeadingOnes . . . . . 3238--3280
Steven Chaplick and
Martin Töpfer and
Peter Zeman On $H$-Topological Intersection Graphs 3281--3318
Michael Elkin and
Ofer Neiman Near Isometric Terminal Embeddings for
Doubling Metrics . . . . . . . . . . . . 3319--3337
Mathew Francis and
Rian Neogi and
Venkatesh Raman Recognizing $k$-Clique Extendible
Orderings . . . . . . . . . . . . . . . 3338--3362
Arnold T. Saunders Jr. A Class of Random Recursive Tree
Algorithms with Deletion . . . . . . . . 3363--3378
Seungbum Jo and
Rahul Lingala and
Srinivasa Rao Satti Encoding Two-Dimensional Range Top-$k$
Queries . . . . . . . . . . . . . . . . 3379--3402
Eleni C. Akrida and
Argyrios Deligkas and
Paul G. Spirakis Connected Subgraph Defense Games . . . . 3403--3431
José Fuentes-Sepúlveda and
Diego Seco and
Raquel Viaña Succinct Encoding of Binary Strings
Representing Triangulations . . . . . . 3432--3468
Magnús M. Halldórsson and
Guy Kortsarz and
Tigran Tonoyan Network Design under General Wireless
Interference . . . . . . . . . . . . . . 3469--3490
Jongmin Choi and
Sergio Cabello and
Hee-Kap Ahn Maximizing Dominance in the Plane and
its Applications . . . . . . . . . . . . 3491--3513
Joachim Gudmundsson and
André van Renssen and
Sampson Wong Translation Invariant Fréchet Distance
Queries . . . . . . . . . . . . . . . . 3514--3533
Christopher Auer and
Christian Bachmaier and
Josef Reislhuber Correction to: Outer $1$-Planar Graphs 3534--3535
Matthias Englert and
David Mezlaf and
Matthias Westermann Online Makespan Scheduling with Job
Migration on Uniform Machines . . . . . 3537--3566
V. Arvind and
Johannes Köbler and
Jacobo Torán Parameterized Complexity of Small Weight
Automorphisms and Isomorphisms . . . . . 3567--3601
Philip Bille and
Pawe\l Gawrychowski and
Oren Weimann Top Tree Compression of Tries . . . . . 3602--3628
Mohammad Ali Abam and
Mohammad Sadegh Borouny Local Geometric Spanners . . . . . . . . 3629--3648
Jan Kratochvíl and
Tomás Masarík and
Jana Novotná $ \mathcal {U} $-Bubble Model for Mixed
Unit Interval Graphs and Its
Applications: The MaxCut Problem
Revisited . . . . . . . . . . . . . . . 3649--3680
Yuya Masumura and
Taihei Oki and
Yutaro Yamaguchi Dynamic Programming Approach to the
Generalized Minimum Manhattan Network
Problem . . . . . . . . . . . . . . . . 3681--3714
Yong Chen and
Zhi-Zhong Chen and
An Zhang Approximation Algorithms for Maximally
Balanced Connected Graph Partition . . . 3715--3740
Luis E. Caraballo and
Pablo Pérez-Lantero and
Inmaculada Ventura Maximum Box Problem on Stochastic Points 3741--3765
Eunpyeong Hung and
Mong-Jen Kao Approximation Algorithm for Vertex Cover
with Multiple Covering Constraints . . . 1--12
Sayan Bandyapadhyay On Perturbation Resilience of
Non-uniform $k$-Center . . . . . . . . . 13--36
Davide Bil\`o and
Luciano Gual\`a and
Guido Proietti Multiple-Edge-Fault-Tolerant Approximate
Shortest-Path Trees . . . . . . . . . . 37--59
Stefano Leucci and
Chih-Hung Liu Approximate Minimum Selection with
Unreliable Comparisons . . . . . . . . . 60--84
Stéphane Devismes and
David Ilcinkas and
Colette Johnen Optimized Silent Self-Stabilizing Scheme
for Tree-Based Constructions . . . . . . 85--123
Hao-Ting Wei and
Wing-Kai Hon and
Kunihiko Sadakane Approximating Dynamic Weighted Vertex
Cover with Soft Capacities . . . . . . . 124--149
Ahmad Biniaz and
Prosenjit Bose and
Anil Maheshwari Bounded-Angle Minimum Spanning Trees . . 150--175
Guido Brückner and
Nadine Krisam and
Tamara Mchedlidze Level-Planar Drawings with Few Slopes 176--196
Yixin Cao and
Ashutosh Rai and
Junjie Ye A Polynomial Kernel for Diamond-Free
Editing . . . . . . . . . . . . . . . . 197--215
Thom Castermans and
Bettina Speckmann and
Kevin Verbeek Agglomerative Clustering of Growing
Squares . . . . . . . . . . . . . . . . 216--233
Ioannis Caragiannis and
Panagiotis Kanellopoulos and
Alexandros A. Voudouris Bounding the Inefficiency of Compromise
in Opinion Formation . . . . . . . . . . 234--271
Lars Jaffke and
Paloma T. Lima and
Geevarghese Philip Structural Parameterizations of Clique
Coloring . . . . . . . . . . . . . . . . 273--303
Joseph (Seffi) Naor and
Seeun William Umboh and
David P. Williamson Tight Bounds for Online Weighted Tree
Augmentation . . . . . . . . . . . . . . 304--324
Asaf Levin Approximation Schemes for the
Generalized Extensible Bin Packing
Problem . . . . . . . . . . . . . . . . 325--343
Jon Kleinberg and
Sigal Oren Mechanisms for (Mis)allocating
Scientific Credit . . . . . . . . . . . 344--378
Julian Dörfler and
Marc Roth and
Philip Wellnitz Counting Induced Subgraphs: An Algebraic
Approach to #W[1]-Hardness . . . . . . . 379--404
Saket Saurabh and
Prafullkumar Tale On the Parameterized Complexity of
Maximum Degree Contraction Problem . . . 405--435
V. Arvind and
Abhranil Chatterjee and
Partha Mukhopadhyay Fast Exact Algorithms Using Hadamard
Product of Polynomials . . . . . . . . . 436--463
Noga Alon and
Clara Shikhelman Additive Approximation of Generalized
Turán Questions . . . . . . . . . . . . . 464--481
Daniel Lokshtanov and
Amer E. Mouawad and
Sebastian Siebertz On the Parameterized Complexity of
Reconfiguration of Connected Dominating
Sets . . . . . . . . . . . . . . . . . . 482--509
Julien Baste and
Dimitrios M. Thilikos Contraction Bidimensionality of
Geometric Intersection Graphs . . . . . 510--531
José Arturo Gil and
Simone Santini Matching Regular Expressions on
uncertain data . . . . . . . . . . . . . 532--564
Mai Alzamel and
Costas S. Iliopoulos and
Nicola Prezza Special Issue of \booktitleAlgorithmica
for the 28th London Stringology Days &
London Algorithmic Workshop (LSD & LAW) 565--565
Aleksander Kedzierski and
Jakub Radoszewski $k$-Approximate Quasiperiodicity Under
Hamming and Edit Distance . . . . . . . 566--589
Avivit Levy and
B. Riva Shalom A Comparative Study of Dictionary
Matching with Gaps: Limitations,
Techniques and Challenges . . . . . . . 590--638
Lavinia Egidi and
Felipe A. Louza and
Giovanni Manzini Space Efficient Merging of de Bruijn
Graphs and Wheeler Graphs . . . . . . . 639--669
Takuya Mieno and
Yuta Fujishige and
Masayuki Takeda Computing Minimal Unique Substrings for
a Sliding Window . . . . . . . . . . . . 670--693
Diego Arroyuelo and
Rajeev Raman Adaptive Succinctness . . . . . . . . . 694--718
Massimo Cairo and
Shahbaz Khan and
Alexandru I. Tomescu Safety in $s$--$t$ Paths, Trails and
Walks . . . . . . . . . . . . . . . . . 719--741
Oleg Merkurev and
Arseny M. Shur Computing The Maximum Exponent in a
Stream . . . . . . . . . . . . . . . . . 742--756
Alessio Conte and
Roberto Grossi and
Takeaki Uno Enumeration of Maximal Common
Subsequences Between Two Strings . . . . 757--783
Daniel Gibney and
Sharma V. Thankachan On the Complexity of Recognizing Wheeler
Graphs . . . . . . . . . . . . . . . . . 784--814
Spyros Kontogiannis and
Dorothea Wagner and
Christos Zaroliagis An Axiomatic Approach to Time-Dependent
Shortest Path Oracles . . . . . . . . . 815--870
Rémy Belmonte and
Tesshu Hanaka and
Yota Otachi Parameterized Complexity of $ (A, \ell)
$-Path Packing . . . . . . . . . . . . . 871--895
Pawe\l Gawrychowski and
Tatiana Starikovskaya Streaming Dictionary Matching with
Mismatches . . . . . . . . . . . . . . . 896--916
Leo van Iersel and
Remie Janssen and
Norbert Zeh A Practical Fixed-Parameter Algorithm
for Constructing Tree-Child Networks
from Multiple Binary Trees . . . . . . . 917--960
Akanksha Agrawal and
Sudeshna Kolay and
Meirav Zehavi Parameter Analysis for Guarding Terrains 961--981
Wenjun Li and
Chao Xu and
Jianxin Wang A Refined Branching Algorithm for the
Maximum Satisfiability Problem . . . . . 982--1006
Dan Alistarh and
Giorgi Nadiradze and
Amirmojtaba Sabour Dynamic Averaging Load Balancing on
Cycles . . . . . . . . . . . . . . . . . 1007--1029
Julien Bensmail and
Foivos Fioravantes and
Nicolas Nisse On Proper Labellings of Graphs with
Minimum Label Sum . . . . . . . . . . . 1030--1063
Boris Klemz and
Günter Rote Linear-Time Algorithms for
Maximum-Weight Induced Matchings and
Minimum Chain Covers in Convex Bipartite
Graphs . . . . . . . . . . . . . . . . . 1064--1080
Pawe\l Gawrychowski and
Florin Manea and
Rados\law Serafin Fast and Longest Rollercoasters . . . . 1081--1106
Magnús M. Halldórsson and
Toshimasa Ishii and
Kenjiro Takazawa Posimodular Function Optimization . . . 1107--1131
Swapnam Bajpai and
Vaibhav Krishan and
Srikanth Srinivasan A #SAT Algorithm for Small
Constant-Depth Circuits with PTF gates 1132--1162
Yusuke Kobayashi and
Yoshio Okamoto and
Yushi Uno Linear-Time Recognition of
Double-Threshold Graphs . . . . . . . . 1163--1181
Florent Foucaud and
Hervé Hocquard and
Théo Pierron Graph Modification for Edge-Coloured and
Signed Graph Homomorphism Problems:
Parameterized and Classical Complexity 1183--1212
Adrian Dumitrescu and
Csaba D. Tóth Online Unit Clustering and Unit Covering
in Higher Dimensions . . . . . . . . . . 1213--1231
Yaqiao Li and
Vishnu V. Narayan and
Denis Pankratov Online Coloring and a New Type of
Adversary for Online Graph Problems . . 1232--1251
Xiangyu Guo and
Guy Kortsarz and
Jiayi Xian On Approximating Degree-Bounded Network
Design Problems . . . . . . . . . . . . 1252--1278
Kazuya Haraguchi and
Hiroshi Nagamochi Enumeration of Support-Closed Subsets in
Confluent Systems . . . . . . . . . . . 1279--1315
Vikrant Ashvinkumar and
Joachim Gudmundsson and
André van Renssen Local Routing in Sparse and Lightweight
Geometric Graphs . . . . . . . . . . . . 1316--1340
Karl Bringmann and
Nick Fischer and
Philip Wellnitz Faster Minimization of Tardy Processing
Time on a Single Machine . . . . . . . . 1341--1356
Dennis Komm and
Rastislav Královic and
Tobias Mömke Randomized Online Computation with High
Probability Guarantees . . . . . . . . . 1357--1384
Benjamin Bergougnoux and
Charis Papadopoulos and
Jan Arne Telle Node Multiway Cut and Subset Feedback
Vertex Set on Graphs of Bounded
Mim-Width . . . . . . . . . . . . . . . 1385--1417
Panagiotis Charalampopoulos and
Costas S. Iliopoulos and
Juliusz Straszy\'nski Efficient Computation of Sequence
Mappability . . . . . . . . . . . . . . 1418--1440
Chenglin Fan and
Benjamin Raichel and
Gregory Van Buskirk Metric Violation Distance: Hardness and
Approximation . . . . . . . . . . . . . 1441--1465
Mohammad Ali Abam and
Mark de Berg and
Morteza Saghafian Preclustering Algorithms for Imprecise
Points . . . . . . . . . . . . . . . . . 1467--1489
Amihood Amir and
Ayelet Butman and
Dina Sokol Multidimensional Period Recovery . . . . 1490--1510
Zeev Nutov Approximating $k$-Connected
$m$-Dominating Sets . . . . . . . . . . 1511--1525
Vít Jelínek and
Tereza Klimosová and
Aneta Pokorná On 3-Coloring of $ (2 P_4, C_5) $-Free
Graphs . . . . . . . . . . . . . . . . . 1526--1547
Pratibha Choudhary Polynomial Time Algorithms for Tracking
Path Problems . . . . . . . . . . . . . 1548--1570
Johannes Lengler and
Frank Neumann Editorial . . . . . . . . . . . . . . . 1571--1572
Denis Antipov and
Benjamin Doerr and
Vitalii Karavaev A Rigorous Runtime Analysis of the $ (1
+ (\lambda, \lambda)) $ GA on Jump
Functions . . . . . . . . . . . . . . . 1573--1602
Pietro S. Oliveto and
Dirk Sudholt and
Carsten Witt Tight Bounds on the Expected Runtime of
a Standard Steady State Genetic
Algorithm . . . . . . . . . . . . . . . 1603--1658
Benjamin Doerr Does Comma Selection Help to Cope with
Local Optima? . . . . . . . . . . . . . 1659--1693
Amirhossein Rajabi and
Carsten Witt Self-Adjusting Evolutionary Algorithms
for Multimodal Optimization . . . . . . 1694--1723
Denis Antipov and
Maxim Buzdalov and
Benjamin Doerr Fast Mutation in Crossover-Based
Algorithms . . . . . . . . . . . . . . . 1724--1761
Maxim Buzdalov and
Benjamin Doerr and
Dmitry Vinokurov Fixed-Target Runtime Analysis . . . . . 1762--1793
Daryl Funk and
Dillon Mayhew and
Mike Newman Tree Automata and Pigeonhole Classes of
Matroids: I . . . . . . . . . . . . . . 1795--1834
Siu-Wing Cheng and
Yuchen Mao Restricted Max-Min Allocation:
Integrality Gap and Approximation
Algorithm . . . . . . . . . . . . . . . 1835--1874
Hiroshi Hirai and
Yuni Iwamasa Reconstructing Phylogenetic Trees from
Multipartite Quartet Systems . . . . . . 1875--1896
Mario Ullrich and
Jan Vybíral Deterministic Constructions of
High-Dimensional Sets with Small
Dispersion . . . . . . . . . . . . . . . 1897--1915
Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen Relaxing the Irrevocability Requirement
for Online Graph Algorithms . . . . . . 1916--1951
Dawei Huang and
Seth Pettie Approximate Generalized Matching:
$f$-Matchings and $f$-Edge Covers . . . 1952--1992
Li-Hsuan Chen and
Sun-Yuan Hsieh and
Ralf Klasing On the Approximability of the Single
Allocation $p$-Hub Center Problem with
Parameterized Triangle Inequality . . . 1993--2027
Surender Baswana and
Shiv Gupta and
Ayush Tulsyan Fault Tolerant Depth First Search in
Undirected Graphs: Simple Yet Efficient 2028--2049
Sander Borst and
Leo van Iersel and
Steven Kelk New FPT Algorithms for Finding the
Temporal Hybridization Number for Sets
of Phylogenetic Trees . . . . . . . . . 2050--2087
Paniz Abedin and
Sahar Hooshmand and
Sharma V. Thankachan The Heaviest Induced Ancestors Problem:
Better Data Structures and Applications 2088--2105
Jungho Ahn and
Eun Jung Kim and
Euiwoong Lee Towards Constant-Factor Approximation
for Chordal/Distance-Hereditary Vertex
Deletion . . . . . . . . . . . . . . . . 2106--2133
Markus Chimani and
Niklas Troost and
Tilo Wiedera Approximating Multistage Matching
Problems . . . . . . . . . . . . . . . . 2135--2153
Sriram Bhyravarapu and
Subrahmanyam Kalyanasundaram and
Rogers Mathew Conflict-Free Coloring Bounds on Open
Neighborhoods . . . . . . . . . . . . . 2154--2185
Dimitris Fotakis and
Alkis Kalavasis and
Christos Tzamos Efficient Parameter Estimation of
Truncated Boolean Product Distributions 2186--2221
Marinus Gottschau and
Marilena Leichter Minimum Hitting Set of Interval Bundles
Problem: Computational Complexity and
Approximability . . . . . . . . . . . . 2222--2239
Yixin Cao and
Marcin Pilipczuk Preface to the Special Issue on
Parameterized and Exact Computation . . 2240--2241
Tuukka Korhonen Finding Optimal Triangulations
Parameterized by Edge Clique Cover . . . 2242--2270
\Lukasz Bo\.zyk and
Jan Derbisz and
Tomasz Krawczyk and
Jana Novotná and
Karolina Okrasa Vertex Deletion into Bipartite
Permutation Graphs . . . . . . . . . . . 2271--2291
Fedor V. Fomin and
Petr A. Golovach and
William Lochet and
Pranabendu Misra and
Saket Saurabh and
Roohani Sharma Parameterized Complexity of Directed
Spanner Problems . . . . . . . . . . . . 2292--2308
Jesper Nederlof and
Céline M. F. Swennenhuis On the Fine-grained Parameterized
Complexity of Partial Scheduling to
Minimize the Makespan . . . . . . . . . 2309--2334
Ashwin Jacob and
Fahad Panolan and
Venkatesh Raman and
Vibha Sahlot Structural Parameterizations with
Modulator Oblivion . . . . . . . . . . . 2335--2357
Marcelo Garlet Milani A Polynomial Kernel for Funnel Arc
Deletion Set . . . . . . . . . . . . . . 2358--2378
Yasuaki Kobayashi and
Yota Otachi Parameterized Complexity of Graph
Burning . . . . . . . . . . . . . . . . 2379--2393
Kyle Fox and
Xinyi Li Approximating the Geometric Edit
Distance . . . . . . . . . . . . . . . . 2395--2413
Frank Kammer and
Johannes Meintrup and
Andrej Sajenko Space-Efficient Vertex Separators for
Treewidth . . . . . . . . . . . . . . . 2414--2461
Mirmahdi Rahgoshay and
Mohammad R. Salavatipour Asymptotic Quasi-Polynomial Time
Approximation Scheme for Resource
Minimization for Fire Containment . . . 2462--2479
Clemens Heuberger and
Daniel Krenn and
Gabriel F. Lipnik Asymptotic Analysis of $q$-Recursive
Sequences . . . . . . . . . . . . . . . 2480--2532
Julien Bensmail and
Foivos Fioravantes and
Fionn Mc Inerney and
Nicolas Nisse The Largest Connected Subgraph Game . . 2533--2555
Michael A. Bekos and
Emilio Di Giacomo and
Walter Didimo and
Giuseppe Liotta and
Fabrizio Montecchiani Universal Slope Sets for Upward Planar
Drawings . . . . . . . . . . . . . . . . 2556--2580
Yoshifumi Sakai and
Shunsuke Inenaga A Faster Reduction of the Dynamic Time
Warping Distance to the Longest
Increasing Subsequence Length . . . . . 2581--2596
Thomas Bosman and
Martijn van Ee and
Yang Jiao and
Alberto Marchetti-Spaccamela and
R. Ravi and
Leen Stougie Approximation Algorithms for
Replenishment Problems with Fixed
Turnover Times . . . . . . . . . . . . . 2597--2621
Akanksha Agrawal and
Pranabendu Misra and
Fahad Panolan and
Saket Saurabh Fast Exact Algorithms for Survivable
Network Design with Uniform Requirements 2622--2641
Guozhen Rong and
Yixin Cao and
Jianxin Wang and
Zhifeng Wang Graph Searches and Their End Vertices 2642--2666
Karthekeyan Chandrasekaran and
Weihang Wang $ \ell_p$-Norm Multiway Cut . . . . . . 2667--2701
Surender Baswana and
Shiv Gupta and
Till Knollmann Mincut Sensitivity Data Structures for
the Insertion of an Edge . . . . . . . . 2702--2734
Dominik Köppl and
Simon J. Puglisi and
Rajeev Raman Fast and Simple Compact Hashing via
Bucketing . . . . . . . . . . . . . . . 2735--2766
Jòrgen Bang-Jensen and
Eduard Eiben and
Gregory Gutin and
Magnus Wahlström and
Anders Yeo Component Order Connectivity in Directed
Graphs . . . . . . . . . . . . . . . . . 2767--2784
Tzvi Alon and
Nir Halman Strongly Polynomial FPTASes for Monotone
Dynamic Programs . . . . . . . . . . . . 2785--2819
Shinwoo An and
Eunjin Oh Reachability Problems for Transmission
Graphs . . . . . . . . . . . . . . . . . 2820--2841
Dhanyamol Antony and
Jay Garchar and
Sagartanu Pal and
R. B. Sandeep and
Sagnik Sen and
R. Subashini On Subgraph Complementation to $H$-free
Graphs . . . . . . . . . . . . . . . . . 2842--2870
Jakob Keller and
Christian Rieck and
Christian Scheffer and
Arne Schmidt Particle-Based Assembly Using Precise
Global Control . . . . . . . . . . . . . 2871--2897
Bart de Keijzer and
Dominik Wojtczak Facility Reallocation on the Line . . . 2898--2925
Robert Krauthgamer and
David Reitblat Almost-Smooth Histograms and
Sliding-Window Graph Algorithms . . . . 2926--2953
Sándor P. Fekete and
Eike Niehs and
Christian Scheffer and
Arne Schmidt Connected Reconfiguration of
Lattice-Based Cellular Structures by
Finite-Memory Robots . . . . . . . . . . 2954--2986
Arnold Filtser and
Ofer Neiman Light Spanners for High Dimensional
Norms via Stochastic Decompositions . . 2987--3007
Nicola Rizzo and
Alexandru I. Tomescu and
Alberto Policriti Solving String Problems on Graphs Using
the Labeled Direct Product . . . . . . . 3008--3033
Ziyun Huang and
Qilong Feng and
Jianxin Wang and
Jinhui Xu Small Candidate Set for Translational
Pattern Search . . . . . . . . . . . . . 3034--3053
Nathaniel Grammel and
Lisa Hellerstein and
Devorah Kletenik and
Naifeng Liu Algorithms for the Unit-Cost Stochastic
Score Classification Problem . . . . . . 3054--3074
Akanksha Agrawal and
Madhumita Kundu and
Abhishek Sahu and
Saket Saurabh and
Prafullkumar Tale Parameterized Complexity of Maximum Edge
Colorable Subgraph . . . . . . . . . . . 3075--3100
Moran Feldman Correction to: Guess Free Maximization
of Submodular and Linear Sums . . . . . 3101--3102
Leszek Gasieniec and
Ralf Klasing and
Tomasz Radzik Selected Papers of the 31st
International Workshop on Combinatorial
Algorithms, IWOCA 2020 . . . . . . . . . 3103--3106
Petr A. Golovach and
Meirav Zehavi Special Issue Dedicated to the 16th
International Symposium on Parameterized
and Exact Computation . . . . . . . . . 3107--3109
Shaohua Li and
Marcin Pilipczuk Hardness of Metric Dimension in Graphs
of Constant Treewidth . . . . . . . . . 3110--3155
Haozhe An and
Mohit Gurumukhani and
Russell Impagliazzo and
Michael Jaber and
Marvin Künnemann and
Maria Paula Parga Nina The Fine-Grained Complexity of
Multi-Dimensional Ordering Properties 3156--3191
Guillaume Ducoffe Optimal Centrality Computations Within
Bounded Clique-Width Graphs . . . . . . 3192--3222
Alejandro Grez and
Filip Mazowiecki and
Micha\l Pilipczuk and
Gabriele Puppis and
Cristian Riveros Dynamic Data Structures for Timed
Automata Acceptance . . . . . . . . . . 3223--3245
Jan Derbisz and
Lawqueen Kanesh and
Jayakrishnan Madathil and
Abhishek Sahu and
Saket Saurabh and
Shaily Verma A Polynomial Kernel for Bipartite
Permutation Vertex Deletion . . . . . . 3246--3275
V. Arvind and
Venkatesan Guruswami CNF Satisfiability in a Subspace and
Related Problems . . . . . . . . . . . . 3276--3299
Édouard Bonnet and
Eun Jung Kim and
Amadeus Reinald and
Stéphan Thomassé and
Rémi Watrigant Twin-width and Polynomial Kernels . . . 3300--3337
Gabriel Bathie and
Nicolas Bousquet and
Yixin Cao and
Yuping Ke and
Théo Pierron (Sub)linear Kernels for Edge
Modification Problems Toward Structured
Graph Classes . . . . . . . . . . . . . 3338--3364
Júlio Araújo and
Marin Bougeret and
Victor Campos and
Ignasi Sau Introducing lop -Kernels: a Framework
for Kernelization Lower Bounds . . . . . 3365--3406
Huib Donkers and
Bart M. P. Jansen and
Micha\l W\lodarczyk Preprocessing for Outerplanar Vertex
Deletion: an Elementary Kernel of
Quartic Size . . . . . . . . . . . . . . 3407--3458
Max Bannach and
Zacharias Heinrich and
Rüdiger Reischuk and
Till Tantau Dynamic Kernels for Hitting Sets and Set
Packing . . . . . . . . . . . . . . . . 3459--3488
Guillaume Ducoffe Maximum Matching in Almost Linear Time
on Graphs of Bounded Clique-Width . . . 3489--3520
Anonymous Editor's Note: Special Issue Dedicated
to the 14th Latin American Theoretical
Informatics Symposium . . . . . . . . . 3521--3521
Lehilton Lelis Chaves Pedrosa and
Hugo Kooki Kasuya Rosado A 2-Approximation for the
$k$-Prize-Collecting Steiner Tree
Problem . . . . . . . . . . . . . . . . 3522--3558
Gill Barequet and
Mira Shalah Improved Upper Bounds on the Growth
Constants of Polyominoes and Polycubes 3559--3586
Jean R. S. Blair and
Pinar Heggernes and
Paloma T. Lima and
Daniel Lokshtanov On the Maximum Number of Edges in
Chordal Graphs of Bounded Degree and
Matching Number . . . . . . . . . . . . 3587--3602
Kazuya Shimizu and
Ryuhei Mori Exponential-Time Quantum Algorithms for
Graph Coloring Problems . . . . . . . . 3603--3621
Khaled Elbassioni Approximation Algorithms for Cost-robust
Discrete Minimization Problems Based on
their LP-Relaxations . . . . . . . . . . 3622--3654
Bruno Pasqualotto Cavalar and
Mrinal Kumar and
Benjamin Rossman Monotone Circuit Lower Bounds from
Robust Sunflowers . . . . . . . . . . . 3655--3685
Louisa Seelbach Benkner and
Stephan Wagner Distinct Fringe Subtrees in Random Trees 3686--3728
Pierre Aboulker and
Édouard Bonnet and
Eun Jung Kim and
Florian Sikora Grundy Coloring and Friends,
Half-Graphs, Bicliques . . . . . . . . . 1--28
Sang Won Bae and
Sang Duk Yoon Empty Squares in Arbitrary Orientation
Among Points . . . . . . . . . . . . . . 29--74
Gill Barequet and
Gil Ben-Shachar Algorithms for Counting
Minimum-Perimeter Lattice Animals . . . 75--99
Raghunath Reddy Madireddy and
Apurva Mudgal A Constant-Factor Approximation
Algorithm for Red--Blue Set Cover with
Unit Disks . . . . . . . . . . . . . . . 100--132
Sujoy Bhore and
Paz Carmi and
Sudeshna Kolay and
Meirav Zehavi Parameterized Study of Steiner Tree on
Unit Disk Graphs . . . . . . . . . . . . 133--152
Gruia Calinescu and
Xiaolang Wang Combination Algorithms for Steiner Tree
Variants . . . . . . . . . . . . . . . . 153--169
Amihood Amir and
Ayelet Butman and
Gad M. Landau and
Shoshana Marcus and
Dina Sokol Double String Tandem Repeats . . . . . . 170--187
Peter Jonsson and
Victor Lagerkvist General Lower Bounds and Improved
Algorithms for Infinite-Domain CSPs . . 188--215
Shlomi Dolev and
Thomas Petig and
Elad M. Schiller Self-Stabilizing and Private Distributed
Shared Atomic Memory in Seldomly Fair
Message Passing Networks . . . . . . . . 216--276
Herbert Edelsbrunner and
Georg Osang A Simple Algorithm for Higher-Order
Delaunay Mosaics and Alpha Shapes . . . 277--295
Sándor P. Fekete and
Jonas Grosse-Holz and
Phillip Keldenich and
Arne Schmidt Parallel Online Algorithms for the Bin
Packing Problem . . . . . . . . . . . . 296--323
Matthias Bentert and
André Nichterlein Parameterized Complexity of Diameter . . 325--351
Deniz Agaoglu Çagirici and
Petr Hlinený Efficient Isomorphism for $ S_d $-Graphs
and $T$-Graphs . . . . . . . . . . . . . 352--383
Ivan Bliznets and
Danil Sagunov Solving Target Set Selection with
Bounded Thresholds Faster than $ 2^n $ 384--405
Thomas Erlebach and
Michael Hoffmann and
Murilo Santos de Lima Round-Competitive Algorithms for
Uncertainty Problems with Parallel
Queries . . . . . . . . . . . . . . . . 406--443
Júlio Araújo and
Marin Bougeret and
Victor A. Campos and
Ignasi Sau Parameterized Complexity of Computing
Maximum Minimal Blocking and Hitting
Sets . . . . . . . . . . . . . . . . . . 444--491
Vincent Froese and
Brijnesh Jain and
Maciej Rymar and
Mathias Weller Fast Exact Dynamic Time Warping on
Run-Length Encoded Time Series . . . . . 492--508
Konstantinos Tsakalidis and
Sebastian Wild and
Viktor Zamaraev Succinct Permutation Graphs . . . . . . 509--543
Michael Bekos and
Martin Gronemann and
Chrysanthi N. Raftopoulou An Improved Upper Bound on the Queue
Number of Planar Graphs . . . . . . . . 544--562
Hamidreza Jahanjou and
Erez Kantor and
Rajmohan Rajaraman Improved Algorithms for Scheduling
Unsplittable Flows on Paths . . . . . . 563--583
Serge Gaspers and
Edward J. Lee Faster Graph Coloring in Polynomial
Space . . . . . . . . . . . . . . . . . 584--609
K. Subramani and
Piotr Wojciechowski Integer Feasibility and Refutations in
UTVPI Constraints Using Bit-Scaling . . 610--637
Paola Flocchini and
Lucia Moura Selected Papers of the 32nd
International Workshop on Combinatorial
Algorithms, IWOCA 2021 . . . . . . . . . 639--641
Bogdan Alecu and
Aistis Atminas and
Vadim Lozin and
Dmitriy Malyshev Combinatorics and Algorithms for
Quasi-Chain Graphs . . . . . . . . . . . 642--664
Amotz Bar-Noy and
David Peleg and
Mor Perry and
Dror Rawitz Composed Degree-Distance Realizations of
Graphs . . . . . . . . . . . . . . . . . 665--687
Benjamin Merlin Bumpus and
Kitty Meeks Edge Exploration of Temporal Graphs . . 688--716
Ben Cameron and
Joe Sawada and
Wei Therese and
Aaron Williams Hamiltonicity of $k$-Sided Pancake
Networks with Fixed-Spin: Efficient
Generation, Ranking, and Optimality . . 717--744
Niccoló Di Marco and
Andrea Frosini and
William Lawrence Kocay and
Elisa Pergola and
Lama Tarsissi Structure and Complexity of
2-Intersection Graphs of 3-Hypergraphs 745--761
Martin Kucera and
Ondrej Suchý Minimum Eccentricity Shortest Path
Problem with Respect to Structural
Parameters . . . . . . . . . . . . . . . 762--782
Stefan Lendl and
Gerhard Woeginger and
Lasse Wulf Non-Preemptive Tree Packing . . . . . . 783--804
Andrea Marino and
Ana Silva Eulerian Walks in Temporal Graphs . . . 805--830
Alberto Rojas Anríquez and
Maya Stein 3-Colouring $ P_t $-Free Graphs Without
Short Odd Cycles . . . . . . . . . . . . 831--853
Manas Jyoti Kashyop and
N. S. Narayanaswamy and
Meghana Nasre and
Sai Mohith Potluri Trade-Offs in Dynamic Coloring for
Bipartite and General Graphs . . . . . . 854--878
Philip Bille and
Inge Li Gòrtz and
Max Rishòj Pedersen and
Teresa Anna Steiner Gapped Indexing for Consecutive
Occurrences . . . . . . . . . . . . . . 879--901
Pavel Dvo\vrák and
Andreas Emil Feldmann and
Ashutosh Rai and
Pawe\l Rz\ka\.zewski Parameterized Inapproximability of
Independent Set in $H$-Free Graphs . . . 902--928
Sebastian Forster and
Tijn de Vos Faster Cut Sparsification of Weighted
Graphs . . . . . . . . . . . . . . . . . 929--964
Sariel Har-Peled and
Mitchell Jones Few Cuts Meet Many Point Sets . . . . . 965--975
Miros\law Kowaluk and
Andrzej Lingas Rare Siblings Speed-Up Deterministic
Detection and Counting of Small Pattern
Graphs . . . . . . . . . . . . . . . . . 976--991
Riccardo Dondi and
Manuel Lafond On the Tractability of Covering a Graph
with 2-Clubs . . . . . . . . . . . . . . 992--1028
Seth Gilbert and
Peter Robinson and
Suman Sourav Leader Election in Well-Connected Graphs 1029--1066
Stephan Dominique Andres and
François Dross and
Melissa A. Huggan and
Fionn Mc Inerney and
Richard J. Nowakowski The Complexity of Two Colouring Games 1067--1090
Maël Dumas and
Anthony Perez and
Ioan Todinca A Cubic Vertex-Kernel for Trivially
Perfect Editing . . . . . . . . . . . . 1091--1110
Robert Ganian and
Sebastian Ordyniak and
C. S. Rahul Group Activity Selection with Few Agent
Types . . . . . . . . . . . . . . . . . 1111--1155
William Lenhart and
Giuseppe Liotta and
Debajyoti Mondal and
Rahnuma Islam Nishat Drawing Partial 2-Trees with Few Slopes 1156--1175
Jawaherul Md. Alam and
Michael A. Bekos and
Martin Gronemann and
Michael Kaufmann and
Sergey Pupyrev Lazy Queue Layouts of Posets . . . . . . 1176--1201
Thomas Bellitto and
Shaohua Li and
Karolina Okrasa and
Marcin Pilipczuk and
Manuel Sorge The Complexity of Routing Problems in
Forbidden-Transition Graphs and
Edge-Colored Graphs . . . . . . . . . . 1202--1250
François Le Gall and
Saeed Seddighin Quantum Meets Fine-Grained Complexity:
Sublinear Time Quantum Algorithms for
String Problems . . . . . . . . . . . . 1251--1286
Abolfazl Asudeh and
Tanya Berger-Wolf and
Bhaskar DasGupta and
Anastasios Sidiropoulos Maximizing Coverage While Ensuring
Fairness: a Tale of Conflicting
Objectives . . . . . . . . . . . . . . . 1287--1331
Moran Feldman and
Zeev Nutov and
Elad Shoham Practical Budgeted Submodular
Maximization . . . . . . . . . . . . . . 1332--1371
Alexander Birx and
Yann Disser and
Kevin Schewior Improved Bounds for Open Online
Dial-a-Ride on the Line . . . . . . . . 1372--1414
Leah Epstein and
Loay Mualem Online Bin Packing of Squares and Cubes 1415--1458
Nina Chiarelli and
Matja\vz Krnc and
Martin Milani\vc and
Ulrich Pferschy and
Nevena Piva\vc and
Joachim Schauer Fair Allocation of Indivisible Items
with Conflict Graphs . . . . . . . . . . 1459--1489
Arnold Filtser and
Omrit Filtser and
Matthew J. Katz Approximate Nearest Neighbor for Curves:
Simple, Efficient, and Deterministic . . 1490--1519
Anonymous Special Issue on Algorithms and
Computation (ISAAC 2021) . . . . . . . . 1521--1521
Mathew C. Francis and
Pavol Hell and
Dalu Jacob On the Kernel and Related Problems in
Interval Digraphs . . . . . . . . . . . 1522--1559
Susanne Albers and
Waldo Gálvez and
Maximilian Janke Machine Covering in the Random-Order
Model . . . . . . . . . . . . . . . . . 1560--1585
Massimo Equi and
Tuukka Norri and
Jarno Alanko and
Bastien Cazaux and
Alexandru I. Tomescu and
Veli Mäkinen Algorithms and Complexity on Indexing
Founder Graphs . . . . . . . . . . . . . 1586--1623
Luciano Gual\`a and
Stefano Leucci and
Isabella Ziccardi Resilient Level Ancestor, Bottleneck,
and Lowest Common Ancestor Queries in
Dynamic Trees . . . . . . . . . . . . . 1624--1651
Mark de Berg and
Sándor Kisfaludi-Bak and
Morteza Monemizadeh and
Leonidas Theocharous Clique-Based Separators for Geometric
Intersection Graphs . . . . . . . . . . 1652--1678
Joyce Bacic and
Saeed Mehrabi and
Michiel Smid Shortest Beer Path Queries in
Outerplanar Graphs . . . . . . . . . . . 1679--1705
Tomohiro Koana and
Christian Komusiewicz and
Frank Sommer Essentially Tight Kernels for (Weakly)
Closed Graphs . . . . . . . . . . . . . 1706--1735
Meng He and
Anna Lubiw and
Mohammad Salavatipour Preface to the Special Issue on the 17th
Algorithms and Data Structures Symposium
(WADS 2021) . . . . . . . . . . . . . . 1736--1737
David Eppstein A Stronger Lower Bound on Parametric
Minimum Spanning Trees . . . . . . . . . 1738--1753
Joe Sawada and
Aaron Williams Constructing the first (and coolest)
fixed-content universal cycle . . . . . 1754--1785
Ioana O. Bercea and
Guy Even Dynamic Dictionaries for Multisets and
Counting Filters with Constant Time
Operations . . . . . . . . . . . . . . . 1786--1804
Pawe\l Gawrychowski and
Przemys\law Uzna'nski Better Distance Labeling for Unweighted
Planar Graphs . . . . . . . . . . . . . 1805--1823
Sayan Bandyapadhyay Improved Bounds for Metric Capacitated
Covering Problems . . . . . . . . . . . 1825--1849
Sanjana Dey and
Florent Foucaud and
Subhas C. Nandy and
Arunabha Sen Complexity and Approximation for
Discriminating and Identifying Code
Problems in Geometric Setups . . . . . . 1850--1882
Kangsan Kim and
Yongho Shin and
Hyung-Chan An Constant-Factor Approximation Algorithms
for Parity-Constrained Facility Location
and $k$-Center . . . . . . . . . . . . . 1883--1911
Guilherme C. M. Gomes and
Matheus R. Guedes and
Vinicius F. dos Santos Structural Parameterizations for
Equitable Coloring: Complexity, FPT
Algorithms, and Kernelization . . . . . 1912--1947
Di Chen and
Mordecai Golin Minmax Centered $k$-Partitioning of
Trees and Applications to Sink
Evacuation with Dynamic Confluent Flows 1948--2000
Yossi Azar and
Chay Machluf and
Boaz Patt-Shamir and
Noam Touitou Competitive Vertex Recoloring . . . . . 2001--2027
Till Fluschnik and
Rolf Niedermeier and
Carsten Schubert and
Philipp Zschoche Multistage $s$--$t$ Path: Confronting
Similarity with Dissimilarity . . . . . 2028--2064
Pranabendu Misra and
Saket Saurabh and
Roohani Sharma and
Meirav Zehavi Sub-exponential Time Parameterized
Algorithms for Graph Layout Problems on
Digraphs with Bounded Independence
Number . . . . . . . . . . . . . . . . . 2065--2086
Tobias Friedrich and
Hans Gawendowicz and
Pascal Lenzner and
Anna Melnichenko Social Distancing Network Creation . . . 2087--2130
Bruno P. Cavalar and
Zhenjian Lu Algorithms and Lower Bounds for
Comparator Circuits from Shrinkage . . . 2131--2155
Tomohiro Koana and
Christian Komusiewicz and
Frank Sommer Computing Dense and Sparse Subgraphs of
Weakly Closed Graphs . . . . . . . . . . 2156--2187
Alberto Del Pia and
Silvia Di Gregorio On the Complexity of Binary Polynomial
Optimization Over Acyclic Hypergraphs 2189--2213
Mincheol Kim and
Chanyang Seo and
Taehoon Ahn and
Hee-Kap Ahn Farthest-Point Voronoi Diagrams in the
Presence of Rectangular Obstacles . . . 2214--2237
Asaf Levin Online Minimization of the Maximum
Starting Time: Migration Helps . . . . . 2238--2259
Shyan Akmal and
Ce Jin Near-Optimal Quantum Algorithms for
String Problems . . . . . . . . . . . . 2260--2317
Felix Reidl and
Blair D. Sullivan A Color-Avoiding Approach to Subgraph
Counting in Bounded Expansion Classes 2318--2347
Muhammad Faisal Nadeem and
Hamza Iqbal and
Hafiz Muhammad Afzal Siddiqui and
Muhammad Azeem Intersecting Longest Cycles in
Archimedean Tilings . . . . . . . . . . 2348--2362
Yiqin Gao and
Yves Robert and
Frédéric Vivien Resource-Constrained Scheduling
Algorithms for Stochastic Independent
Tasks With Unknown Probability
Distribution . . . . . . . . . . . . . . 2363--2394
Shyan Akmal and
Lijie Chen and
Ce Jin and
Malvika Raj and
Ryan Williams Improved Merlin--Arthur Protocols for
Central Problems in Fine-Grained
Complexity . . . . . . . . . . . . . . . 2395--2426
David Caballero and
Timothy Gomez and
Robert Schweller and
Tim Wylie Unique Assembly Verification in
Two-Handed Self-Assembly . . . . . . . . 2427--2453
Jesse Beisegel and
Ekkehard Köhler and
Robert Scheffler and
Martin Strehler Certifying Fully Dynamic Algorithms for
Recognition and Hamiltonicity of
Threshold and Chain Graphs . . . . . . . 2454--2481
Yoshiharu Kohayakawa and
Flávio K. Miyazawa Guest Editorial: Special Issue on
Theoretical Informatics . . . . . . . . 2482--2484
Anthony Bonato and
Konstantinos Georgiou and
Calum MacRury and
Pawe\l Pra\lat Algorithms for $p$-Faulty Search on a
Half-Line . . . . . . . . . . . . . . . 2485--2514
Sergey Bereg Computing Balanced Convex Partitions of
Lines . . . . . . . . . . . . . . . . . 2515--2528
Vlady Ravelomanana and
Ny Aina Andriambolamalala Transmitting Once to Elect a Leader on
Wireless Networks . . . . . . . . . . . 2529--2553
Balagopal Komarath and
Anurag Pandey and
C. S. Rahul Monotone Arithmetic Complexity of Graph
Homomorphism Polynomials . . . . . . . . 2554--2579
Barnaby Martin and
Daniël Paulusma and
Siani Smith and
Erik Jan van Leeuwen Induced Disjoint Paths and Connected
Subgraphs for $H$-Free Graphs . . . . . 2580--2604
Walter Didimo and
Michael Kaufmann and
Giuseppe Liotta and
Giacomo Ortali Computing Bend-Minimum Orthogonal
Drawings of Plane Series-Parallel Graphs
in Linear Time . . . . . . . . . . . . . 2605--2666
Patrizio Angelini and
Michael A. Bekos and
Henry Förster and
Martin Gronemann Bitonic st-Orderings for Upward Planar
Graphs: Splits and Bends in the Variable
Embedding Scenario . . . . . . . . . . . 2667--2692
Amey Bhangale and
Aleksa Stankovi\'c Max-3-Lin Over Non-abelian Groups with
Universal Factor Graphs . . . . . . . . 2693--2734
Arindam Khan and
Eklavya Sharma Tight Approximation Algorithms for
Geometric Bin Packing with Skewed Items 2735--2778
Nicolas Bousquet and
Takehiro Ito and
Yusuke Kobayashi and
Haruka Mizuta and
Paul Ouvrard and
Akira Suzuki and
Kunihiro Wasa Reconfiguration of Spanning Trees with
Degree Constraints or Diameter
Constraints . . . . . . . . . . . . . . 2779--2816
Sotiris Nikoletseas and
Christoforos Raptopoulos and
Paul Spirakis MAX CUT in Weighted Random Intersection
Graphs and Discrepancy of Sparse Random
Set Systems . . . . . . . . . . . . . . 2817--2842
Shunhua Jiang and
Bento Natura and
Omri Weinstein A Faster Interior-Point Method for
Sum-of-Squares Optimization . . . . . . 2843--2884
Matteo Castiglioni and
Andrea Celli and
Nicola Gatti Public Bayesian Persuasion: Being Almost
Optimal and Almost Persuasive . . . . . 2885--2921
Anselm Haak and
Arne Meier and
Om Prakash and
B. V. Raghavendra Rao Parameterised Counting in Logspace . . . 2923--2961
Julio Araujo and
Julien Bensmail and
Victor Campos and
Frédéric Havet and
A. Karolinna Maia and
Nicolas Nisse and
Ana Silva On Finding the Best and Worst
Orientations for the Metric Dimension 2962--3002
Yishu Wang and
Arnaud Mary and
Marie-France Sagot and
Blerina Sinaimeri A General Framework for Enumerating
Equivalence Classes of Solutions . . . . 3003--3023
Philip N. Klein and
Claire Mathieu and
Hang Zhou Correlation Clustering and
Two--Edge-Connected Augmentation for
Planar Graphs . . . . . . . . . . . . . 3024--3057
Jungho Ahn and
Eduard Eiben and
O.-joung Kwon and
Sang-il Oum A Polynomial Kernel for 3-Leaf Power
Deletion . . . . . . . . . . . . . . . . 3058--3087
Waldo Gálvez and
Fabrizio Grandoni and
Afrouz Jabal Ameli and
Klaus Jansen and
Arindam Khan and
Malin Rau A Tight $ (3 \slash 2 + \varepsilon)
$-Approximation for Skewed Strip Packing 3088--3109
Yoann Dieudonné and
Andrzej Pelc and
Franck Petit Almost Universal Anonymous Rendezvous in
the Plane . . . . . . . . . . . . . . . 3110--3143
Amit Deshpande and
Rameshwar Pratap One-Pass Additive-Error Subset Selection
for $ \ell_p $ Subspace Approximation
and $ (k, p) $-Clustering . . . . . . . 3144--3167
Harold N. Gabow Blocking Trails for $f$-factors of
Multigraphs . . . . . . . . . . . . . . 3168--3213
Harold N. Gabow A Weight-Scaling Algorithm for
$f$-Factors of Multigraphs . . . . . . . 3214--3289
Felicia Lucke and
Daniël Paulusma and
Bernard Ries Finding Matching Cuts in $H$-Free Graphs 3290--3322
Tomasz Kociumaka and
Jakub Radoszewski and
Tatiana Starikovskaya Publisher Correction: Longest Common
Substring with Approximately $k$
Mismatches . . . . . . . . . . . . . . . 3323--3323
Md. Saidur Rahman and
Petra Mutzel and
Slamin Special Issue Dedicated to 16th
International Conference and Workshops
on Algorithms and Computation, WALCOM
2022 . . . . . . . . . . . . . . . . . . 3325--3326
Hiroshi Eto and
Takehiro Ito and
Eiji Miyano and
Akira Suzuki and
Yuma Tamura Happy Set Problem on Subclasses of
Co-comparability Graphs . . . . . . . . 3327--3347
Kenya Kobayashi and
Guohui Lin and
Eiji Miyano and
Toshiki Saitoh and
Akira Suzuki and
Tadatoshi Utashima and
Tsuyoshi Yagita Path Cover Problems with Length Cost . . 3348--3375
Gennaro Cordasco and
Luisa Gargano and
Adele A. Rescigno Immunization in the Threshold Model: a
Parameterized Complexity Study . . . . . 3376--3405
Gaétan Berthe and
Barnaby Martin and
Daniël Paulusma and
Siani Smith The Complexity of $ L(p, q)
$-Edge-Labelling . . . . . . . . . . . . 3406--3429
Akanksha Agrawal and
Pratibha Choudhary and
N. S. Narayanaswamy and
K. K. Nisha and
Vijayaragunathan Ramamoorthi Parameterized Complexity of Minimum
Membership Dominating Set . . . . . . . 3430--3452
Joshua Ani and
Erik D. Demaine and
Yevhenii Diomidov and
Dylan Hendrickson and
Jayson Lynch Traversability, Reconfiguration, and
Reachability in the Gadget Framework . . 3453--3486
Thomas Bläsius and
Tobias Friedrich and
Maximilian Katzmann Efficiently Approximating Vertex Cover
on Scale-Free Networks with Underlying
Hyperbolic Geometry . . . . . . . . . . 3487--3520
Carla Binucci and
Giordano Da Lozzo and
Emilio Di Giacomo and
Walter Didimo and
Tamara Mchedlidze and
Maurizio Patrignani Upward Book Embeddability of $ s t
$-Graphs: Complexity and Algorithms . . 3521--3571
Eyal Nussbaum and
Michael Segal and
Oles Holembovskyy Finding Geometric Facilities with
Location Privacy . . . . . . . . . . . . 3572--3601
Divesh Aggarwal and
Nico Döttling and
Jesko Dujmovic and
Mohammad Hajiabadi and
Giulio Malavolta and
Maciej Obremski Algebraic Restriction Codes and Their
Applications . . . . . . . . . . . . . . 3602--3648
Max A. Deppert and
Klaus Jansen and
Arindam Khan and
Malin Rau and
Malte Tutas Peak Demand Minimization via Sliced
Strip Packing . . . . . . . . . . . . . 3649--3679
Monika Henzinger and
Billy Jin and
Richard Peng and
David P. Williamson A Combinatorial Cut-Toggling Algorithm
for Solving Laplacian Linear Systems . . 3680--3716
Sushmita Gupta and
Pallavi Jain and
Saket Saurabh and
Nimrod Talmon Even More Effort Towards Improved Bounds
and Fixed-Parameter Tractability for
Multiwinner Rules . . . . . . . . . . . 3717--3740
Peter Kiss Deterministic Dynamic Matching in
Worst--Case Update Time . . . . . . . . 3741--3765
Spyros Angelopoulos and
Christoph Dürr and
Shendan Jin Best-of-Both-Worlds Analysis of Online
Search . . . . . . . . . . . . . . . . . 3766--3792
Stefan Klootwijk and
Bodo Manthey Probabilistic Analysis of Optimization
Problems on Sparse Random Shortest Path
Metrics . . . . . . . . . . . . . . . . 3793--3815
Sayan Bandyapadhyay and
Aritra Banik and
Sujoy Bhore On Colorful Vertex and Edge Cover
Problems . . . . . . . . . . . . . . . . 3816--3827
Alexander Meiburg Inapproximability of Positive
Semidefinite Permanents and Quantum
State Tomography . . . . . . . . . . . . 3828--3854
Dimitris Fotakis and
Vardis Kandiros and
Vasilis Kontonis and
Stratis Skoulakis Opinion Dynamics with Limited
Information . . . . . . . . . . . . . . 3855--3888
Sumanta Banerjee and
Juhi Chaudhary and
Dinabandhu Pradhan Unique Response Roman Domination:
Complexity and Algorithms . . . . . . . 3889--3927
Mark de Berg and
Aleksandar Markovic and
Seeun William Umboh The Online Broadcast Range-Assignment
Problem . . . . . . . . . . . . . . . . 3928--3956
Robert Krauthgamer and
Shay Sapir Comparison of Matrix Norm Sparsification 3957--3972
Félix Hernández and
Gerardo Vega The Subfield and Extended Codes of a
Subclass of Optimal Three-Weight Cyclic
Codes . . . . . . . . . . . . . . . . . 3973--3995
Henry Bambury and
Antoine Bultel and
Benjamin Doerr An Extended Jump Functions Benchmark for
the Analysis of Randomized Search
Heuristics . . . . . . . . . . . . . . . 1--32
Youhei Akimoto Analysis of Surrogate-Assisted
Information-Geometric Optimization
Algorithms . . . . . . . . . . . . . . . 33--63
Benjamin Doerr and
Amirhossein Rajabi and
Carsten Witt Simulated Annealing is a Polynomial-Time
Approximation Scheme for the Minimum
Spanning Tree Problem . . . . . . . . . 64--89
Benjamin Doerr and
Yassine Ghannane and
Marouane Ibn Brahim Runtime Analysis for Permutation-based
Evolutionary Algorithms . . . . . . . . 90--129
Yicheng Xu and
Vincent Chau and
Chenchen Wu and
Yong Zhang and
Vassilis Zissimopoulos and
Yifei Zou A Semi Brute-Force Search Approach for
(Balanced) Clustering . . . . . . . . . 130--146
Tatsuya Gima and
Yota Otachi Extended MSO Model Checking via Small
Vertex Integrity . . . . . . . . . . . . 147--170
T.-H. Hubert Chan and
Silvio Lattanzi and
Mauro Sozio and
Bo Wang Fully Dynamic $k$-Center Clustering with
Outliers . . . . . . . . . . . . . . . . 171--193
Giulia Punzi and
Alessio Conte and
Roberto Grossi and
Romeo Rizzi Refined Bounds on the Number of Eulerian
Tours in Undirected Graphs . . . . . . . 194--217
Andrew Alseth and
Matthew J. Patitz The Need for Seed (in the Abstract Tile
Assembly Model) . . . . . . . . . . . . 218--280
Charis Papadopoulos and
Athanasios E. Zisis Computing and Listing Avoidable Vertices
and Paths . . . . . . . . . . . . . . . 281--306
Arnab Maiti and
Palash Dey On Parameterized Complexity of Binary
Networked Public Goods Game . . . . . . 307--333
Barì\cs Can Esmer and
Ariel Kulik and
Dániel Marx and
Philipp Schepper and
Karol W\kegrzycki Computing Generalized Convolutions
Faster Than Brute Force . . . . . . . . 334--366
Benjamin Doerr and
Timo Kötzing Lower Bounds from Fitness Levels Made
Easy . . . . . . . . . . . . . . . . . . 367--395
Per Kristian Lehre and
Xiaoyu Qin More Precise Runtime Analyses of
Non-elitist Evolutionary Algorithms in
Uncertain Environments . . . . . . . . . 396--441
Denis Antipov and
Maxim Buzdalov and
Benjamin Doerr Lazy Parameter Tuning and Control:
Choosing All Parameters Randomly from a
Power-Law Distribution . . . . . . . . . 442--484
Sheng-Yen Ko and
Ho-Lin Chen and
Siu-Wing Cheng and
Wing-Kai Hon and
Chung-Shou Liao Polynomial-time Combinatorial Algorithm
for General Max--Min Fair Allocation . . 485--504
Sun-Yuan Hsieh and
Hoang-Oanh Le and
Van Bang Le and
Sheng-Lung Peng On the $d$-Claw Vertex Deletion Problem 505--525
Mario Alejandro Hevia Fajardo and
Dirk Sudholt Self-adjusting Population Sizes for
Non-elitist Evolutionary Algorithms: Why
Success Rates Matter . . . . . . . . . . 526--565
Yasushi Kawase and
Hanna Sumita Randomized Strategies for Robust
Combinatorial Optimization with
Approximate Separation . . . . . . . . . 566--584
Pierre Fraigniaud and
Pedro Montealegre and
Ivan Rapaport and
Ioan Todinca A Meta-Theorem for Distributed
Certification . . . . . . . . . . . . . 585--612
Patrizio Angelini and
Michael A. Bekos and
Giordano Da Lozzo and
Martin Gronemann and
Fabrizio Montecchiani and
Alessandra Tappini Recognizing Map Graphs of Bounded
Treewidth . . . . . . . . . . . . . . . 613--637
Valentin Bartier and
Nicolas Bousquet and
Jihad Hanna and
Amer E. Mouawad and
Sebastian Siebertz Token Sliding on Graphs of Girth Five 638--655
Jin-Yi Cai and
Ashwin Maran Counting Cycles on Planar Graphs in
Subexponential Time . . . . . . . . . . 656--693
Cristina Bazgan and
Henning Fernau Preface of the Special Issue Dedicated
to Selected Papers from IWOCA 2022 . . . 695--696
Oswin Aichholzer and
Ruy Fabila-Monroy and
Philipp Kindermann and
Irene Parada and
Rosna Paul and
Daniel Perz and
Patrick Schnider and
Birgit Vogtenhuber Perfect Matchings with Crossings . . . . 697--716
Stepan Artamonov and
Maxim Babenko Faster Algorithm for Finding Maximum
1-Restricted Simple 2-Matchings . . . . 717--734
Hideo Bannai and
Tomohiro I. and
Tomasz Kociumaka and
Dominik Köppl and
Simon J. Puglisi Computing Longest Lyndon Subsequences
and Longest Common Lyndon Subsequences 735--756
Pierre Bergé and
Anthony Busson and
Carl Feghali and
Rémi Watrigant 1-Extendability of Independent Sets . . 757--781
Jan Bok and
Ji\vrí Fiala and
Nikola Jedli\vcková and
Jan Kratochvíl and
Pawe\l Rz\ka\.zewski List Covering of Regular Multigraphs
with Semi-edges . . . . . . . . . . . . 782--807
Tesshu Hanaka and
Hironori Kiya and
Hirotaka Ono and
Kanae Yoshiwatari Winner Determination Algorithms for
Graph Games with Matching Structures . . 808--824
Felicia Lucke and
Felix Mann Reducing Graph Parameters by
Contractions and Deletions . . . . . . . 825--851
Takuya Mieno and
Mitsuru Funakoshi Data Structures for Computing Unique
Palindromes in Static and Non-Static
Strings . . . . . . . . . . . . . . . . 852--873
Charis Papadopoulos and
Spyridon Tzimas Computing a Minimum Subset Feedback
Vertex Set on Chordal Graphs
Parameterized by Leafage . . . . . . . . 874--906
Xiangyu Guo and
Shi Li and
Kelin Luo and
Yuhao Zhang Minimizing the Maximum Flow Time in the
Online Food Delivery Problem . . . . . . 907--943
Leslie Ann Goldberg and
Marc Roth Parameterised and Fine-Grained Subgraph
Counting, Modulo 2 . . . . . . . . . . . 944--1005
Ishay Haviv On Finding Constrained Independent Sets
in Cycles . . . . . . . . . . . . . . . 1006--1030
Tomasz Kociumaka and
Gonzalo Navarro and
Francisco Olivares Near-Optimal Search Time in $ \delta
$-Optimal Space, and Vice Versa . . . . 1031--1056
Sumanta Ghosh and
Rohit Gurjar and
Roshan Raj A Deterministic Parallel Reduction from
Weighted Matroid Intersection Search to
Decision . . . . . . . . . . . . . . . . 1057--1079
Benjamin Qi On Maximizing Sums of Non-monotone
Submodular and Linear Functions . . . . 1080--1134
Liting Huang and
Wei Yu and
Zhaohui Liu Approximation Algorithms for the
Min--Max Mixed Rural Postmen Cover
Problem and Its Variants . . . . . . . . 1135--1162
Joanna Raczek Complexity Issues on of Secondary
Domination Number . . . . . . . . . . . 1163--1172
Moran Feldman and
Ariel Szarf Maximum Matching Sans Maximal Matching:
A New Approach for Finding Maximum
Matchings in the Data Stream Model . . . 1173--1209
Marten Maack and
Friedhelm Meyer auf der Heide and
Simon Pukrop Server Cloud Scheduling . . . . . . . . 1210--1245
Liad Blumrosen and
Shahar Dobzinski Combinatorial Reallocation Mechanisms 1246--1262
Miriam Münch and
Ignaz Rutter and
Peter Stumpf Partial and Simultaneous Transitive
Orientations via Modular Decompositions 1263--1292