|
|
Conferences in DBLP
- Noga Alon
Derandomization Via Small Sample Spaces (Abstract). [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:1-3 [Conf]
- Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan
The Randomized Complexity of Maintaining the Minimum. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:4-15 [Conf]
- Monika Rauch Henzinger, Jan Arne Telle
Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:16-27 [Conf]
- Madhav V. Marathe, R. Ravi, Ravi Sundaram
Service-Constrained Network Design Problems. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:28-40 [Conf]
- Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan
Approximate Hypergraph Coloring. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:41-52 [Conf]
- Barun Chandra, Magnús M. Halldórsson
Facility Dispersion and Remote Subgraphs. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:53-65 [Conf]
- R. Ravi, Michel X. Goemans
The Constrained Minimum Spanning Tree Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:66-75 [Conf]
- Hoong Chuin Lau, Osamu Watanabe
Randomized Approximation of the Constraint Satisfaction Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:76-87 [Conf]
- Hartmut Klauck
On the Hardness of Global and Local Approximation. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:88-99 [Conf]
- Takao Asano, Takao Ono, Tomio Hirata
Approximation Algorithms for the Maximum Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:100-111 [Conf]
- Kouichi Hirata, Shinichi Shimozono, Ayumi Shinohara
On the Hardness of Approximating the Minimum Consistent OBDD Problem. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:112-123 [Conf]
- Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:124-135 [Conf]
- Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama
Greedily Finding a Dense Subgraph. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:136-148 [Conf]
- David Fernández-Baca, Giora Slutzki, David Eppstein
Using Sparsification for Parametric Minimum Spanning Tree Problems. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:149-160 [Conf]
- Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer
Vertex Partitioning Problems On Partial k-Trees. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:161-172 [Conf]
- Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle
Making an Arbitrary Filled Graph Minimal by Removing Fill Edges. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:173-184 [Conf]
- Arne Andersson
Sorting and Searching Revisted. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:185-197 [Conf]
- Thore Husfeldt, Theis Rauhe, Søren Skyum
Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:198-211 [Conf]
- Stephen Alstrup, Mikkel Thorup
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:212-222 [Conf]
- Pierre Kelsen
Neighborhood Graphs and Distributed Delta+1-Coloring. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:223-233 [Conf]
- Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
Communication Complexity of Gossiping by Packets. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:234-245 [Conf]
- Teresa M. Przytycka, Lisa Higham
Optimal Cost-Sensitive Distributed Minimum Spanning Tree Algorithm. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:246-258 [Conf]
- Vincenzo Auletta, Angelo Monti, Domenico Parente, Giuseppe Persiano
A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:259-270 [Conf]
- Christos Levcopoulos, Anna Östlin
Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:271-283 [Conf]
- Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad
Visibility with Multiple Reflections. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:284-295 [Conf]
- Christos Levcopoulos, Drago Krznaric
A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:296-308 [Conf]
- Andrej Brodnik, J. Ian Munro
Neighbours on a Grid. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:309-320 [Conf]
- Yossi Azar, Leah Epstein
On Two Dimensional Packing. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:321-332 [Conf]
- Therese C. Biedl
Optimal Orthogonal Drawings of Triconnected Plane Graphs. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:333-344 [Conf]
- Alejandro López-Ortiz, Sven Schuierer
Walking Streets Faster. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:345-356 [Conf]
- Sonne Preminger, Eli Upfal
Safe and Efficient Traffic Laws for Mobile Robots. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:357-367 [Conf]
- Mike Paterson
Progress in Selection. [Citation Graph (1, 0)][DBLP]
SWAT, 1996, pp:368-379 [Conf]
- Gaston H. Gonnet, Steven A. Benner
Probabilistic Ancestral Sequences and Multiple Alignments. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:380-391 [Conf]
- Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract). [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:392-403 [Conf]
- Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina
The Deterministic Complexity of Parallel Multisearch (Extended Abstract). [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:404-415 [Conf]
- Gerth Stølting Brodal
Priority Queues on Parallel Machines. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:416-427 [Conf]
- Rolf Fagerberg
Binary Search Trees: How Low Can You Go? [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:428-439 [Conf]
- Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
Boolean Analysis of Incomplete Examples. [Citation Graph (0, 0)][DBLP]
SWAT, 1996, pp:440-451 [Conf]
|
