close
1.

図書

図書
Andreas Brandstädt, Van Bang Le (eds.)
出版情報: Berlin : Springer, c2001  x, 327 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2204
所蔵情報: loading…
目次情報: 続きを見る
Invited Presentation: Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces / Hans-J. Bandelt
Invited Presentation: Data Management in Networks / Friedhelm Meyer auf der Heide
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs / Sergei L. Bezrukov ; Robert Elsässer
Approximate Constrained Bipartite Edge Coloring / Ioannis Caragiannis ; Afonso Ferreira ; Christos Kaklamanis ; Stéphane Pérennes ; Pino Persiano ; Hervé Rivano
Maximum Clique Transversals / Maw-Shang Chang ; Ton Kloks ; Chuan-Min Lee
On the Tree-Degree of Graphs / Haiko Muller
On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms / Jianer Chen ; Iyad A. Kanj
(k,+)-Distance-Hereditary Graphs / Serafino Cicerone ; Gianluca D'Ermiliis ; Gabriele Di Stefano
On the Relationship between Clique-Width and Treewidth / Derek G. Corneil ; Udi Rotics
Planarity of the 2-Level Cactus Model / Sabine Cornelsen ; Yefim Dinitz ; Dorothea Wagner
Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach / Feodor F. Dragan
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time / Wolfgang Espelage ; Frank Gurski ; Egon Wanke
(g,f)-Factorizations Orthogonal to k Subgraphs / Haodi Feng
On Star Coloringof Graphs / Guillaume Fertin ; André Raspaud ; Bruce Reed
Graph Subcolorings: Complexity and Algorithms / Jiří Fiala ; Klaus Jansen ; Van Bang Le ; Eike Seidel
Approximation of Pathwidth of Outerplanar Graphs / Fedor V. Fomin ; Hans L. Bodlaender
On the Monotonicity of Games Generated by Symmetric Submodular Functions / Dimitrios M. Thilikos
Multiple Hotlink Assignment / Sven Fuhrmann ; Sven Oliver Krumke ; Hans-Christoph Wirth
Small k-DominatingSets in Planar Graphs with Applications / Cyril Gavoille ; David Peleg ; Eric Sopena
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem / Clemens Gröpl ; Stefan Hougardy ; Till Nierhoff ; Hans J. Prömel
log n-Approximative NLCk-Decomposition in O(n2k+1) Time / Öjvind Johansson
On Subfamilies of AT-Free Graphs / Ekkehard Köhler ; Stephan Olariu ; Lorna Stewart
Complexity of ColoringGraphs without Forbidden Induced Subgraphs / Daniel Král' ; Jan Kratochvíl ; Zsolt Tuza ; Gerhard J. Woeginger
On Stable Cutsets in Line Graphs / Bert Randerath
On StrongMenger-Connectivity of Star Graphs / Eunseuk Oh
The Complexity of the Matching-Cut Problem / Maurizio Patrignani ; Maurizio Pizzonia
De Bruijn Graphs and DNA Graphs / Rudi Pendavingh ; Petra Schuurman
A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness / Antonio Puricella ; Iain A. Stewart
Critical and Anticritical Edges in Perfect Graphs / Annegret Wagler
Author Index
Invited Presentation: Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces / Hans-J. Bandelt
Invited Presentation: Data Management in Networks / Friedhelm Meyer auf der Heide
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs / Sergei L. Bezrukov ; Robert Elsässer
2.

図書

図書
Dieter Kratsch (ed.)
出版情報: Berlin : Springer, c2005  xix, 470 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3787
所蔵情報: loading…
3.

図書

図書
Juraj Hromkovič, Manfred Nagl, Bernhard Westfechtel (eds.)
出版情報: Berlin : Springer, c2004  xi, 404 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3353
所蔵情報: loading…
4.

図書

