|
|
Conferences in DBLP
(walcom)
2009 (conf/walcom/2009)
A Separator Theorem for String Graphs and Its Applications. [Citation Graph (, )][DBLP]
Foundations of Exact Rounding. [Citation Graph (, )][DBLP]
Approximating Shortest Paths in Graphs. [Citation Graph (, )][DBLP]
Line Transversals and Pinning Numbers. [Citation Graph (, )][DBLP]
Algorithms for Computing Diffuse Reflection Paths in Polygons. [Citation Graph (, )][DBLP]
Shortest Gently Descending Paths. [Citation Graph (, )][DBLP]
All Farthest Neighbors in the Presence of Highways and Obstacles. [Citation Graph (, )][DBLP]
Improved Algorithm for a Widest 1-Corner Corridor. [Citation Graph (, )][DBLP]
Maximum Neighbour Voronoi Games. [Citation Graph (, )][DBLP]
On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem. [Citation Graph (, )][DBLP]
Colinear Coloring on Graphs. [Citation Graph (, )][DBLP]
Recursive Generation of 5-Regular Planar Graphs. [Citation Graph (, )][DBLP]
Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract). [Citation Graph (, )][DBLP]
Generating All Triangulations of Plane Graphs (Extended Abstract). [Citation Graph (, )][DBLP]
Recognition of Unigraphs through Superposition of Graphs (Extended Abstract). [Citation Graph (, )][DBLP]
Random Generation and Enumeration of Proper Interval Graphs. [Citation Graph (, )][DBLP]
A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs. [Citation Graph (, )][DBLP]
Minmax Tree Cover in the Euclidean Space. [Citation Graph (, )][DBLP]
Network Design with Weighted Degree Constraints. [Citation Graph (, )][DBLP]
Minimum Cuts of Simple Graphs in Almost Always Linear Time. [Citation Graph (, )][DBLP]
The Generalized Stable Allocation Problem. [Citation Graph (, )][DBLP]
Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings. [Citation Graph (, )][DBLP]
Core and Conditional Core Path of Specified Length in Special Classes of Graphs. [Citation Graph (, )][DBLP]
The Planar k-Means Problem is NP-Hard. [Citation Graph (, )][DBLP]
On the Computational Complexity of Monotone Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. [Citation Graph (, )][DBLP]
Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(nlogn) Area (Extended Abstract). [Citation Graph (, )][DBLP]
Matched Drawability of Graph Pairs and of Graph Triples. [Citation Graph (, )][DBLP]
An Improved Upward Planarity Testing Algorithm and Related Applications. [Citation Graph (, )][DBLP]
Spherical-Rectangular Drawings. [Citation Graph (, )][DBLP]
The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. [Citation Graph (, )][DBLP]
The Minimal Manhattan Network Problem in Three Dimensions. [Citation Graph (, )][DBLP]
Shape Matching by Random Sampling. [Citation Graph (, )][DBLP]
Object Caching for Queries and Updates. [Citation Graph (, )][DBLP]
|
