Search results for "WG"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Ewa Malesinska, Alessandro Panconesi	On the Hardness of Allocating Frequencies for Hybrid Networks.	WG	1996	DBLP DOI BibTeX RDF
1	Stephan Hartmann 0003, Markus W. Schäffter, Andreas S. Schulz	Switchbox Routing in VLSI Design: Closing the Complexity Gap.	WG	1996	DBLP DOI BibTeX RDF
1	Tadao Takaoka	Shortest Path Algorithms for Nearly Acyclic Directed Graphs.	WG	1996	DBLP DOI BibTeX RDF
1	Ornella Ciotti, Francesco Parisi-Presicce	Closure Properties of Context-Tree Hyperedge Replacement Systems.	WG	1996	DBLP DOI BibTeX RDF
1	Krzysztof Brys, Zbigniew Lonc	Clique and Anticlique Partition of Graphs.	WG	1996	DBLP DOI BibTeX RDF
1	Luitpold Babel, Stephan Olariu	A New Characterization of P4-connected Graphs.	WG	1996	DBLP DOI BibTeX RDF
1	Spyros Tragoudas, Yaakov L. Varol	Computing Disjoint Path with Lenght Constraints.	WG	1996	DBLP DOI BibTeX RDF
1	Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg	Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract).	WG	1996	DBLP DOI BibTeX RDF
1	Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, S. S. Ravi, Kay U. Drangmeister	Modifying Networks to Obtain Low Cost Trees.	WG	1996	DBLP DOI BibTeX RDF	Computational Complexity, Approximation Algorithms, NP-hardness, Location Theory, Parametric Search
1	Jens Gustedt	Efficient Union-Find for Planar Graphs and other Sparse Graph Classes (Extended Abstract).	WG	1996	DBLP DOI BibTeX RDF
1	Hristo N. Djidjev	On-Line Algorithms for Shortest Path Problems on Planar Digraphs.	WG	1996	DBLP DOI BibTeX RDF
1	Paola Alimonti, Tiziana Calamoneri	Improved Approximations of Independent Dominating Set in Bounded Degree Graphs.	WG	1996	DBLP DOI BibTeX RDF	Minimum Independent Dominating Set, Approximation Algorithms, Local Search, Greedy, Regular Graphs, Cubic Graphs, Bounded Degree Graphs
1	Pierluigi Crescenzi, Paolo Penna	Upward Drawings of Search Trees (Extended Abstract).	WG	1996	DBLP DOI BibTeX RDF
1	Andrew Chi-Chih Yao	Hypergraphs and Decision Trees (Abstract).	WG	1996	DBLP DOI BibTeX RDF
1	Sergei L. Bezrukov	On k-Partitioning the n-Cube.	WG	1996	DBLP DOI BibTeX RDF
1	Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese	Counting Edges in a Dag.	WG	1996	DBLP DOI BibTeX RDF
1	Leo G. Kroon, Arunabha Sen, Haiyong Deng, Asim Roy	The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs.	WG	1996	DBLP DOI BibTeX RDF
1	Chi-Chang Chen, Jianer Chen	Optimal Parallel Routing in Star Graphs.	WG	1996	DBLP DOI BibTeX RDF
1	Michel Hurfin, Michel Raynal	Detecting Diamond Necklaces in Labeled Dags (A Problem from Distributed Debugging).	WG	1996	DBLP DOI BibTeX RDF
1	Xiao Zhou 0001, Mohammod Abul Kashem, Takao Nishizeki	Generalized Edge-Ranking of Trees (Extended Abstract).	WG	1996	DBLP DOI BibTeX RDF	Edge-ranking, Separator tree, Algorithm, Tree
1	Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe	Complexity and Approximability of Certain Bicriteria Location Problems.	WG	1995	DBLP DOI BibTeX RDF
1	Michele Flammini, Giorgio Gambosi, Sandro Salomone	On Devising Boolean Routing Schemes.	WG	1995	DBLP DOI BibTeX RDF	shortest paths representation, Parallel and distributed systems, compact routing tables
1	F. David Fracchia	Visualizing Two- and Three-Dimensional Models of Meristematic Growth.	WG	1995	DBLP DOI BibTeX RDF
1	Jitender S. Deogun, Dieter Kratsch	Diametral Path Graphs.	WG	1995	DBLP DOI BibTeX RDF
1	José D. P. Rolim, Ondrej Sýkora, Imrich Vrto	Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes.	WG	1995	DBLP DOI BibTeX RDF
1	Elias Dahlhaus	Efficient Parallel Modular Decomposition (Extended Abstract).	WG	1995	DBLP DOI BibTeX RDF	Parallel algorithms, graph theory, graph algorithms
1	Manfred Nagl (eds.)	Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG '95, Aachen, Germany, June 20-22, 1995, Proceedings	WG	1995	DBLP DOI BibTeX RDF
1	Daniele Giorgio Degiorgi, Klaus Simon	A Dynamic Algorithm for Line Graph Recognition.	WG	1995	DBLP DOI BibTeX RDF
1	Koichi Wada 0001, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen 0003	Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs.	WG	1995	DBLP DOI BibTeX RDF
1	Philippe Galinier, Michel Habib, Christophe Paul	Chordal Graphs and Their Clique Graphs.	WG	1995	DBLP DOI BibTeX RDF
1	Tadao Takaoka	Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem.	WG	1995	DBLP DOI BibTeX RDF
1	Sven Hartmann	Graph-Theoretical Methods to Construct Entity-Relationship Databases.	WG	1995	DBLP DOI BibTeX RDF
1	Paola Bonizzoni, Gianluca Della Vedova	Modular Decomposition of Hypergraphs.	WG	1995	DBLP DOI BibTeX RDF
1	Peter Damaschke	Searching for Faulty Leaves in Binary Trees.	WG	1995	DBLP DOI BibTeX RDF
1	Zhi-Zhong Chen, Xin He	NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems.	WG	1995	DBLP DOI BibTeX RDF
1	Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai	Homogeneously Orderable Graphs and the Steiner Tree Problem.	WG	1995	DBLP DOI BibTeX RDF
1	John L. Pfaltz	Partition Coefficients of Acyclic Graphs.	WG	1995	DBLP DOI BibTeX RDF
1	Sophie Fischer, Leen Torenvliet	The Malleability of TSP_{2Opt}.	WG	1995	DBLP DOI BibTeX RDF
1	Fabrizio d'Amore, Roberto Giaccio	Incremental Hive Graph.	WG	1995	DBLP DOI BibTeX RDF
1	Luitpold Babel, Stephan Olariu	On the Isomorphism of Graphs with Few P4s.	WG	1995	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Richard B. Tan, Dimitrios M. Thilikos, Jan van Leeuwen	On Interval Routing Schemes and Treewidth.	WG	1995	DBLP DOI BibTeX RDF
1	Detlef Plump	On Termination of Graph Rewriting.	WG	1995	DBLP DOI BibTeX RDF
1	Jens Gustedt, Michel Morvan, Laurent Viennot	A Compact Data Structure and Parallel Algorithms for Permutation Graphs.	WG	1995	DBLP DOI BibTeX RDF
1	Ingo Schiermeyer	An Approximation Algorithm for 3-Colourability.	WG	1995	DBLP DOI BibTeX RDF	k-colouring, exact and approximation algorithm, complexity, Graph
1	Hristo N. Djidjev, Shankar M. Venkatesan	Planarization of Graphs Embedded on Surfaces.	WG	1995	DBLP DOI BibTeX RDF
1	Ernst W. Mayr, Gunther Schmidt 0001, Gottfried Tinhofer (eds.)	Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings	WG	1995	DBLP DOI BibTeX RDF
1	Paola Alimonti	Non-Oblivious Local Search for Grpah and Hyperpraph Coloring Problems.	WG	1995	DBLP DOI BibTeX RDF
1	Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger	VC-Dimensions for Graphs (Extended Abstract).	WG	1995	DBLP DOI BibTeX RDF
1	Friedhelm Meyer auf der Heide, Matthias Westermann	Hot-Potato Routing on Multi-Dimensional Tori.	WG	1995	DBLP DOI BibTeX RDF
1	Barbara D. Birchler, Abdol-Hossein Esfahanian, Eric Torng	Toward a General Theory of Unicast-Based Multicast Communication.	WG	1995	DBLP DOI BibTeX RDF
1	Ton Kloks, Dieter Kratsch, Haiko Müller	Finding and Counting Small Induced Subgraphs Efficiently.	WG	1995	DBLP DOI BibTeX RDF
1	Michel Bauderon	A Uniform Approach to Graph Rewriting: The Pullback Approach.	WG	1995	DBLP DOI BibTeX RDF
1	Siddharthan Ramachandramurthi	A Lower Bound for Treewidth and Its Consequences.	WG	1994	DBLP DOI BibTeX RDF
1	Koichi Wada 0001, Akinari Takaki, Kimio Kawaguchi	Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases.	WG	1994	DBLP DOI BibTeX RDF
1	Giuseppe Di Battista, Roberto Tamassia, Luca Vismara	On-Line Convex Plabarity Testing.	WG	1994	DBLP DOI BibTeX RDF
1	Francesco Parisi-Presicce, Gabriele Piersanti	Multilevel Graph Grammars.	WG	1994	DBLP DOI BibTeX RDF
1	Elias Dahlhaus, Peter L. Hammer, Frédéric Maffray, Stephan Olariu	On Domination Elimination Orderings and Domination Graphs (Extended Abstract).	WG	1994	DBLP DOI BibTeX RDF
1	Mordecai J. Golin, Shmuel Zaks	Labelled Trees and Pairs of Input-Output Permutations in Priority Queues.	WG	1994	DBLP DOI BibTeX RDF
1	Jürgen Ebert, Angelika Franzke	A Declarative Approach to Graph Based Modeling.	WG	1994	DBLP DOI BibTeX RDF
1	Volker Turau, Weimin Chen 0003	GLB-Closures in Directed Acyclic Graphs and Their Applications.	WG	1994	DBLP DOI BibTeX RDF
1	Renate Garbe	Tree-width and Path-width of Comparability Graphs of interval Orders.	WG	1994	DBLP DOI BibTeX RDF
1	Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M. Thilikos	Fugitive-Search Games on Graphs and Related Parameters.	WG	1994	DBLP DOI BibTeX RDF
1	Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer	The Complexity of Broadcasting in Planar and Decomposable Graphs.	WG	1994	DBLP DOI BibTeX RDF	Classification graph algorithms, computational complexity, graph decomposition
1	Valeska Naumann	Measuring the Distance to Series-Parallelity by Path Expressions.	WG	1994	DBLP DOI BibTeX RDF
1	Jan van Leeuwen (eds.)	Graph-Theoretic Concepts in Computer Science, 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings	WG	1994	DBLP DOI BibTeX RDF
1	Konstantin Skodinis, Egon Wanke	Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages.	WG	1994	DBLP DOI BibTeX RDF
1	Bernhard Westfechtel	Using Programmed Graph Rewriting for the Formal Specification of a Configuration Management System.	WG	1994	DBLP DOI BibTeX RDF
1	Thomas Andreae, Michael Nölle, Gerald Schreiber	Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn Graphs (Extended Abstract).	WG	1994	DBLP DOI BibTeX RDF	processor networks, parallel image processing and pattern recognition, dilation, graph embeddings, massively parallel computers, Cartesian product, de Bruijn graphs
1	Dharmavani Bhagavathi, Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing	Time-Optimal Tree Computations on Sparse Meshes.	WG	1994	DBLP DOI BibTeX RDF	meshes with multiple broadcasting, traversais, tree reconstruction, parentheses algorithms, encoding, decoding, binary trees, ordered trees
1	Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer	Direct Path Graph Isomorphism (Extended Abstract).	WG	1994	DBLP DOI BibTeX RDF
1	Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto	Book Embeddings and Crossing Numbers.	WG	1994	DBLP DOI BibTeX RDF
1	Yoji Kajitani, Jun Dong Cho, Majid Sarrafzadeh	New Approximation Results on Graph Matching and related Problems.	WG	1994	DBLP DOI BibTeX RDF
1	Pierluigi Crescenzi, Luca Trevisan	Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity (Extended Abstract).	WG	1994	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza	Ranking of Graphs.	WG	1994	DBLP DOI BibTeX RDF
1	Evripidis Bampis, Yannis Manoussakis, Ioannis Milis	NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract).	WG	1994	DBLP DOI BibTeX RDF
1	Roberto Giaccio	On-line Algorithms for Satisfiability Problems with Uncertainty.	WG	1994	DBLP DOI BibTeX RDF
1	Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan	The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings.	WG	1994	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Joost Engelfriet	Domino Treewith (Extended Abstract).	WG	1994	DBLP DOI BibTeX RDF
1	Heiko Dörr	Bypass Strong V-Structures and Find an Isomorphic Labelled Subgraph in Linear Time.	WG	1994	DBLP DOI BibTeX RDF
1	Andy Schürr	Specification of Graph Translators with Triple Graph Grammars.	WG	1994	DBLP DOI BibTeX RDF
1	Zhi-Zhong Chen	The Maximal f-Dependent Set Problem for Planar Graphs is in NC.	WG	1994	DBLP DOI BibTeX RDF
1	Detlef Sieling, Ingo Wegener	New Lower Bounds and Hierarchy Results for Restricted Branching Programs.	WG	1994	DBLP DOI BibTeX RDF
1	Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle	Complexity of Graph Covering Problems.	WG	1994	DBLP DOI BibTeX RDF
1	Ton Kloks, Dieter Kratsch, Haiko Müller	Dominoes.	WG	1994	DBLP DOI BibTeX RDF
1	Shiva Chaudhuri, Torben Hagerup	Prefix Graphs and Their Applications.	WG	1994	DBLP DOI BibTeX RDF
1	Juraj Hromkovic, Ralf Klasing, Elena Stöhr	Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks.	WG	1993	DBLP DOI BibTeX RDF
1	Andreas Brandstädt, Heinz-Jürgen Voss	Short Disjoint Cycles in Graphs with Degree Constraints.	WG	1993	DBLP DOI BibTeX RDF
1	Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert	On-line Graph Algorithms for Incremental Compilation.	WG	1993	DBLP DOI BibTeX RDF
1	Evangelos Kranakis, Danny Krizanc, S. S. Ravi	On Multi-Label Linear Interval Routing Schemes (Extended Abstract).	WG	1993	DBLP DOI BibTeX RDF
1	Koji Nakano	Linear Layouts of Generalized Hypercubes.	WG	1993	DBLP DOI BibTeX RDF
1	Ernst W. Mayr (eds.)	Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings	WG	1993	DBLP DOI BibTeX RDF
1	Nai-Wei Lin	Approximating the Chromatic Polynomial of a Graph.	WG	1993	DBLP DOI BibTeX RDF
1	Martin Charles Golumbic, Haim Kaplan, Ron Shamir	Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract).	WG	1993	DBLP DOI BibTeX RDF
1	Farhad Shahrokhi, László A. Székely	Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary Version).	WG	1993	DBLP DOI BibTeX RDF
1	George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech	Graphs, Hypergraphs and Hashing.	WG	1993	DBLP DOI BibTeX RDF
1	Elias Dahlhaus	The Parallel Complexity of Elimination Ordering Procedures.	WG	1993	DBLP DOI BibTeX RDF
1	Ingo Schiermeyer	Deciding 3-Colourability in Less Than O(1.415^n) Steps.	WG	1993	DBLP DOI BibTeX RDF	k-colouring, algorithm, complexity, Graph
1	Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin	Dually Chordal Graphs.	WG	1993	DBLP DOI BibTeX RDF
1	Paola Alimonti, Stefano Leonardi 0001, Alberto Marchetti-Spaccamela, Xavier Messeguer	Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs.	WG	1993	DBLP DOI BibTeX RDF
1	Sabine R. Öhring, Sajal K. Das 0001	The Folded Petersen Network: A New Versatile Multiprocessor Interconnection Topology.	WG	1993	DBLP DOI BibTeX RDF	Petersen graph, fault-tolerance, routing, interconnection network, broadcasting, hypercube, embedding, tree, mesh

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