図書
Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz (eds.)
出版情報: Berlin : Springer, c1999  xi, 414 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1665
所蔵情報: loading…
目次情報: 続きを見る
Invited Lecture: Silver Graphs: Achievements and New Challenges / Hartmut Noltemeier
Invited Lecture: Online Algorithms: A Studyof Graph-Theoretic Concepts / Susanne Albers
Invited Lecture: Discrete Optimization Methods for Packing Problems in Two and Three Dimensions - With Applications in the Textile and
Car Manufacturing Industries / Thomas Lengauer
Informatica, Scuola, Communita: Uno Sguardo dall' Occhio del Ciclone / N. Santoro
Proximity-Preserving Labeling Schemes and Their Applications / David Peleg
Euler is Standing in Line / D. Hauptmeier ; S. O. Krumke ; J. Rambau ; H.-C. Wirth
Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2 / Sascha Ott
ComplexityClassification of Some Edge Modification Problems / Assaf Natanzon ; Ron Shamir ; Roded Sharan
On Minimum Diameter Spanning Trees under Reload Costs / Hans-Christoph Wirth ; Jan Steffan
Induced Matchings in Regular Graphs and Trees / Michele Zito
Mod-2 Independence and Domination in Graphs / Magnús M. Halldó rsson ; Jan Kratochvil ; Jan Arne Telle
On the Nature of Structure and Its Identification / Ojvind Johansson ; Benno Stein ; Oliver Niggemann
On the Clique-Width of Perfect Graph Classes / Martin Charles Golumbic ; Udi Rotics
An Improved Algorithm for Finding Tree Decompositions of Small Width / Ljubomir Perkovic ; Bruce Reed
Efficient Analysis of Graphs with Small Minimal Separators / K. Skodinis
Generating All the Minimal Separators of a Graph / Anne Berry ; Jean-Paul Bordat ; Olivier Cogis
Two Broadcasting Problems in FaultyHypercubes / Stefan Dobrev ; Imrich Vrto
Routing Permutations in the Hypercube / Olivier Baudon ; Guillaume Fertin ; Ivan Havel
An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs / Koichi Wada ; Yoriyuki Nagata ; Wei Chen
Optimal Irreversible Dynamos in Chordal Rings / Paola Flocchini ; Frédéric Geurts ; Nicola Santoro
Recognizing Bipartite Incident-Graphs of Circulant Digraphs / Johanne Cohen ; Pierre Fraigniaud ; Cyril Gavoille
Optimal Cuts for Powers of the Petersen Graph / Sergei L. Bezrukov ; Sajal K. Das ; Robert Elsässer
Dihamiltonian Decomposition of Regular Graphs with Degree Three / Jung-Heum Park ; Hee-Chul Kim
Box-Rectangular Drawings of Plane Graphs / Md. Saidur Rahman ; Shin-ichi Nakano ; Takao Nishizeki
A Multi-Scale Algorithm for Drawing Graphs Nicely / Ronny Hadany ; David Harel
All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Time / Anna Accornero ; Massimo Ancona ; Sonia Varini
Linear Orderings of Random Geometric Graphs / Josep Diaz ; Mathew D. Penrose ; Jordi Petit ; Maria Serna
Finding Smallest Supertrees Under Minor Containment / Naomi Nishimura ; Prabhakar Ragde ; Dimitrios M. Thilikos
Vertex Cover: Further Observations and Further Improvements / Jianer Chen ; Iyad A. Kanj ; Weijia Jia
On the Hardness of Recognizing Bundles in Time Table Graphs / Annegret Liebers ; Dorothea Wagner ; Karsten Weihe
Optimal Solutions for FrequencyAssignment Problems via Tree Decomposition / Arie M.C.A. Koster ; Stan P.M. van Hoesel ; Antoon W.J. Kolen
Fixed-Parameter Complexity of ?-Labelings / Jiri Fiala ; Ton Kloks
Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs / Andreas Brandstädt ; Feodor F. Dragan ; Ekkehard Köhler
On Claw-Free Asteroidal Triple-Free Graphs / Harald Hempel ; Dieter Kratsch
Vertex Partitioning of Crown-Free Interval Graphs / Giuseppe Confessore ; Paolo Dell'Olmo ; Stefano Giordani
Author Index / I. Parfenoff ; F. Roussel ; I. Rusu
Invited Lecture: Silver Graphs: Achievements and New Challenges / Hartmut Noltemeier
Invited Lecture: Online Algorithms: A Studyof Graph-Theoretic Concepts / Susanne Albers
Invited Lecture: Discrete Optimization Methods for Packing Problems in Two and Three Dimensions - With Applications in the Textile and
5.

