Conferences in DBLP
Susanne Albers The Influence of Lookahead in Competitive Paging Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Mikhail J. Atallah , Danny Z. Chen , D. T. Lee An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Yosi Ben-Asher , Dan Gordon , Assaf Schuster Efficient Self Simulation Algorithms for Reconfigurable Arrays. [Citation Graph (0, 0)][DBLP ] Conf ] Paola Bertolazzi , Giuseppe Di Battista , Carlo Mannino , Roberto Tamassia Optimal Upward Planarity Testing of Single-Source Digraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Sandeep N. Bhatt , Gianfranco Bilardi , Geppino Pucci , Abhiram G. Ranade , Arnold L. Rosenberg , Eric J. Schwabe On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Dany Breslauer Saving Comparisons in the Crochemore-Perrin String Matching Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Anne Brüggemann-Klein Unambiguity of Extended Regular Expressions in SGML Document Grammars. [Citation Graph (0, 0)][DBLP ] Conf ] Nader H. Bshouty On the Direct Sum Conjecture in the Straight Line Model. [Citation Graph (0, 0)][DBLP ] Conf ] Robert F. Cohen , Roberto Tamassia Combine and Conquer: a General Technique for Dynamic Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Amitava Datta , Anil Maheshwari , Jörg-Rüdiger Sack Optimal CREW-PRAM Algorithms for Direct Dominance Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Mark de Berg , Marc J. van Kreveld Trekking in the Alps Without Freezing or Getting Tired. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Devillers , Mordecai J. Golin Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Josep Díaz , Maria J. Serna , Jacobo Torán Parallel Approximation Schemes for problems on planar graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Michael R. Fellows , Michael T. Hallett , Harold T. Wareham DNA Physical Mapping: Three Ways Difficult. [Citation Graph (0, 0)][DBLP ] Conf ] Philippe Flajolet , Paul Zimmermann , Bernard Van Cutsem A Calculus of Random Generation. [Citation Graph (0, 0)][DBLP ] Conf ] Ornan Ori Gerstel , Shmuel Zaks The Bit Complexity of Distributed Sorting (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Johann Hagauer , Günter Rote Three-Clustering of Points in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Juraj Hromkovic , Ralf Klasing , Elena Stöhr , Hubert Wagener Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe F. Italiano , Johannes A. La Poutré , Monika Rauch Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Zoran Ivkovic , Errol L. Lloyd Fully Dynamic Algorithms for Bin Packing: Being (mostly) Myopic Helps. [Citation Graph (0, 0)][DBLP ] Conf ] Tibor Jordán Incresing the Vertex-Connectivity in Directed Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Bettina Klinz , Rüdiger Rudolf , Gerhard J. Woeginger On the Recognition of Permuted Bottleneck Monge Matrices. [Citation Graph (0, 0)][DBLP ] Conf ] Ton Kloks , Hans L. Bodlaender , Haiko Müller , Dieter Kratsch Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Kunde Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Karel Lenstra , Marinus Veldhorst The Complexity of Scheduling Trees with Communication Delays (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Ernst W. Mayr , Ralph Werchner Optimal Tree Contraction on the Hypercube and Related Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Mike Paterson Evolution of an Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Sanguthevar Rajasekaran Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection. [Citation Graph (0, 0)][DBLP ] Conf ] Vijaya Ramachandran , Honghua Yang An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Jop F. Sibeyn , Michael Kaufmann , Rajeev Raman Randomized Routing on Meshes with Buses. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Simon , Davide Crippa , Fabian Collenberg On the Distribution of the Transitive Closure in a Random Acyclic Digraph. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Schrijver Complexity of Disjoint Paths Problems in Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Anand Srivastav , Peter Stangier Integer Multicommodity Flows with Reduced Demands. [Citation Graph (0, 0)][DBLP ] Conf ] Sairam Subramanian A Fully Dynamic Data Structure for Reachability in Planar Digraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Dorothea Wagner , Karsten Weihe A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Michael S. Waterman Sequence Comparison and Statistical Significance in Molecular Biology (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Emo Welzl , Barbara Wolfers Surface Reconstruction Between Simple Polygons via Angle Criteria. [Citation Graph (0, 0)][DBLP ] Conf ] Xiao Zhou , Shin-Ichi Nakano , Takao Nishizeki A Linear Algorithm for Edge-Coloring Partial k-Trees. [Citation Graph (0, 0)][DBLP ] Conf ] 