Conferences in DBLP
Mihalis Yannakakis Approximation of Multiobjective Optimization Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Ferran Hurtado , Giuseppe Liotta , Henk Meijer Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Marshall W. Bern , David Eppstein Optimal Möbius Transformations for Information Visualization and Meshing. [Citation Graph (0, 0)][DBLP ] Conf ] Philip M. Long Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Samarjit Chakraborty , Thomas Erlebach , Lothar Thiele On the Complexity of Scheduling Conditional Real-Time Code. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Lars Arge , Jan Vahrenhold Time Responsive External Data Structures for Moving Points. [Citation Graph (0, 0)][DBLP ] Conf ] Menelaos I. Karavelas Voronoi Diagrams for Moving Disks and Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Naomi Nishimura , Prabhakar Ragde , Dimitrios M. Thilikos Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Espelage , Frank Gurski , Egon Wanke Deciding Clique-Width for Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP ] Conf ] Vladlen Koltun Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Marshall W. Bern , David Eppstein Optimization over Zonotopes and Training Support Vector Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Mark de Berg , Sariel Har-Peled , Mark H. Overmars , Micha Sharir , Jan Vahrenhold Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Amitabha Bagchi , Amitabh Chaudhary , Rahul Garg , Michael T. Goodrich , Vijay Kumar Seller-Focused Algorithms for Online Auctioning. [Citation Graph (0, 0)][DBLP ] Conf ] Edith Cohen , Haim Kaplan , Uri Zwick Competitive Analysis of the LRFU Paging Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Avrim Blum , Adam Kalai , Jon M. Kleinberg Admission Control to Minimize Rejections. [Citation Graph (0, 0)][DBLP ] Conf ] Mikhail J. Atallah , Wenliang Du Secure Multi-party Computational Geometry. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Anil Maheshwari , Pat Morin , Jason Morrison The Grid Placement Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Esther M. Arkin , Sándor P. Fekete , Ferran Hurtado , Joseph S. B. Mitchell , Marc Noy , Vera Sacristan , Saurabh Sethia On the Reflexivity of Point Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Refael Hassin , Shlomi Rubinstein A 7/8-Approximation Algorithm for Metric Max TSP. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Erlebach , Hans Kellerer , Ulrich Pferschy Approximating Multi-objective Knapsack Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrik Brandes , Sabine Cornelsen Visual Ranking of Link Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Xin He A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Haim Kaplan , Tova Milo Short and Simple Labels for Small Distances and Other Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Björklund , Andrzej Lingas Fast Boolean Matrix Multiplication for Highly Clustered Data. [Citation Graph (0, 0)][DBLP ] Conf ] Adrian Dumitrescu , János Pach Partitioning Colored Point Sets into Monochromatic Parts. [Citation Graph (0, 0)][DBLP ] Conf ] Songrit Maneewongvatana , David M. Mount The Analysis of a Probabilistic Approach to Nearest Neighbor Searching. [Citation Graph (0, 0)][DBLP ] Conf ] Anil Maheshwari , Michiel H. M. Smid , Norbert Zeh I/O-Efficient Shortest Path Queries in Geometric Spanners. [Citation Graph (0, 0)][DBLP ] Conf ] Sándor P. Fekete , Ekkehard Köhler , Jürgen Teich Higher-Dimensional Packing with Order Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Nir Menakerman , Raphael Rom Bin Packing with Item Fragmentation. [Citation Graph (0, 0)][DBLP ] Conf ] Feodor F. Dragan , Andrew B. Kahng , Ion I. Mandoiu , Sudhakar Muddu , Alexander Zelikovsky Practical Approximation Algorithms for Separable Packing Linear Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Thomson Leighton The Challenges of Delivering Content on the Internet. [Citation Graph (0, 0)][DBLP ] Conf ] Walter Didimo , Maurizio Pizzonia Upward Embeddings and Orientations of Undirected Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Eiglsperger , Michael Kaufmann An Approach for Mixed Upward Planarization. [Citation Graph (0, 0)][DBLP ] Conf ] David A. Bader , Bernard M. E. Moret , Mi Yan A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study. [Citation Graph (0, 0)][DBLP ] Conf ] Zhi-Zhong Chen , Tao Jiang , Guo-Hui Lin Computing Phylogenetic Roots with Bounded Degrees and Errors. [Citation Graph (0, 0)][DBLP ] Conf ] Ivaylo Ilinkin , Ravi Janardan , Jayanth Majhi , Jörg Schwerdt , Michiel H. M. Smid , Ram D. Sriram A Decomposition-Based Approach to Layered Manufacturing. [Citation Graph (0, 0)][DBLP ] Conf ] Esther M. Arkin , Michael A. Bender , Erik D. Demaine , Martin L. Demaine , Joseph S. B. Mitchell , Saurabh Sethia , Steven Skiena When Can You Fold a Map? [Citation Graph (0, 0)][DBLP ] Conf ] Rolf Fagerberg , Rune E. Jensen , Kim S. Larsen Search Trees with Relaxed Balance and Near-Optimal Height. [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Raman , Venkatesh Raman , S. Srinivasa Rao Succinct Dynamic Data Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Binay K. Bhattacharya , Asish Mukhopadhyay , Giri Narasimhan Optimal Algorithms for Two-Guard Walkability of Simple Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] John H. Reif , Zheng Sun Movement Planning in the Presence of Flows. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein Small Maximal Independent Sets and Faster Exact Graph Coloring. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Arge , Ulrich Meyer , Laura Toma , Norbert Zeh On External-Memory Planar Depth First Search. [Citation Graph (0, 0)][DBLP ] Conf ] 