Conferences in DBLP
Mikkel Thorup Dynamic Graph Algorithms with Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige Coping with the NP-Hardness of the Graph Bandwidth Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Esko Ukkonen Toward Complete Genome Data Mining in Computational Biology. [Citation Graph (0, 0)][DBLP ] Conf ] Rasmus Pagh A New Trade-Off for Deterministic Dictionaries. [Citation Graph (0, 0)][DBLP ] Conf ] John Iacono Improved Upper Bounds for Pairing Heaps. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen Alstrup , Jacob Holm , Mikkel Thorup Maintaining Center and Median in Dynamic Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Gerth Stølting Brodal , Riko Jacob Dynamic Planar Convex Hull with Optimal Query Time. [Citation Graph (0, 0)][DBLP ] Conf ] Lyudmil Aleksandrov , Hristo Djidjev A Dynamic Algorithm for Maintaining Graph Partitions. [Citation Graph (0, 0)][DBLP ] Conf ] Michael A. Bender , Saurabh Sethia , Steven Skiena Data Structures for Maintaining Set Partitions. [Citation Graph (0, 0)][DBLP ] Conf ] Jochen Alber , Hans L. Bodlaender , Henning Fernau , Rolf Niedermeier Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Arvind Gupta , Naomi Nishimura , Andrzej Proskurowski , Prabhakar Ragde Embeddings of k -Connected Graphs of Pathwidth k . [Citation Graph (0, 0)][DBLP ] Conf ] Naomi Nishimura , Prabhakar Ragde , Dimitrios M. Thilikos On Graph Powers for Leaf-Labeled Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Anne Berry , Jean Paul Bordat , Pinar Heggernes Recognizing Weakly Triangulated Graphs by Edge Separability. [Citation Graph (0, 0)][DBLP ] Conf ] Bala Kalyanasundaram , John Noga , Kirk Pruhs , Gerhard J. Woeginger Caching for Web Searching. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Azar , Leah Epstein On-Line Scheduling with Precedence Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Vincenzo Liberatore Scheduling Jobs Before Shut-Down. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Azar , Leah Epstein , Rob van Stee Resource Augmentation in Load Balancing. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Azar , Joan Boyar , Lene M. Favrholdt , Kim S. Larsen , Morten N. Nielsen Fair versus Unrestricted Bin Packing. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman A d /2 Approximation for Maximum Weight Independent Set in d -Claw Free Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] David Peleg Approximation Algorithms for the Label-CoverMAX and Red-Blue Set Cover Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Refael Hassin , Shlomi Rubinstein Approximation Algorithms for Maximum Linear Arrangement. [Citation Graph (0, 0)][DBLP ] Conf ] Srinivas Doddi , Madhav V. Marathe , S. S. Ravi , David Scot Taylor , Peter Widmayer Approximation Algorithms for Clustering to Minimize the Sum of Diameters. [Citation Graph (0, 0)][DBLP ] Conf ] Refael Hassin , Shlomi Rubinstein Robust Matchings and Maximum Clustering. [Citation Graph (0, 0)][DBLP ] Conf ] Robert W. Irving , David Manlove , Sandy Scott The Hospitals/Residents Problem with Ties. [Citation Graph (0, 0)][DBLP ] Conf ] Yefim Dinitz , Ronit Nossenson Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Toshimasa Ishii , Hiroshi Nagamochi On the Minimum Augmentation of an l -Connected Graph to a k -Connected Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Kouji Arata , Satoru Iwata , Kazuhisa Makino , Satoru Fujishige Locating Sources to Meet Flow Demands in Undirected Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim Gudmundsson , Christos Levcopoulos , Giri Narasimhan Improved Greedy Algorithms for Constructing Sparse Geometric Spanners. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Leonidas J. Guibas , Sariel Har-Peled , Alexander Rabinovitch , Micha Sharir Computing the Penetration Depth of Two Convex Polytopes in 3D. [Citation Graph (0, 0)][DBLP ] Conf ] Leonidas J. Guibas , Jack Snoeyink , Li Zhang Compact Voronoi Diagrams for Moving Convex Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Sunil Arya , Siu-Wing Cheng , David M. Mount , Ramesh Hariharan Efficient Expected-Case Algorithms for Planar Point Location. [Citation Graph (0, 0)][DBLP ] Conf ] Leonidas Palios A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Yang Kao , Jared Samet , Wing-Kin Sung The Enhanced Double Digest Problem for DNA Physical Mapping. [Citation Graph (0, 0)][DBLP ] Conf ] Tetsuo Shibuya Generalization of a Suffix Tree for RNA Structural Pattern Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Claus Rick Efficient Computation of All Longest Common Subsequences. [Citation Graph (0, 0)][DBLP ] Conf ] Gayathri Venkataraman , Sartaj Sahni , Srabani Mukhopadhyaya A Blocked All-Pairs Shortest-Path Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Arge , Gerth Stølting Brodal , Laura Toma On External-Memory MST, SSSP, and Multi-way Planar Graph Separation. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Arge , Jakob Pagter I/O-Space Trade-Offs. [Citation Graph (0, 0)][DBLP ] Conf ] Subhash Suri , Tuomas Sandholm , Priyank Ramesh Warkhede Optimal Flow Aggregation. [Citation Graph (0, 0)][DBLP ] Conf ] Tetsuo Asano , Tomomi Matsui , Takeshi Tokuyama On the Complexities of the Optimal Rounding Problems of Sequences and Matrices. [Citation Graph (0, 0)][DBLP ] Conf ] Shlomo Ahal , Yuri Rabinovich On the Complexity of the Sub-permutation Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Damaschke Parallel Attribute-Efficient Learning of Monotone Boolean Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuhisa Makino , Masafumi Yamashita , Tiko Kameda Max- and Min-Neighborhood Monopolies. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Björklund Optimal Adaptive Fault Diagnosis of Hypercubes. [Citation Graph (0, 0)][DBLP ] Conf ] Grzegorz Stachowiak Fibonacci Correction Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Ferdinando Cicalese , Ugo Vaccaro , Daniele Mundici Least Adaptive Optimal Search with Unreliable Tests. [Citation Graph (0, 0)][DBLP ] Conf ] 