図書

図書
Rolf H. Möhring (ed.)
出版情報: Berlin ; Tokyo : Springer, c1997  x, 376 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1335
所蔵情報: loading…
目次情報:
The volume presents 28 revised full papers carefully selected for inclusion in the book from 42 submissions
The papers address a variety of graph-theoretic issues relevant from the computer science point of view such as graph algorithms, cycles, graph decompositions, interconnection networks, local search, graph orderings, graph matching, graph languages, tree-width computation, etc
The volume presents 28 revised full papers carefully selected for inclusion in the book from 42 submissions
The papers address a variety of graph-theoretic issues relevant from the computer science point of view such as graph algorithms, cycles, graph decompositions, interconnection networks, local search, graph orderings, graph matching, graph languages, tree-width computation, etc
6.

図書

図書
Fedor V. Fomin (ed.)
出版情報: Berlin : Springer, c2006  xiii, 358 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 4271
所蔵情報: loading…
目次情報: 続きを見る
Treewidth: Characterizations, Applications, and Computations / Hans L. Bodlaender
Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy / Jiri Fiala ; Jan Kratochvil
Generalised Dualities and Finite Maximal Antichains / Jan Foniok ; Jaroslav Nesetril ; Claude Tardif
Chordal Deletion Is Fixed-Parameter Tractable / Daniel Marx
A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators / Christian Knauer ; Andreas Spillner
Divide-and-Color / Joachim Kneis ; Daniel Molle ; Stefan Richter ; Peter Rossmanith
Listing Chordal Graphs and Interval Graphs / Masashi Kiyomi ; Shuji Kijima ; Takeaki Uno
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs / Serge Gaspers ; Mathieu Liedloff
Improved Edge-Coloring with Three Colors / Lukasz Kowalik
Vertex Coloring of Comparability+ke and -ke Graphs / Yasuhiko Takenaga ; Kenichi Higashide
Convex Drawings of Graphs with Non-convex Boundary / Seok-Hee Hong ; Hiroshi Nagamochi
How to Sell a Graph: Guidelines for Graph Retailers / Alexander Grigoriev ; Joyce van Loon ; Rene Sitters ; Marc Uetz
Strip Graphs: Recognition and Scheduling / Magnus M. Halldorsson ; Ragnar K. Karlsson
Approximating the Traffic Grooming Problem in Tree and Star Networks / Michele Flammini ; Gianpiero Monaco ; Luca Moscardelli ; Mordechai Shalom ; Shmuel Zaks
Bounded Arboricity to Determine the Local Structure of Sparse Graphs / Gaurav Goel ; Jens Gustedt
An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time / Andrew R. Curtis ; Clemente Izurieta ; Benson Joeris ; Scott Lundberg ; Ross M. McConnell
Partitioned Probe Comparability Graphs / David B. Chandler ; Maw-Shang Chang ; Ton Kloks ; Jiping Liu ; Sheng-Lung Peng
Computing Graph Polynomials on Graphs of Bounded Clique-Width / J.A. Makowsky ; Udi Rotics ; Ilya Averbouch ; Benny Godlin
Generation of Graphs with Bounded Branchwidth / Christophe Paul ; Andrzej Proskurowski ; Jan Arne Telle
Minimal Proper Interval Completions / Ivan Rapaport ; Karol Suchan ; Ioan Todinca
Monotony Properties of Connected Visible Graph Searching / Pierre Fraigniaud ; Nicolas Nisse
Finding Intersection Models of Weakly Chordal Graphs / Martin Charles Golumbic ; Marina Lipshteyn ; Michal Stern
A Fully Dynamic Algorithm for the Recognition of P[subscript 4]-Sparse Graphs / Stavros D. Nikolopoulos ; Leonidas Palios ; Charis Papadopoulos
Clique Graph Recognition Is NP-Complete / L. Alcon ; L. Faria ; C.M.H. de Figueiredo ; M. Gutierrez
Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms / B.-M. Bui Xuan ; M. Habib ; V. Limouzy ; F. de Montgolfier
Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs / Haim Kaplan ; Yahav Nussbaum
Graph Labelings Derived from Models in Distributed Computing / Jeremie Chalopin ; Daniel Paulusma
Flexible Matchings / Miklos Bartha ; Miklos Kresz
Simultaneous Graph Embeddings with Fixed Edges / Elisabeth Gassner ; Michael Junger ; Merijam Percan ; Marcus Schaefer ; Michael Schulz
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions / Bodo Manthey
Circular-Perfect Concave-Round Graphs / Sylvain Coulonges
Author Index
Treewidth: Characterizations, Applications, and Computations / Hans L. Bodlaender
Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy / Jiri Fiala ; Jan Kratochvil
Generalised Dualities and Finite Maximal Antichains / Jan Foniok ; Jaroslav Nesetril ; Claude Tardif
7.

