|
|
Conferences in DBLP
- Ingo Wegener
On the Expected Runtime and the Success Probability of Evolutionary Algorithms. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:1-10 [Conf]
- Emo Welzl
n Points and One Line: Analysis of Randomized Games. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:11-12 [Conf]
- Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
Approximating Call-Scheduling Makespan in All-Optical Networks. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:13-22 [Conf]
- Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich
New Spectral Lower Bounds on the Bisection Width of Graphs. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:23-34 [Conf]
- Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar
Traversing Directed Eulerian Mazes. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:35-46 [Conf]
- Gianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto
On the Space and Access Complexity of Computation DAGs. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:47-58 [Conf]
- Vincent Bouchitté, Ioan Todinca
Approximating the Treewidth of AT-Free Graphs. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:59-70 [Conf]
- Andreas Brandstädt, Van Bang Le
Split-Perfect Graphs: Characterizations and Algorithmic Use. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:71-82 [Conf]
- Edson Cáceres, Albert Chan, Frank K. H. A. Dehne, Giuseppe Prencipe
Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:83-94 [Conf]
- Serafino Cicerone, Gabriele Di Stefano
Networks with Small Stretch Number. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:95-106 [Conf]
- Peter Damaschke
Efficient Dispersion Algorithms for Geometric Intersection Graphs. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:107-115 [Conf]
- Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
Optimizing Cost Flows by Modifying Arc Costs and Capacities. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:116-126 [Conf]
- Michael J. Dinneen, Bakhadyr Khoussainov
Update Networks and Their Routing Strategies. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:127-136 [Conf]
- Stefan Dobrev
Computing Input Multiplicity in Anonymous Synchronous Networks with Dynamic Faults. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:137-148 [Conf]
- Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
Diameter of the Knödel Graph. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:149-160 [Conf]
- Fedor V. Fomin, Dieter Kratsch, Haiko Müller
On the Domination Search Number. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:161-171 [Conf]
- Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro
Efficient Communication in Unknown Networks. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:172-183 [Conf]
- Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle
Graph Coloring on a Coarse Grained Multiprocessor. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:184-195 [Conf]
- Frank Gurski, Egon Wanke
The Tree-Width of Clique-Width Bounded Graphs Without Kn, n. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:196-205 [Conf]
- Dagmar Handke, Guy Kortsarz
Tree Spanners for Subgraphs and Related Tree Covering Problems. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:206-217 [Conf]
- Jean-Michel Hélary, Giovanna Melideo
Minimal Size of Piggybacked Information for Tracking Causality: A Graph-Based Characterization. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:218-229 [Conf]
- Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
The Expressive Power and Complexity of Dynamic Process Graphs. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:230-242 [Conf]
- Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller
Bandwidth of Split and Circular Permutation Graphs. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:243-254 [Conf]
- Ekkehard Köhler
Recognizing Graphs without Asteroidal Triples. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:255-266 [Conf]
- Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe
Budget Constrained Minimum Cost Connected Medians. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:267-278 [Conf]
- Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss
Coloring Mixed Hypertrees. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:279-289 [Conf]
- Sayaka Nagai, Shin-Ichi Nakano
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:290-301 [Conf]
- Koichi Wada, Wei Chen
Optimal Fault-Tolerant Routings for k-Connected Graphs with Smaller Routing Tables. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:302-313 [Conf]
|
