Conferences in DBLP
Charles E. Leiserson Design and Analysis of Dynamic Multithreaded Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Gerth Stølting Brodal Cache-Oblivious Algorithms and Data Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Kirk Pruhs , Patchrawat Uthaisombut , Gerhard J. Woeginger Getting the Best Response for Your Erg. [Citation Graph (0, 0)][DBLP ] Conf ] Nir Andelman , Yishay Mansour Auctions with Budget Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Bhaskar DasGupta , Ming-Yang Kao Tight Approximability Results for Test Set Problems in Bioinformatics. [Citation Graph (0, 0)][DBLP ] Conf ] Refael Hassin , Danny Segev Robust Subgraphs for Trees and Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Feodor F. Dragan , Chenyu Yan , Irina Lomonosov Collective Tree Spanners of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang W. Bein , Leah Epstein , Lawrence L. Larmore , John Noga Optimally Competitive List Batching. [Citation Graph (0, 0)][DBLP ] Conf ] Joan Boyar , Paul Medvedev The Relative Worst Order Ratio Applied to Seat Reservation. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Fleischer , Mordecai J. Golin , Yan Zhang Online Maintenance of k-Medians and k-Covers on a Line. [Citation Graph (0, 0)][DBLP ] Conf ] Vladlen Koltun , Carola Wenk Matching Polyhedral Terrains Using Overlays of Envelopes. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Nabil H. Mustafa Independent Set of Intersection Graphs of Convex Objects in 2D. [Citation Graph (0, 0)][DBLP ] Conf ] Mark de Berg , Sergio Cabello , Panos Giannopoulos , Christian Knauer , René van Oostrum , Remco C. Veltkamp Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion. [Citation Graph (0, 0)][DBLP ] Conf ] Mee Yee Chan , Danny Z. Chen , Francis Y. L. Chin , Cao An Wang Construction of the Nearest Neighbor Embracing Graph of a Point Set. [Citation Graph (0, 0)][DBLP ] Conf ] Norbert Zeh Connectivity of Graphs Under Edge Flips. [Citation Graph (0, 0)][DBLP ] Conf ] Miroslav Chlebík , Janka Chlebíková Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Michel Habib , Fabien de Montgolfier , Christophe Paul A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Gatto , Björn Glaus , Riko Jacob , Leon Peeters , Peter Widmayer Railway Delay Management: Exploring Its Algorithmic Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Amr Elmasry Layered Heaps. [Citation Graph (0, 0)][DBLP ] Conf ] Ran Mendelson , Robert Endre Tarjan , Mikkel Thorup , Uri Zwick Melding Priority Queues. [Citation Graph (0, 0)][DBLP ] Conf ] Zdenek Dvorak , Jan Kára , Daniel Král , Ondrej Pangrác An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Anders Dessmark , Andrzej Lingas , Eva-Marta Lundell Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuhisa Makino , Takeaki Uno New Algorithms for Enumerating All Maximal Cliques. [Citation Graph (0, 0)][DBLP ] Conf ] Adi Avidor , Michael Langberg The Multi-multiway Cut Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Lim , Zhou Xu The Bottleneck Problem with Minimum Quantity Commitments. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Azar , Shai Taub All-Norm Approximation for Scheduling on Identical Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Jansen Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Lim , Brian Rodrigues , Zhou Xu Approximation Schemes for the Crane Scheduling Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Raja Jothi , Balaji Raghavachari Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwama , Shuichi Miyazaki , Kazuya Okamoto A (2-c(log N/N))-Approximation Algorithm for the Stable Marriage Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Jansen , Guochuan Zhang Maximizing the Number of Packed Rectangles. [Citation Graph (0, 0)][DBLP ] Conf ] Giovanni Manzini Two Space Saving Tricks for Linear Time LCP Array Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Mikkel Thorup Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles. [Citation Graph (0, 0)][DBLP ] Conf ] Leszek Gasieniec , Tomasz Radzik , Qin Xin Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Leah Epstein , Rob van Stee Online Scheduling of Splittable Tasks in Peer-to-Peer Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Patchrawat Uthaisombut The Optimal Online Algorithms for Minimizing Maximum Lateness. [Citation Graph (0, 0)][DBLP ] Conf ] Paz Carmi , Matthew J. Katz Power Assignment in Radio Networks with Two Power Levels. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Hoffmann , Bettina Speckmann , Csaba D. Tóth Pointed Binary Encompassing Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Tetsuo Asano , Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama On Geometric Structure of Global Roundings for Graphs and Range Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Jop F. Sibeyn External Connected Components. [Citation Graph (0, 0)][DBLP ] Conf ] Gerth Stølting Brodal , Rolf Fagerberg , Ulrich Meyer , Norbert Zeh Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Arge , Laura Toma Simplified External Memory Algorithms for Planar DAGs. [Citation Graph (0, 0)][DBLP ] Conf ] 