図書

図書
Ulrik Brandes, Dorothea Wagner (eds.)
出版情報: Berlin : Springer, c2000  x, 313 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1928
所蔵情報: loading…
目次情報: 続きを見る
Invited Lecture: On the Expected Runtime and the Success Probability of Evolutionary Algorithms / Ingo Wegener
Invited Lecture: n Points and One Line: Analysis of Randomized Games / Emo Welzl
Approximating Call-Scheduling Makespan in All-Optical Networks / Luca Becchetti ; Miriam Di Ianni ; Alberto Marchetti-Spaccamela
New Spectral Lower Bounds on the Bisection Width of Graphs / Sergei L. Bezrukov ; Robert Elsässer ; Burkhard Monien ; Robert Preis ; Jean-Pierre Tillich
Traversing Directed Eulerian Mazes / Sandeep Bhatt ; Shimon Even ; David Greenberg ; Rafi Tayar
On the Space and Access Complexity of Computation DAGs / Gianfranco Bilardi ; Andrea Pietracaprina ; Paolo D'Alberto
Approximating the Treewidth of AT-Free Graphs / Vincent Bouchitté ; Ioan Todinca
Split-Perfect Graphs: Characterizations and Algorithmic Use / Andreas Brandstädt ; Van Bang Le
Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs / Edson Cáceres ; Albert Chan ; Frank Dehne ; Giuseppe Prencipe
Networks with Small Stretch Number / Serafino Cicerone ; Gabriele Di Stefano
Efficient Dispersion Algorithms for Geometric Intersection Graphs / Peter Damaschke
Optimizing Cost Flows by Modifying Arc Costs and Capacities / Ingo Demgensky ; Hartmut Noltemeier ; Hans-Christoph Wirth
Update Networks and Their Routing Strategies / Michael J. Dinneen ; Bakhadyr Khoussainov
Computing Input Multiplicity in Anonymous Synchronous Networks with Dynamic Faults / Stefan Dobrev
Diameter of the Knodel Graph / Guillaume Fertin ; André Raspaud ; Heiko Schröder ; Ondrej Sýkora ; Imrich Vrto
On the Domination Search Number / Fedor Fomin ; Dieter Kratsch ; Haiko Müller
Efficient Communication in Unknown Networks / Luisa Gargano ; Andrzej Pelc ; Stephane Perennes ; Ugo Vaccaro
Graph Coloring on a Coarse Grained Multiprocessor / Assefaw Hadish Gebremedhin ; Isabelle Guerin Lassous ; Jens Gustedt ; Jan Arne Telle
The Tree-Width of Clique-Width Bounded Graphs Without Kn,n / Frank Gurski ; Egon Wanke
Tree Spanners for Subgraphs and Related Tree Covering Problems / Dagmar Handke ; Guy Kortsarz
Minimal Size of Piggybacked Information for Tracking Causality: A Graph-Based Characterization / Jean Michel Hélary ; Giovanna Melideo
The Expressive Power and Complexity of Dynamic Process Graphs / Andreas Jakoby ; Maciej Liskiewicz ; Rüdiger Reischuk
Bandwidth of Split and Circular Permutation Graphs / Ton Kloks ; Yvan Le Borgne
Recognizing Graphs without Asteroidal Triples / Ekkehard Köhler
Budget Constrained Minimum Cost Connected Medians / Goran Konjevod ; Sven O. Krumke ; Madhav Marathe
Coloring Mixed Hypertrees / Daniel Král' ; Jan KratochvÆil ; Andrzej Proskurowski ; Heinz-Jürgen Voss
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs / Sayaka Nagai ; Shin-ichi Nakano
Optimal Fault-Tolerant Routings for k-Connected Graphs with Smaller Routing Tables / Koichi Wada ; Wei Chen
Author Index
Invited Lecture: On the Expected Runtime and the Success Probability of Evolutionary Algorithms / Ingo Wegener
Invited Lecture: n Points and One Line: Analysis of Randomized Games / Emo Welzl
Approximating Call-Scheduling Makespan in All-Optical Networks / Luca Becchetti ; Miriam Di Ianni ; Alberto Marchetti-Spaccamela
8.

