Conferences in DBLP
Andrew V. Goldberg Recent Developments in Maximum Flow Algorithms (Invited Lecture). [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:1-10 [Conf ] Lyudmil Aleksandrov , Mark Lanthier , Anil Maheshwari , Jörg-Rüdiger Sack An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:11-22 [Conf ] Randeep Bhatia , Sudipto Guha , Samir Khuller , Yoram J. Sussmann Facility Location with Dynamic Distance Function (Extended Abstract). [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:23-34 [Conf ] Klaus Jansen An Approximation Scheme for Bin Packing with Conflicts. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:35-46 [Conf ] Bengt Aspvall , Magnús M. Halldórsson , Fredrik Manne Approximations for the General Block Distribution of a Matrix. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:47-58 [Conf ] Thorsten Graf , Kamakoti Veezhinathan An Optimal Algorithm for Computing Vissible Nearest Foreign Neighbors Among Colored Line Segments. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:59-70 [Conf ] Frank Hoffmann , Christian Icking , Rolf Klein , Klaus Kriegel Moving an Angle Around a Region. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:71-82 [Conf ] Mark de Berg , Matthew J. Katz , Mark H. Overmars , A. Frank van der Stappen , Jules Vleugels Models and Motion Planning. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:83-94 [Conf ] Matthew J. Katz , Klara Kedem , Michael Segal Constrained Square-Center Problems. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:95-106 [Conf ] Gerth Stølting Brodal , Jyrki Katajainen Worst-Case External-Memory Priority Queues. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:107-118 [Conf ] Haim Kaplan , Chris Okasaki , Robert Endre Tarjan Simple Confluently Persistent Catenable Lists (Extended Abstract). [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:119-130 [Conf ] Venkatesh Raman , Sarnath Ramnath Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:131-142 [Conf ] Sridhar Ramachandran , K. Rajasekar , C. Pandu Rangan Probabilistic Data Structures for Priority Queues (Extended Abstract). [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:143-154 [Conf ] David Zuckerman Extractors for Weak Random Sources and Their Applications. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:155-157 [Conf ] Gerth Stølting Brodal , Maria Cristina Pinotti Comparator Networks for Binary Heap Construction. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:158-168 [Conf ] Danny Z. Chen , Jinhui Xu Two-Variable Linear Programming in Parallel. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:169-180 [Conf ] Roberto Grossi , Andrea Pietracaprina , Geppino Pucci Optimal Deterministic Protocols for Mobile Robots on a Grid. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:181-192 [Conf ] Gianluca De Marco , Luisa Gargano , Ugo Vaccaro Concurrent Multicast in Weighted Networks. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:193-204 [Conf ] Johan Håstad Some Recent Strong Inapproximability Results. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:205-209 [Conf ] Elias Dahlhaus Minimal Elimination of Planar Graphs. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:210-221 [Conf ] Bengt Aspvall , Andrzej Proskurowski , Jan Arne Telle Memory Requirements for Table Computations in Partial k-tree Algorithms. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:222-233 [Conf ] Christopher L. Barrett , Riko Jacob , Madhav V. Marathe Formal Language Constrained Path Problems. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:234-245 [Conf ] Edward A. Hirsch Local Search Algorithms for SAT: Worst-Case Analysis. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:246-254 [Conf ] Piotr Berman , Chris Coulston Speed is More Powerful than Claivoyance. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:255-263 [Conf ] Steven S. Seiden Randomized Online Multi-threaded Paging. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:264-275 [Conf ] Meena Mahajan , V. Vinay Determinant: Old Algorithms, New Insights (Extended Abstract). [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:276-287 [Conf ] Jop F. Sibeyn Solving Fundamental Problems on Sparse-Meshes. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:288-299 [Conf ] Nora Sleumer Output-Sensitive Cell Enumeration in Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:300-309 [Conf ] Hans-Martin Will Fast and Efficient Computation of Additively Weighted Voronoi Cells for Applications in Molecular Biology. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:310-321 [Conf ] Boris Aronov , Alon Efrat , Dan Halperin , Micha Sharir On the Number of Regular Vertices of the Union of Jordan Regions. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:322-334 [Conf ] Sandeep Sen , Neelima Gupta Distribution-Sensitive Algorithms. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:335-346 [Conf ]