Conferences in DBLP
Bubblesort and Juggling Sequences. [Citation Graph (, )][DBLP ] A Proof of the Molecular Conjecture. [Citation Graph (, )][DBLP ] Exact Algorithms for Dominating Clique Problems. [Citation Graph (, )][DBLP ] Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming. [Citation Graph (, )][DBLP ] Exact Algorithms for the Bottleneck Steiner Tree Problem. [Citation Graph (, )][DBLP ] Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm. [Citation Graph (, )][DBLP ] On Protein Structure Alignment under Distance Constraint. [Citation Graph (, )][DBLP ] Max-Coloring Paths: Tight Bounds and Extensions. [Citation Graph (, )][DBLP ] The Complexity of Solving Stochastic Games on Graphs. [Citation Graph (, )][DBLP ] Computational Complexity of Cast Puzzles. [Citation Graph (, )][DBLP ] New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body. [Citation Graph (, )][DBLP ] Reconstructing Numbers from Pairwise Function Values. [Citation Graph (, )][DBLP ] Hilbert's Thirteenth Problem and Circuit Complexity. [Citation Graph (, )][DBLP ] Interval Stabbing Problems in Small Integer Ranges. [Citation Graph (, )][DBLP ] Online Sorted Range Reporting. [Citation Graph (, )][DBLP ] Data Structures for Approximate Orthogonal Range Counting. [Citation Graph (, )][DBLP ] Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time. [Citation Graph (, )][DBLP ] Untangled Monotonic Chains and Adaptive Range Search. [Citation Graph (, )][DBLP ] Geodesic Spanners on Polyhedral Surfaces. [Citation Graph (, )][DBLP ] Approximating Points by a Piecewise Linear Function: I. [Citation Graph (, )][DBLP ] Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers. [Citation Graph (, )][DBLP ] Computing the Map of Geometric Minimal Cuts. [Citation Graph (, )][DBLP ] On the Camera Placement Problem. [Citation Graph (, )][DBLP ] Graph Orientations with Set Connectivity Requirements. [Citation Graph (, )][DBLP ] A Linear Vertex Kernel for Maximum Internal Spanning Tree. [Citation Graph (, )][DBLP ] Geometric Minimum Diameter Minimum Cost Spanning Tree Problem. [Citation Graph (, )][DBLP ] On Shortest Disjoint Paths in Planar Graphs. [Citation Graph (, )][DBLP ] An Optimal Labeling for Node Connectivity. [Citation Graph (, )][DBLP ] 1-Bounded Space Algorithms for 2-Dimensional Bin Packing. [Citation Graph (, )][DBLP ] On the Advice Complexity of Online Problems. [Citation Graph (, )][DBLP ] Online Knapsack Problems with Limited Cuts. [Citation Graph (, )][DBLP ] Shifting Strategy for Geometric Graphs without Geometry. [Citation Graph (, )][DBLP ] Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics. [Citation Graph (, )][DBLP ] Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time. [Citation Graph (, )][DBLP ] Minimum Covering with Travel Cost. [Citation Graph (, )][DBLP ] Route-Enabling Graph Orientation Problems. [Citation Graph (, )][DBLP ] Complexity of Approximating the Vertex Centroid of a Polyhedron. [Citation Graph (, )][DBLP ] On the Tightness of the Buhrman-Cleve-Wigderson Simulation. [Citation Graph (, )][DBLP ] Min-Energy Scheduling for Aligned Jobs in Accelerate Model. [Citation Graph (, )][DBLP ] Generalized Reduction to Compute Toric Ideals. [Citation Graph (, )][DBLP ] Linear and Sublinear Time Algorithms for Basis of Abelian Groups. [Citation Graph (, )][DBLP ] Good Programming in Transactional Memory. [Citation Graph (, )][DBLP ] Induced Packing of Odd Cycles in a Planar Graph. [Citation Graph (, )][DBLP ] On the Infinitesimal Rigidity of Bar-and-Slider Frameworks. [Citation Graph (, )][DBLP ] Exploration of Periodically Varying Graphs. [Citation Graph (, )][DBLP ] Parameterized Complexity of Arc-Weighted Directed Steiner Problems. [Citation Graph (, )][DBLP ] Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries. [Citation Graph (, )][DBLP ] Minimum Cycle Bases of Weighted Outerplanar Graphs. [Citation Graph (, )][DBLP ] Bandwidth on AT-Free Graphs. [Citation Graph (, )][DBLP ] Editing Graphs into Disjoint Unions of Dense Clusters. [Citation Graph (, )][DBLP ] A Certifying Algorithm for 3-Colorability of P 5 -Free Graphs. [Citation Graph (, )][DBLP ] Parameterizing Cut Sets in a Graph by the Number of Their Components. [Citation Graph (, )][DBLP ] Inapproximability of Maximal Strip Recovery. [Citation Graph (, )][DBLP ] The Complexity of Perfect Matching Problems on Dense Hypergraphs. [Citation Graph (, )][DBLP ] Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria. [Citation Graph (, )][DBLP ] The Identity Correspondence Problem and Its Applications. [Citation Graph (, )][DBLP ] An Improved Approximation Algorithm for the Traveling Tournament Problem. [Citation Graph (, )][DBLP ] The Fault-Tolerant Facility Allocation Problem. [Citation Graph (, )][DBLP ] Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks. [Citation Graph (, )][DBLP ] Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. [Citation Graph (, )][DBLP ] The Directed Hausdorff Distance between Imprecise Point Sets. [Citation Graph (, )][DBLP ] Computing Multidimensional Persistence. [Citation Graph (, )][DBLP ] Locating an Obnoxious Line among Planar Objects. [Citation Graph (, )][DBLP ] Finding Fullerene Patches in Polynomial Time. [Citation Graph (, )][DBLP ] Convex Drawings of Internally Triconnected Plane Graphs on O (n 2 ) Grids. [Citation Graph (, )][DBLP ] A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths. [Citation Graph (, )][DBLP ] Deletion without Rebalancing in Multiway Search Trees. [Citation Graph (, )][DBLP ] Counting in the Presence of Memory Faults. [Citation Graph (, )][DBLP ] A Simple, Fast, and Compact Static Dictionary. [Citation Graph (, )][DBLP ] Reconstructing Polygons from Scanner Data. [Citation Graph (, )][DBLP ] Computing Large Matchings in Planar Graphs with Fixed Minimum Degree. [Citation Graph (, )][DBLP ] Crossing-Free Acyclic Hamiltonian Path Completion for Planar st -Digraphs. [Citation Graph (, )][DBLP ] Covering a Graph with a Constrained Forest (Extended Abstract). [Citation Graph (, )][DBLP ] Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs. [Citation Graph (, )][DBLP ] Upward Star-Shaped Polyhedral Graphs. [Citation Graph (, )][DBLP ] Conditional Hardness of Approximating Satisfiable Max 3CSP-q . [Citation Graph (, )][DBLP ] The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract). [Citation Graph (, )][DBLP ] Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. [Citation Graph (, )][DBLP ] Lower Bounds on Fast Searching. [Citation Graph (, )][DBLP ] Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity. [Citation Graph (, )][DBLP ] Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O (n 1 + epsilon ) Time. [Citation Graph (, )][DBLP ] PTAS for k -Tour Cover Problem on the Plane for Moderately Large Values of k . [Citation Graph (, )][DBLP ] New Results on Simple Stochastic Games. [Citation Graph (, )][DBLP ] Worst-Case and Smoothed Analysis of k -Means Clustering with Bregman Divergences. [Citation Graph (, )][DBLP ] Succinct Index for Dynamic Dictionary Matching. [Citation Graph (, )][DBLP ] Range Non-overlapping Indexing. [Citation Graph (, )][DBLP ] Querying Two Boundary Points for Shortest Paths in a Polygonal Domain. [Citation Graph (, )][DBLP ] Pattern Matching for 321-Avoiding Permutations. [Citation Graph (, )][DBLP ] Folding a Better Checkerboard. [Citation Graph (, )][DBLP ] Finding All Approximate Gapped Palindromes. [Citation Graph (, )][DBLP ] General Pseudo-random Generators from Weaker Models of Computation. [Citation Graph (, )][DBLP ] Random Generation and Enumeration of Bipartite Permutation Graphs. [Citation Graph (, )][DBLP ] A Combinatorial Algorithm for Horn Programs. [Citation Graph (, )][DBLP ] Online Maximum Directed Cut. [Citation Graph (, )][DBLP ] Maintaining Nets and Net Trees under Incremental Motion. [Citation Graph (, )][DBLP ] Distributed Scheduling of Parallel Hybrid Computations. [Citation Graph (, )][DBLP ] I/O-Efficient Contour Tree Simplification. [Citation Graph (, )][DBLP ] Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes. [Citation Graph (, )][DBLP ] I/O and Space-Efficient Path Traversal in Planar Graphs. [Citation Graph (, )][DBLP ] Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model. [Citation Graph (, )][DBLP ] Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract). [Citation Graph (, )][DBLP ] Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets. [Citation Graph (, )][DBLP ] On Partitioning a Graph into Two Connected Subgraphs. [Citation Graph (, )][DBLP ] 