図書

図書
Hans L. Bodlaender (ed.)
出版情報: Berlin ; Tokyo : Springer, c2003  xi, 386 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2880
所蔵情報: loading…
目次情報: 続きを見る
Invited Lecture
Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT / Michael R. Fellows
Matching, Edge-Colouring, and Dimers / Alexander Schrijver
Regular Papers
Minimum Flow Time Graph Ordering / Claudio Arbib ; Michele Flammini ; Fabrizio Marinelli
Searching Is Not Jumping / Lali Barrière ; Pierre Fraigniaud ; Nicola Santoro ; Dimitrios M. Thilikos
Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grammars / Simon M. Becker ; Bernhard Westfechtel
The Minimum Degree Heuristic and the Minimal Triangulation Process / Anne Berry ; Pinar Heggernes ; Geneviève Simonet
Generalized Parametric Multi-terminal Flows Problem / Pascal Berthomé ; Madiagne Diallo ; Afonso Ferreira
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation / Nicolas Bonichon ; Cyril Gavoille ; Nicolas Hanusse
The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes / Paul Bonsma
Tree Spanners for Bipartite Graphs and Probe Interval Graphs / Andreas Brandstädt ; Feodor F. Dragan ; Hoang-Oanh Le ; Van Bang Le ; Ryuhei Uehara
A Simple Linear Time LexBFS Cograph Recognition Algorithm / Anna Bretscher ; Derek Corneil ; Michel Habib ; Christophe Paul
Backbone Colorings for Networks / Hajo Broersma ; Fedor V. Fomin ; Petr A. Golovach ; Gerhard J. Woeginger
Greedy Edge-Disjoint Paths in Complete Graphs / Paz Carmi ; Thomas Erlebach ; Yoshio Okamoto
Graph-Based Approaches to Software Watermarking / Christian Collberg ; Stephen Kobourov ; Edward Carter ; Clark Thomborson
Completely Connected Clustered Graphs / Sabine Cornelsen ; Dorothea Wagner
An FPT Algorithm for Set Splitting / Frank Dehne ; Frances A. Rosamond
Drawing Planar Graphs on a Curve / Emilio Di Giacomo ; Walter Didimo ; Giuseppe Liotta ; Stephen K. Wismath
Tree-Partitions of k-Trees with Applications in Graph Layout / Vida Dujmovic ; David R. Wood
Resource Allocation Problems in Multifiber WDM Tree Networks / Aris Pagourtzis ; Katerina Potika ; Stamatis Stefanakos
An Improved Upper Bound on the Crossing Number of the Hypercube / Luerbio Faria ; Celina M. Herrera de Figueiredo ; Ondrej Sýkora ; Imrich Vrt'o
NCE GraphGrammarsandClique-Width / Alexander Glikson ; Johann A. Makowsky
Chordal Probe Graphs / Martin Charles Golumbic ; Marina Lipshteyn
Subgraph Induced Planar Connectivity Augmentation / Carsten Gutwenger ; Michael Jünger ; Sebastian Leipert ; Petra Mutzel ; Merijam Percan ; René Weiskircher
On the Recognition of General Partition Graphs / Ton Kloks ; C.M. Lee ; Jiping Liu ; Haiko Müller
Short Cycles in Planar Graphs / Lukasz Kowalik
Complexity of Hypergraph Coloring and Seidel's Switching / Jan Kratochvil
Feedback Vertex Set and Longest Induced Path on AT-Free Graphs / Dieter Kratsch ; Ioan Todinca
The Complexity of Graph Contractions / Asaf Levin ; Daniël Paulusma
Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs / Paul Manuel ; Bharati Rajan ; Indra Rajasingh ; Amutha Alaguvel
The Probabilistic Minimum Coloring Problem / Cecile Murat ; Vangelis Th. Paschos
Recognizing Bipolarizable and P4-Simplicial Graphs / Stavros D. Nikolopoulos ; Leonidas Palios
Coloring Powers of Graphs of Bounded Clique-Width
Erratum
Erratum: Cycles in Generalized Networks / Franz J. Brandenburg
Author Index
Invited Lecture
Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT / Michael R. Fellows
Matching, Edge-Colouring, and Dimers / Alexander Schrijver
9.

