Conferences in DBLP
Jeff Erickson Finding Small Holes. [Citation Graph (0, 0)][DBLP ] Conf ] Guilherme Dias da Fonseca Approximate Range Searching: The Absolute Model. [Citation Graph (0, 0)][DBLP ] Conf ] Yakov Nekrich Orthogonal Range Searching in Linear and Almost-Linear Space. [Citation Graph (0, 0)][DBLP ] Conf ] Kengo Terasawa , Yuzuru Tanaka Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere. [Citation Graph (0, 0)][DBLP ] Conf ] Prabhakar Gubbala , Balaji Raghavachari A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity. [Citation Graph (0, 0)][DBLP ] Conf ] Amitabh Chaudhary , Danny Z. Chen , Rudolf Fleischer , Xiaobo Sharon Hu , Jian Li , Michael T. Niemier , Zhiyi Xie , Hong Zhu Approximating the Maximum Sharing Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Jean Cardinal , Erik D. Demaine , Samuel Fiorini , Gwenaël Joret , Stefan Langerman , Ilan Newman , Oren Weimann The Stackelberg Minimum Spanning Tree Game. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein , Marc J. van Kreveld , Elena Mumford , Bettina Speckmann Edges and Switches, Tunnels and Bridges. [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe Di Battista , Guido Drovandi , Fabrizio Frati How to Draw a Clustered Tree. [Citation Graph (0, 0)][DBLP ] Conf ] Melanie Badent , Emilio Di Giacomo , Giuseppe Liotta Drawing Colored Graphs on Colored Points. [Citation Graph (0, 0)][DBLP ] Conf ] Mikhail J. Atallah , Marina Blanton , Michael T. Goodrich , Stanislas Polu Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric. [Citation Graph (0, 0)][DBLP ] Conf ] Allan Grønlund Jørgensen , Gabriel Moruz , Thomas Mølhave Priority Queues Resilient to Memory Faults. [Citation Graph (0, 0)][DBLP ] Conf ] Fabiano C. Botelho , Rasmus Pagh , Nivio Ziviani Simple and Space-Efficient Minimal Perfect Hash Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Müller-Hannemann , Siamak Tazari A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Ajay Deshpande , Taejung Kim , Erik D. Demaine , Sanjay E. Sarma A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Marc J. van Kreveld , Maarten Löffler , Rodrigo I. Silveira Optimization for First Order Delaunay Triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Tobias Jacobs Constant Factor Approximations for the Hotlink Assignment Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwama , Shuichi Miyazaki , Hiroki Yanagisawa Approximation Algorithms for the Sex-Equal Stable Marriage Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Staal A. Vinterbo A Stab at Approximating Minimum Subadditive Join. [Citation Graph (0, 0)][DBLP ] Conf ] Michael A. Langston Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two Datasets. [Citation Graph (0, 0)][DBLP ] Conf ] Rodrigo I. Silveira , René van Oostrum Flooding Countries and Destroying Dams. [Citation Graph (0, 0)][DBLP ] Conf ] Mark de Berg , Otfried Cheong , Herman J. Haverkort , Jung Gun Lim , Laura Toma I/O-Efficient Flow Modeling on Fat Terrains. [Citation Graph (0, 0)][DBLP ] Conf ] Mark de Berg , Chris Gray Computing the Visibility Map of Fat Objects. [Citation Graph (0, 0)][DBLP ] Conf ] Magnús M. Halldórsson , Elena Losievskaja Independent Sets in Bounded-Degree Hypergraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Glencora Borradaile , Philip N. Klein , Claire Mathieu Steiner Tree in Planar Graphs: An O ( n log n ) Approximation Scheme with Singly-Exponential Dependence on Epsilon. [Citation Graph (0, 0)][DBLP ] Conf ] Patrizio Angelini , Giuseppe Di Battista , Maurizio Patrignani Computing a Minimum-Depth Planar Graph Embedding in O ( n 4 ) Time. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Paz Carmi , Mathieu Couture , Michiel H. M. Smid , Daming Xu On a Family of Strong Geometric Spanners That Admit Local Routing Strategies. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Fürer , Shiva Prasad Kasiviswanathan Spanners for Geometric Intersection Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Aaron Lee , Michiel H. M. Smid On Generalized Diamond Spanners. [Citation Graph (0, 0)][DBLP ] Conf ] Marcin Bienkowski , Jaroslaw Kutylowski The k -Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Gatto , Peter Widmayer On the Robustness of Graham's Algorithm for Online Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Leah Epstein , Rob van Stee Improved Results for a Memory Allocation Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Oswin Aichholzer , Franz Aurenhammer , Thomas Hackl , Bert Jüttler , Margot Oberneder , Zbynek Sír Computational and Structural Advantages of Circular Boundary Representation. [Citation Graph (0, 0)][DBLP ] Conf ] Dominique Attali , Herbert Edelsbrunner , John Harer , Yuriy Mileyko Alpha-Beta Witness Complexes. [Citation Graph (0, 0)][DBLP ] Conf ] Therese C. Biedl , Anna Lubiw , Michael J. Spriggs Cauchy's Theorem and Edge Lengths of Convex Polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Magnús M. Halldórsson , Christian Knauer , Andreas Spillner , Takeshi Tokuyama Fixed-Parameter Tractability for Non-Crossing Spanning Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Jianer Chen , Fedor V. Fomin , Yang Liu 0002 , Songjian Lu , Yngve Villanger Improved Algorithms for the Feedback Vertex Set Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Faisal N. Abu-Khzam Kernelization Algorithms for d-Hitting Set Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Maarten Löffler , Marc J. van Kreveld Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points. [Citation Graph (0, 0)][DBLP ] Conf ] Oswin Aichholzer , Thomas Hackl , Michael Hoffmann , Clemens Huemer , Attila Pór , Francisco Santos , Bettina Speckmann , Birgit Vogtenhuber Maximizing Maximal Angles for Plane Straight-Line Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Eynat Rafalin , Diane L. Souvaine , Csaba D. Tóth Cuttings for Disks and Axis-Aligned Rectangles. [Citation Graph (0, 0)][DBLP ] Conf ] Jiong Guo , Johannes Uhlmann Kernelization and Complexity Results for Connectivity Augmentation Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Jianer Chen , Yang Liu 0002 , Songjian Lu An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Fedor V. Fomin , Petr A. Golovach , Jan Kratochvíl , Dieter Kratsch , Mathieu Liedloff Branch and Recharge: Exact Algorithms for Generalized Domination. [Citation Graph (0, 0)][DBLP ] Conf ] Deepak Ajwani , Saurabh Ray , Raimund Seidel , Hans Raj Tiwary On Computing the Centroid of the Vertices of an Arrangement and Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Binay K. Bhattacharya , Qiaosheng Shi Optimal Algorithms for the Weighted p -Center Problems on the Real Line for Small p . [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Shiva Prasad Kasiviswanathan Faster Approximation of Distances in Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jörg Derungs , Riko Jacob , Peter Widmayer Approximate Shortest Paths Guided by a Small Index. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Farach-Colton , Miguel A. Mosteiro Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model. [Citation Graph (0, 0)][DBLP ] Conf ] Senjuti Basu Roy , Gautam Das , Sajal Das Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field. [Citation Graph (0, 0)][DBLP ] Conf ] Lukasz Kowalik , Marcin Mucha 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Remy , Reto Spöhel , Andreas Weißl On Euclidean Vehicle Routing with Allocation. [Citation Graph (0, 0)][DBLP ] Conf ] Ge Nong , Sen Zhang Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets. [Citation Graph (0, 0)][DBLP ] Conf ] Orgad Keller , Tsvi Kopelowitz , Moshe Lewenstein Range Non-overlapping Indexing and Successive List Indexing. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein , Michael T. Goodrich Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters. [Citation Graph (0, 0)][DBLP ] Conf ] Hisashi Koga Dynamic TCP Acknowledgment with Sliding Window. [Citation Graph (0, 0)][DBLP ] Conf ] 