Search results for "WG"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Jirí Fiala 0001, Ton Kloks, Jan Kratochvíl	Fixed-Parameter Complexity of lambda-Labelings.	WG	1999	DBLP DOI BibTeX RDF
1	Susanne Albers	Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts.	WG	1999	DBLP DOI BibTeX RDF
1	Sascha Ott	Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2.	WG	1999	DBLP DOI BibTeX RDF	Superstrings, lower bounds, approximability, APX-hardness
1	Martin Charles Golumbic, Udi Rotics	On the Clique-Width of Perfect Graph Classes.	WG	1999	DBLP DOI BibTeX RDF
1	Benno Stein 0001, Oliver Niggemann	On the Nature of Structure and Its Identification.	WG	1999	DBLP DOI BibTeX RDF
1	Harald Hempel, Dieter Kratsch	On Claw-Free Asteroidal Triple-Free Graphs.	WG	1999	DBLP DOI BibTeX RDF
1	Ljubomir Perkovic, Bruce A. Reed	An Improved Algorithm for Finding Tree Decompositions of Small Width.	WG	1999	DBLP DOI BibTeX RDF
1	Paola Flocchini, Frédéric Geurts, Nicola Santoro	Optimal Irreversible Dynamos in Chordal Rings.	WG	1999	DBLP DOI BibTeX RDF
1	Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle	Mod-2 Independence and Domination in Graphs.	WG	1999	DBLP DOI BibTeX RDF
1	Michele Zito 0001	Induced Matchings in Regular Graphs and Trees.	WG	1999	DBLP DOI BibTeX RDF
1	Konstantin Skodinis	Efficient Analysis of Graphs with Small Minimal Separators.	WG	1999	DBLP DOI BibTeX RDF
1	Sergei L. Bezrukov, Sajal K. Das 0001, Robert Elsässer	Optimal Cuts for Powers of the Petersen Graph.	WG	1999	DBLP DOI BibTeX RDF
1	David Peleg	Proximity-Preserving Labeling Schemes and Their Applications.	WG	1999	DBLP DOI BibTeX RDF
1	Igor Parfenoff, Florian Roussel, Irena Rusu	Triangulated Neighbourhoods in C4-Free Berge Graphs.	WG	1999	DBLP DOI BibTeX RDF	lexicographic breadth-first search, triangulated graph, perfectness
1	Koichi Wada 0001, Yoriyuki Nagata, Wei Chen 0003	An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs.	WG	1999	DBLP DOI BibTeX RDF
1	Anna Accornero, Massimo Ancona, Sonia Varini	All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Time.	WG	1999	DBLP DOI BibTeX RDF
1	Annegret Liebers, Dorothea Wagner, Karsten Weihe	On the Hardness of Recognizing Bundles in Time Table Graphs.	WG	1999	DBLP DOI BibTeX RDF
1	Olivier Baudon, Guillaume Fertin, Ivan Havel	Routing Permutations in the Hypercube.	WG	1999	DBLP DOI BibTeX RDF	routing permutations, Szymanski's conjecture, 2-1 routing requests, Hypercubes
1	Nicola Santoro	Informatica, Scoula, Communità: Uno Sguardo dall' Occhio del Ciclone.	WG	1999	DBLP DOI BibTeX RDF
1	Jung-Heum Park, Hee-Chul Kim	Dihamiltonian Decomposition of Regular Graphs with Degree Three.	WG	1999	DBLP DOI BibTeX RDF
1	Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille	Recognizing Bipartite Incident-Graphs of Circulant Digraphs.	WG	1999	DBLP DOI BibTeX RDF	broadcasting, gossiping, graph isomorphism, circulant graphs, chordal rings
1	Ronny Hadany, David Harel	A Multi-Scale Algorithm for Drawing Graphs Nicely.	WG	1999	DBLP DOI BibTeX RDF
1	Assaf Natanzon, Ron Shamir, Roded Sharan	Complexity Classification of Some Edge Modification Problems.	WG	1999	DBLP DOI BibTeX RDF
1	Hartmut Noltemeier	Invited Lecture: Silver Graphs: Achievements and New Challenges.	WG	1999	DBLP DOI BibTeX RDF
1	Anne Berry, Jean Paul Bordat, Olivier Cogis	Generating All the Minimal Separators of a Graph.	WG	1999	DBLP DOI BibTeX RDF	Minimal Separator, Graph, Enumeration Algorithm
1	Hans-Christoph Wirth, Jan Steffan	On Minimum Diameter Spanning Trees under Reload Costs.	WG	1999	DBLP DOI BibTeX RDF	Node weighted graphs, Network Design, Spanning Tree, Diameter, Transportation problems
1	Peter Widmayer, Gabriele Neyer, Stephan J. Eidenbenz (eds.)	Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings	WG	1999	DBLP DOI BibTeX RDF
1	Sándor P. Fekete, Jana Kremer	Tree Spanners in Planar Graphs.	WG	1998	DBLP DOI BibTeX RDF
1	Serafino Cicerone, Gabriele Di Stefano	Graphs with Bounded Induced Distance.	WG	1998	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach	Interval Completion with the Smallest Max-degree.	WG	1998	DBLP DOI BibTeX RDF
1	Therese C. Biedl, Michael Kaufmann 0001, Petra Mutzel	Drawing Planar Partitions II: HH-Drawings.	WG	1998	DBLP DOI BibTeX RDF
1	Dagmar Handke	Independent Tree Spanners.	WG	1998	DBLP DOI BibTeX RDF
1	Juraj Hromkovic, Ondrej Sýkora (eds.)	Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings	WG	1998	DBLP DOI BibTeX RDF
1	Shuji Isobe, Xiao Zhou 0001, Takao Nishizeki	A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees.	WG	1998	DBLP DOI BibTeX RDF
1	Konstantin Yu. Gorbunov	An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a Minor.	WG	1998	DBLP DOI BibTeX RDF
1	Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto	Splitting Number is NP-complete	WG	1998	DBLP DOI BibTeX RDF
1	Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong	The Vertex-Disjoint Triangles Problem.	WG	1998	DBLP DOI BibTeX RDF
1	Bruno Courcelle, Johann A. Makowsky, Udi Rotics	Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width.	WG	1998	DBLP DOI BibTeX RDF
1	Guillaume Fertin, André Raspaud	Families of Graphs Having Broadcasting and Gossiping Properties.	WG	1998	DBLP DOI BibTeX RDF	minimum broadcast graphs, minimum gossip graphs, Knödel graphs, Broadcasting, hypercubes, gossiping, circulant graphs
1	Peter Damaschke	Minus Domination in Small-Degree Graphs.	WG	1998	DBLP DOI BibTeX RDF
1	Hans-Joachim Böckenhauer	Communication in the Two-Way Listen-in Vertex-disjoint Paths Mode.	WG	1998	DBLP DOI BibTeX RDF
1	Olivier Togni	Optical All-to-All Communication in Inflated Networks.	WG	1998	DBLP DOI BibTeX RDF
1	Markus Röttger, Ulf-Peter Schroeder	Efficient Embeddings of Grids into Grids.	WG	1998	DBLP DOI BibTeX RDF
1	Farhad Shahrokhi, László A. Székely	Integral Uniform Flows in Symmetric Networks.	WG	1998	DBLP DOI BibTeX RDF
1	Jan Kratochvíl, Zsolt Tuza	Rankings of Directed Graphs.	WG	1998	DBLP DOI BibTeX RDF
1	Ginette Gauyacq, C. Micheneau, André Raspaud	Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition.	WG	1998	DBLP DOI BibTeX RDF
1	Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki	A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs.	WG	1998	DBLP DOI BibTeX RDF
1	Wolfram Kahl	Interally Typed Second-Order Term Graphs.	WG	1998	DBLP DOI BibTeX RDF
1	Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller	A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking.	WG	1998	DBLP DOI BibTeX RDF
1	Luitpold Babel, Stephan Olariu	Domination and Steiner Tree Problems on Graphs with Few P4S.	WG	1998	DBLP DOI BibTeX RDF
1	Maurizio Talamo, Paola Vocca	Compact Implicit Representation of Graphs.	WG	1998	DBLP DOI BibTeX RDF
1	Stefan Felsner, Klaus Kriegel	Triangles in Euclidean Arrangements.	WG	1998	DBLP DOI BibTeX RDF
1	Stefan Dobrev, Peter Ruzicka	Broadcasting on Anonymous Unoriented Tori.	WG	1998	DBLP DOI BibTeX RDF
1	Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth	Upgrading Bottleneck Constrained Forests.	WG	1998	DBLP DOI BibTeX RDF
1	Koichi Wada 0001, Wei Chen 0003	Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases.	WG	1998	DBLP DOI BibTeX RDF
1	Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul	Diameter Determination on Restricted Graph Faminlies.	WG	1998	DBLP DOI BibTeX RDF
1	Elias Dahlhaus	Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs.	WG	1998	DBLP DOI BibTeX RDF
1	Ralf Klasing	Improved Compressions of Cube-Connected Cycles Networks.	WG	1998	DBLP DOI BibTeX RDF
1	Hajo Broersma, Elias Dahlhaus, Ton Kloks	Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs.	WG	1997	DBLP DOI BibTeX RDF	MSC 68R10
1	Konstantin Skodinis	The Bounded Tree-Width Problem of Context-Free Graph Languages.	WG	1997	DBLP DOI BibTeX RDF
1	Thomas Erlebach, Klaus Jansen	Off-Line and On-Line Call-Scheduling in Stars and Trees.	WG	1997	DBLP DOI BibTeX RDF
1	Helmut Alt, Ulrich Fuchs 0001, Klaus Kriegel	On the Number of Simple Cycles in Planar Graphs.	WG	1997	DBLP DOI BibTeX RDF
1	Michael Sampels	Large Networks with Small Diameter.	WG	1997	DBLP DOI BibTeX RDF
1	Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes	Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract).	WG	1997	DBLP DOI BibTeX RDF	communication in interconnection networks, routing, parallel algorithms, graph theory, computational and structural complexity
1	David P. Williamson	Gadgets, Approximation, and Linear Programming: Improved Hardness Results for Cut and Satisfiability Problems (Abstract of Invited Lecture).	WG	1997	DBLP DOI BibTeX RDF
1	Ulrik Brandes, Dagmar Handke	NP-Completness Results for Minimum Planar Spanners.	WG	1997	DBLP DOI BibTeX RDF
1	Erich Prisner	Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs.	WG	1997	DBLP DOI BibTeX RDF
1	Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle	Complexity of Colored Graph Covers I. Colored Directed Multigraphs.	WG	1997	DBLP DOI BibTeX RDF
1	Ryuhei Uehara	A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems.	WG	1997	DBLP DOI BibTeX RDF	the lexicographically first maximal independent set problem, the lexicographically first maximal subgraph problems, Analysis of algorithms, P-completeness, NC algorithms
1	Fabrizio d'Amore, Fabio Iacobini	On-Line Algorithms for Networks of Temporal Constraints.	WG	1997	DBLP DOI BibTeX RDF
1	Ton Kloks, Dieter Kratsch, Haiko Müller	Asteroidal Sets in Graphs.	WG	1997	DBLP DOI BibTeX RDF
1	Koichi Wada 0001, Wei Chen 0003, Yupin Luo, Kimio Kawaguchi	Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs.	WG	1997	DBLP DOI BibTeX RDF
1	Feodor F. Dragan	On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract).	WG	1997	DBLP DOI BibTeX RDF
1	Paola Alimonti	Non-oblivious Local Search for MAX 2-CCSP with Application to MAX DICUT.	WG	1997	DBLP DOI BibTeX RDF
1	Stephan Brandt	Computing the Independence Number of Dense Triangle-Free Graphs.	WG	1997	DBLP DOI BibTeX RDF
1	Petr Hlinený, Jan Kratochvíl	Computational Complexity of the Krausz Dimension of Graphs.	WG	1997	DBLP DOI BibTeX RDF
1	Fabrizio d'Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela (eds.)	Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings	WG	1997	DBLP DOI BibTeX RDF
1	Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks	On Optimal Graphs Embedded into Path and Rings, with Analysis Using l1-Spheres.	WG	1997	DBLP DOI BibTeX RDF
1	Rolf H. Möhring (eds.)	Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings	WG	1997	DBLP DOI BibTeX RDF
1	Luitpold Babel, Gerhard J. Woeginger	Pseudo-Hamiltonian Graphs.	WG	1997	DBLP DOI BibTeX RDF
1	Luitpold Babel, Stephan Olariu	On the Separable-Homogeneous Decomposition of Graphs (Extended Abstract).	WG	1997	DBLP DOI BibTeX RDF
1	Elias Dahlhaus	Minimal Elimination Ordering Inside a Given Chordal Graph.	WG	1997	DBLP DOI BibTeX RDF
1	Christian Capelle	Block Decomposition of Inheritance Hierarchies.	WG	1997	DBLP DOI BibTeX RDF
1	Tanja E. J. Vos, S. Doaitse Swierstra	Make your Enemies Transparent.	WG	1997	DBLP DOI BibTeX RDF	unstable environments, transparency law, convergence, distributed programs, UNITY
1	Mohamed Mosbah 0001, Nasser Saheb	A Syntactic Approach to Random Walks on Graphs.	WG	1997	DBLP DOI BibTeX RDF
1	Mikkel Thorup	Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract).	WG	1997	DBLP DOI BibTeX RDF
1	Karell Bertet, Jens Gustedt, Michel Morvan	Weak-Order Extensions of an Order.	WG	1997	DBLP DOI BibTeX RDF
1	Babette de Fluiter, Hans L. Bodlaender	Parallel Algorithms for Treewidth Two.	WG	1997	DBLP DOI BibTeX RDF
1	Alberto Bertoni, Paola Campadelli, Roberto Posenato	An Upper Bound for the Maximum Cut Mean Value.	WG	1997	DBLP DOI BibTeX RDF
1	Damon Kaller	Definability Equals Recognizability of Partial 3-Trees.	WG	1996	DBLP DOI BibTeX RDF
1	Koji Obokata, Yukihiro Iwasaki, Feng Bao 0004, Yoshihide Igarashi	Independent Spanning Trees of Product Graphs.	WG	1996	DBLP DOI BibTeX RDF
1	Krzysztof Diks, Torben Hagerup	More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree.	WG	1996	DBLP DOI BibTeX RDF
1	Falk Nicolai, Thomas Szymczak	Homogeneous Sets and Domination Problems.	WG	1996	DBLP DOI BibTeX RDF
1	Adrienne L. Broadwater, Kemal Efe, Antonio Fernández 0001	Embedding Complete Binary Trees in Product Graphs.	WG	1996	DBLP DOI BibTeX RDF
1	Krzysztof Diks, Andrzej Pelc	System Diagnosis with Smallest Risk of Error.	WG	1996	DBLP DOI BibTeX RDF
1	Wolfram Kahl	Algebraic Graph Derivations for Graphical Calculi.	WG	1996	DBLP DOI BibTeX RDF
1	Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt	LexBFS-Orderings and Power of Graphs.	WG	1996	DBLP DOI BibTeX RDF
1	Bettina Klinz, Gerhard J. Woeginger	One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs.	WG	1996	DBLP DOI BibTeX RDF
1	Michel Bauderon, Hélène Jacquet	Node Rewriting in Hypergraphs.	WG	1996	DBLP DOI BibTeX RDF
1	Swamy K. Sitarama, Abdol-Hossein Esfahanian	Designing Distance-Preserving Fault-Tolerant Topologies.	WG	1996	DBLP DOI BibTeX RDF

Publications at "WG"( http://dblp.L3S.de/Venues/WG )