図書

図書
Ludĕk Kuc̆era (ed.)
出版情報: Berlin ; Tokyo : Springer, c2002  xi, 422 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2573
所蔵情報: loading…
10.

図書

図書
Juraj Hromkovic̆, Ondrej Sýkora (eds.)
出版情報: Berlin ; Tokyo : Springer, c1998  x, 383 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1517
所蔵情報: loading…
目次情報: 続きを見る
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width / B. Courcelle ; J.A. Makowsky ; U. Rotics
Minus Domination in Small-Degree Graphs / Peter Damaschke
The Vertex-Disjoint Triangles Problem / V. Guruswami ; C.P. Rangan ; M.S. Chang ; G.J. Chang ; C.K. Wong
Communication in the Two-Way Listen-in Vertex-disjoint Paths Mode / Hans-Joachim Böckenhauer
Broadcasting on Anonymous Unoriented Tori / S. Dobrev ; P. Ru icka
Families of Graphs Having Broadcasting and Gossiping Properties / Guillaume Fertin ; André Raspaud
Optical All-to-All Communication in Inflated Networks / Olivier Togni
A Generalization of AT-free Graphs and a Generic Algorithm for Sol- ving Treewidth, Minimum Fill-In and Vertex Ranking / Hajo Broersma ; Ton Kloks ; Dieter Kratsch ; Haiko Müller
A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees / Shuji Isobe ; Xiao Zhou ; Takao Nishizeki
Rankings of Directed Graphs / Jan Kratochv'il ; Zsolt Tuza
Drawing Planar Partitions II: HH-Drawings / Therese Biedl ; Michael Kaufmann ; Petra Mutzel
Triangles in Euclidean Arrangements / Stefan Felsner ; Klaus Kriegel
Internally Typed Second-OrderTerm Graphs / Wolfram Kahl
Compact Implicit Representation of Graphs / Maurizio Talamo ; Paola Vocca
Graphs with Bounded Induced Distance / Serafino Cicerone ; Gabriele Di Stefano
Diameter Determination on Restricted Graph Families / Derek G. Corneil ; Feodor F. Dragan ; Michel Habib ; Christophe Paul
Independent Tree Spanners / Dagmar Handke
Upgrading Bottleneck Constrained Forests / S. O. Krumke ; M. V. Marathe ; H. Noltemeier ; S. S. Ravi ; H.-C. Wirth
Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition / G. Gauyacq ; C. Micheneau ; A. Raspaud
Improved Compressions of Cube-Connected Cycles Networks / Ralf Klasing
Efficient Embeddings of Grids into Grids / Markus Röttger ; Ulf-Peter Schroeder
Integral Uniform Flows in Symmetric Networks / Farhad Shahrokhi ; László A. Székely
Splitting Number is NP-complete / L. Faria ; C. M. H. de Figueiredo ; C. F. X. Mendonça
Tree Spanners in Planar Graphs / Sandor P. Fekete ; Jana Kremer
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs / Kazuyuki Miura ; Daishiro Takahashi ; Shin-ichi Nakano
Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases / Koichi Wada ; Wei Chen
Domination and Steiner Tree Problems on Graphs with Few P4s / Luitpold Babel ; Stephan Olariu
Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs / Elias Dahlhaus
Interval Completion with the Smallest Max-degree / Fedor V. Fomin ; Petr A. Golovach
An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a Minor / K.Yu. Gorbunov
Author Index
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width / B. Courcelle ; J.A. Makowsky ; U. Rotics
Minus Domination in Small-Degree Graphs / Peter Damaschke
The Vertex-Disjoint Triangles Problem / V. Guruswami ; C.P. Rangan ; M.S. Chang ; G.J. Chang ; C.K. Wong
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