Conferences in DBLP
Gilles Brassard , Anne Broadbent , Alain Tapp Multi-party Pseudo-Telepathy. [Citation Graph (0, 0)][DBLP ] Conf ] Oswin Aichholzer , Franz Aurenhammer , Hannes Krasser Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips. [Citation Graph (0, 0)][DBLP ] Conf ] Tamal K. Dey , Joachim Giesen , Samrat Goswami Shape Segmentation and Matching with Flow Discretization. [Citation Graph (0, 0)][DBLP ] Conf ] Jijun Tang , Bernard M. E. Moret Phylogenetic Reconstruction from Gene-Rearrangement Data with Unequal Gene Content. [Citation Graph (0, 0)][DBLP ] Conf ] Patricia A. Evans , Andrew D. Smith Toward Optimal Motif Enumeration. [Citation Graph (0, 0)][DBLP ] Conf ] Behdad Esfahbod , Mohammad Ghodsi , Ali Sharifi Common-Deadline Lazy Bureaucrat Scheduling Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Anshul Kothari , Subhash Suri , Yunhong Zhou Bandwidth-Constrained Allocation in Grid Computing. [Citation Graph (0, 0)][DBLP ] Conf ] Sudipta Sengupta Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection. [Citation Graph (0, 0)][DBLP ] Conf ] Qingmin Shi , Joseph JáJá Fast Algorithms for a Class of Temporal Range Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Amr Elmasry Distribution-Sensitive Binomial Queues. [Citation Graph (0, 0)][DBLP ] Conf ] Gianni Franceschini , Roberto Grossi Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Micha Sharir , Shakhar Smorodinsky Extremal Configurations and Levels in Pseudoline Arrangements. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Ziegler Fast Relative Approximation of Potential Fields. [Citation Graph (0, 0)][DBLP ] Conf ] Sándor P. Fekete , Henk Meijer The One-Round Voronoi Game Replayed. [Citation Graph (0, 0)][DBLP ] Conf ] Susanne Albers , Markus Büttner Integrated Prefetching and Caching with Read and Write Requests. [Citation Graph (0, 0)][DBLP ] Conf ] Jens S. Frederiksen , Kim S. Larsen Online Seat Reservations via Offine Seating Arrangements. [Citation Graph (0, 0)][DBLP ] Conf ] R. Sai Anand , Thomas Erlebach Routing and Call Control Algorithms for Ring Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Dorothea Wagner Algorithms and Models for Railway Optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Müller-Hannemann , Sven Peyer Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles. [Citation Graph (0, 0)][DBLP ] Conf ] Christian A. Duncan Multi-way Space Partitioning Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Keith B. Frikken , Mikhail J. Atallah Cropping-Resilient Segmented Multiple Watermarking. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Braß , Eowyn Cenek , Christian A. Duncan , Alon Efrat , Cesim Erten , Dan Ismailescu , Stephen G. Kobourov , Anna Lubiw , Joseph S. B. Mitchell On Simultaneous Planar Graph Embeddings. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel A. Spielman , Shang-Hua Teng Smoothed Analysis (Motivation and Discrete Models). [Citation Graph (0, 0)][DBLP ] Conf ] Rachel Matichin , David Peleg Approximation Algorithm for Hotlink Assignments in Web Directories. [Citation Graph (0, 0)][DBLP ] Conf ] Gill Barequet , Michael T. Goodrich , Chris Riley Drawing Graphs with Large Vertices and Thick Edges. [Citation Graph (0, 0)][DBLP ] Conf ] Nicholas J. A. Harvey , Richard E. Ladner , László Lovász , Tami Tamir Semi-matchings for Bipartite Graphs and Load Balancing. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein The Traveling Salesman Problem for Cubic Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Solomon , Paul Sutcliffe , Raymond Lister Sorting Circular Permutations by Reversal. . [Citation Graph (0, 0)][DBLP ] Conf ] Leszek Gasieniec , Andrzej Lingas An Improved Bound on Boolean Matrix Multiplication for Highly Clustered Data. [Citation Graph (0, 0)][DBLP ] Conf ] Amihood Amir , Gad M. Landau , Moshe Lewenstein , Dina Sokol Dynamic Text and Static Pattern Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Amihood Amir , Ayelet Butman , Moshe Lewenstein , Ely Porat Real Two Dimensional Scaled Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjiv Kapoor , Xiang-Yang Li Proximity Structures for Geometric Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Oswin Aichholzer , Günter Rote , Bettina Speckmann , Ileana Streinu The Zigzag Path of a Pseudo-Triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Csaba D. Tóth Alternating Paths along Orthogonal Segments. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Karpinski , Ion I. Mandoiu , Alexander Olshevsky , Alexander Zelikovsky Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Mattias Andersson , Joachim Gudmundsson , Christos Levcopoulos Chips on Wafers. [Citation Graph (0, 0)][DBLP ] Conf ] Vinhthuy T. Phan , Steven Skiena , Pavel Sumazin A Model for Analyzing Black-Box Optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Evanthia Papadopoulou On the Hausdorff Voronoi Diagram of Point Clusters in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] David Bremner , Erik D. Demaine , Jeff Erickson , John Iacono , Stefan Langerman , Pat Morin , Godfried T. Toussaint Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. [Citation Graph (0, 0)][DBLP ] Conf ] Mark de Berg , Herman J. Haverkort Significant-Presence Range Queries in Categorical Data. [Citation Graph (0, 0)][DBLP ] Conf ] Elena Prieto , Christian Sloper Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms - The Case of k-Internal Spanning Tree. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesh Raman , Saket Saurabh Parameterized Complexity of Directed Feedback Set Problems in Tournaments. [Citation Graph (0, 0)][DBLP ] Conf ] Huaming Zhang , Xin He Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Michael R. Fellows New Directions and New Challenges in Algorithm Design and Complexity, Parameterized. [Citation Graph (0, 0)][DBLP ] Conf ] 