Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Sven Oliver Krumke, Diana Poensgen |
Online Call Admission in Optical Networks with Larger Demands. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Krzysztof Diks, Lukasz Kowalik, Maciej Kurowski |
A New 3-Color Criterion for Planar Graphs. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Martín Matamala, Ivan Rapaport |
The Complexity of Approximating the Oriented Diameter of Chordal Graphs. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger |
More about Subcolorings. |
WG |
2002 |
DBLP DOI BibTeX RDF |
subcoloring, special graph classes, computational complexity, graph coloring, polynomial time algorithm |
1 | Rolf Wanka |
Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Stavros D. Nikolopoulos, Leonidas Palios |
On the Recognition of P4-Comparability Graphs. |
WG |
2002 |
DBLP DOI BibTeX RDF |
comparability graph, P4-comparability graph, P4-component, P4-transitive orientation, recognition, Perfectly orderable graph |
1 | Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah 0001 |
Optimal Area Algorithm for Planar Polyline Drawings. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Ron Shamir, Roded Sharan, Dekel Tsur |
Cluster Graph Modification Problems. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth |
Budgeted Maximum Graph Coverage. |
WG |
2002 |
DBLP DOI BibTeX RDF |
budgeted maximum coverage, approximation algorithm, integer linear programming, treewidth, maximum weight matching |
1 | Yehuda Koren, David Harel |
A Multi-scale Algorithm for the Linear Arrangement Problem. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca |
New Graph Classes of Bounded Clique-Width. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Dimitris Fotakis 0001, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis |
Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Frank van den Eijkhof, Hans L. Bodlaender |
Safe Reduction Rules for Weighted Treewidth. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Simone Dantas, Celina M. H. de Figueiredo, Luérbio Faria |
On the Complexity of (k, l)-Graph Sandwich Problems. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Narayan Vikas |
Connected and Loosely Connected List Homomorphisms. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Yon Dourisboure |
An Additive Stretched Routing Scheme for Chordal Graphs. |
WG |
2002 |
DBLP DOI BibTeX RDF |
Chordal graph, tree-decomposition, compact routing tables |
1 | Olivier Bodini |
On the Minimum Size of a Contraction-Universal Tree. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Toru Hasunuma |
Completely Independent Spanning Trees in Maximal Planar Graphs. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos |
Weighted Node Coloring: When Stable Sets Are Expensive. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Isabella Lari, Federica Ricca, Andrea Scozzari |
The Forest Wrapping Problem on Outerplanar Graphs. |
WG |
2002 |
DBLP DOI BibTeX RDF |
Connected partition, Steiner Forest, Maximum Split Clustering, Outerplanar graphs |
1 | Franz-Josef Brandenburg |
Cycles in Generalized Networks. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Ludek Kucera (eds.) |
Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Ondrej Sýkora, László A. Székely, Imrich Vrto |
Two Counterexamples in Graph Drawing. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Anne Berry, Jean R. S. Blair, Pinar Heggernes |
Maximum Cardinality Search for Computing Minimal Triangulations. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Hajime Ishihara, Bakhadyr Khoussainov |
Complexity of Some Infinite Games Played on Finite Graphs. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger |
DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem. |
WG |
2002 |
DBLP DOI BibTeX RDF |
computational complexity, graph theory, computational biology, DNA computing, DNA sequencing |
1 | Marc Demange, Vangelis Th. Paschos |
Algorithms and Models for the On-Line Vertex-Covering. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Patrick Healy, Nikola S. Nikolov |
Facets of the Directed Acyclic Graph Layering Polytope. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Henning Fernau |
Graph Separator Algorithms: A Refined Analysis. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Md. Saidur Rahman 0001, Takao Nishizeki |
Bend-Minimum Orthogonal Drawings of Plane 3-Graphs. |
WG |
2002 |
DBLP DOI BibTeX RDF |
Algorithm, Graph, Graph Drawing, Orthogonal Drawing, Bend |
1 | Guillaume Fertin, André Raspaud, Bruce A. Reed |
On Star Coloring of Graphs. |
WG |
2001 |
DBLP DOI BibTeX RDF |
proper coloring, star coloring, acyclic coloring, graphs, treewidth, vertex coloring |
1 | Fedor V. Fomin, Dimitrios M. Thilikos |
On the Monotonicity of Games Generated by Symmetric Submodular Functions. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Derek G. Corneil, Udi Rotics |
On the Relationship between Clique-Width and Treewidth. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Eunseuk Oh, Jianer Chen |
On Strong Menger-Connectivity of Star Graphs. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Antonio Puricella, Iain A. Stewart |
A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Friedhelm Meyer auf der Heide |
Invited Presentation: Data Management in Networks. |
WG |
2001 |
DBLP BibTeX RDF |
|
1 | Maw-Shang Chang, Ton Kloks, Chuan-Min Lee |
Maximum Clique Transversals. |
WG |
2001 |
DBLP BibTeX RDF |
|
1 | Sergei L. Bezrukov, Robert Elsässer |
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Hans-Jürgen Bandelt |
Invited Presentation: Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Serafino Cicerone, Gianluca D'Ermiliis, Gabriele Di Stefano |
(k, +)-Distance-Hereditary Graphs. |
WG |
2001 |
DBLP BibTeX RDF |
|
1 | Fedor V. Fomin, Hans L. Bodlaender |
Approximation of Pathwidth of Outerplanar Graphs. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Brandstädt, Van Bang Le (eds.) |
Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Haodi Feng |
(g, f)-Factorizations Orthogonal to k Subgraphs. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Feodor F. Dragan |
Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Öjvind Johansson |
log n-Approximative NLCk-Decomposition in O(n2k+1) Time. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano |
Approximate Constrained Bipartite Edge Coloring. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner |
Planarity of the 2-Level Cactus Model. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Cyril Gavoille, David Peleg, André Raspaud, Éric Sopena |
Small k-Dominating Sets in Planar Graphs with Applications. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Maw-Shang Chang, Haiko Müller |
On the Tree-Degree of Graphs. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Maurizio Patrignani, Maurizio Pizzonia |
The Complexity of the Matching-Cut Problem. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Jirí Fiala 0001, Klaus Jansen, Van Bang Le, Eike Seidel |
Graph Subcolorings: Complexity and Algorithms. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Van Bang Le, Bert Randerath |
On Stable Cutsets in Line Graphs. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Jianer Chen, Iyad A. Kanj |
On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Annegret Wagler |
Critical and Anticritical Edges in Perfect Graphs. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger |
De Bruijn Graphs and DNA Graphs. |
WG |
2001 |
DBLP DOI BibTeX RDF |
De Bruijn graph, DNA graphs, computational complexity, graph theory, NP-hardness, DNA computing, recognition algorithm |
1 | Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart |
On Subfamilies of AT-Free Graphs. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Wolfgang Espelage, Frank Gurski, Egon Wanke |
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel |
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger |
Complexity of Coloring Graphs without Forbidden Induced Subgraphs. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Sven Fuhrmann, Sven Oliver Krumke, Hans-Christoph Wirth |
Multiple Hotlink Assignment. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Emo Welzl |
n Points and One Line: Analysis of Randomized Games. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Dieter Kratsch, Haiko Müller |
On the Domination Search Number. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela |
Approximating Call-Scheduling Makespan in All-Optical Networks. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro |
Efficient Communication in Unknown Networks. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Michael J. Dinneen, Bakhadyr Khoussainov |
Update Networks and Their Routing Strategies. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Serafino Cicerone, Gabriele Di Stefano |
Networks with Small Stretch Number. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Gianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto |
On the Space and Access Complexity of Computation DAGs. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Frank Gurski, Egon Wanke |
The Tree-Width of Clique-Width Bounded Graphs Without Kn, n. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller |
Bandwidth of Split and Circular Permutation Graphs. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Peter Damaschke |
Efficient Dispersion Algorithms for Geometric Intersection Graphs. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Jean-Michel Hélary, Giovanna Melideo |
Minimal Size of Piggybacked Information for Tracking Causality: A Graph-Based Characterization. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Sayaka Nagai, Shin-Ichi Nakano |
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss |
Coloring Mixed Hypertrees. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
The Expressive Power and Complexity of Dynamic Process Graphs. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Edson Cáceres, Albert Chan, Frank K. H. A. Dehne, Giuseppe Prencipe |
Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Koichi Wada 0001, Wei Chen 0003 |
Optimal Fault-Tolerant Routings for k-Connected Graphs with Smaller Routing Tables. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich |
New Spectral Lower Bounds on the Bisection Width of Graphs. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar |
Traversing Directed Eulerian Mazes. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Ulrik Brandes, Dorothea Wagner (eds.) |
Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Brandstädt, Van Bang Le |
Split-Perfect Graphs: Characterizations and Algorithmic Use. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth |
Optimizing Cost Flows by Modifying Arc Costs and Capacities. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Dagmar Handke, Guy Kortsarz |
Tree Spanners for Subgraphs and Related Tree Covering Problems. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Dobrev |
Computing Input Multiplicity in Anonymous Synchronous Networks with Dynamic Faults. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe |
Budget Constrained Minimum Cost Connected Medians. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Ingo Wegener |
On the Expected Runtime and the Success Probability of Evolutionary Algorithms. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Guillaume Fertin, André Raspaud, Heiko Schröder 0001, Ondrej Sýkora, Imrich Vrto |
Diameter of the Knödel Graph. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Ekkehard Köhler |
Recognizing Graphs without Asteroidal Triples. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle |
Graph Coloring on a Coarse Grained Multiprocessor. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Vincent Bouchitté, Ioan Todinca |
Approximating the Treewidth of AT-Free Graphs. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler |
Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. |
WG |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Giuseppe Confessore, Paolo Dell'Olmo, Stefano Giordani |
Vertex Partitioning of Crown-Free Interval Graphs. |
WG |
1999 |
DBLP DOI BibTeX RDF |
interval coloring, acyclic orientation, approximation algorithm, interval graphs, Dynamic storage allocation |
1 | Thomas Lengauer |
Invited Lecture: Discrete Optimization Methods for Packing Problems in Two and Three Dimensions - With Applications in the Textile and Car Manufacturing Industries. |
WG |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Md. Saidur Rahman 0001, Shin-Ichi Nakano, Takao Nishizeki |
Box-Rectangular Drawings of Plane Graphs. |
WG |
1999 |
DBLP DOI BibTeX RDF |
Rectangular Drawing, Box-drawing, Box-rectangular drawing, Algorithm, Graph, Graph Drawing |
1 | Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen |
Optimal Solutions for Frequency Assignment Problems via Tree Decomposition. |
WG |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Jianer Chen, Iyad A. Kanj, Weijia Jia 0001 |
Vertex Cover: Further Observations and Further Improvements. |
WG |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Dobrev, Imrich Vrto |
Two Broadcasting Problems in Faulty Hypercubes. |
WG |
1999 |
DBLP DOI BibTeX RDF |
isoperimetric problem, fault tolerance, distributed computing, broadcasting, hypercube |
1 | Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos |
Finding Smallest Supertrees Under Minor Containment. |
WG |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna |
Linear Orderings of Random Geometric Graphs. |
WG |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth |
Euler is Standing in Line. |
WG |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Öjvind Johansson |
NLC2-Decomposition in Polynomial Time. |
WG |
1999 |
DBLP DOI BibTeX RDF |
|