Conferences in DBLP
Grammati E. Pantziou , Paul G. Spirakis , Christos D. Zaroliagis Optimal Parallel Algorithms for Sparse Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:1-17 [Conf ] Jürgen Plehn , Bernd Voigt Finding Minimally Weighted Subgraphs. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:18-29 [Conf ] Hans L. Bodlaender On the Complexity of Some Coloring Games. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:30-40 [Conf ] Ulrich Huckenbeck , Detlev Ruland A Generalized Best-First Search Method in Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:41-60 [Conf ] Tze-Heng Ma , Jeremy Spinrad Avoiding Matrix Multiplication. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:61-71 [Conf ] Peter Damaschke Induced Subgraph Isomorphism for Cographs in NP-Complete. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:72-78 [Conf ] Hermann Stamm On Feedback Problems in Planar Digraphs. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:79-89 [Conf ] Franz Aurenhammer , Johann Hagauer Recognizing Binary Hamming Graphs in O(n² log n) Time. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:90-98 [Conf ] Kuo-Feng Liao , Majid Sarrafzadeh Vertex-Disjoint Trees and Boundary Single-Layer Routing. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:99-108 [Conf ] Edmund Ihler Bounds on the quality of approximate solutions to the Group Steiner Problem. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:109-118 [Conf ] Claudio Arbib Two Polynomial Problems in PLA Folding. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:119-129 [Conf ] Michael Formann , Frank Wagner The VLSI layout in various embedding models. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:130-139 [Conf ] Fillia Makedon , Spyros Tragoudas Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:140-153 [Conf ] Seshu Madhavapeddy , Ivan Hal Sudborough Deterministic Message Routing in Faulty Hypercubes. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:154-169 [Conf ] Hyeong-Ah Choi , Abdol-Hossein Esfahanian On Complexity of a Message-Routing Strategy for Multicomputer Systems. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:170-181 [Conf ] Peter Zienicke Embeddings of Treelike Graphs into 2-Dimensional Meshes. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:182-192 [Conf ] Anindya Das , Krishnaiyan Thulasiraman Diagnosis of t/s-Diagnosable Systems. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:193-205 [Conf ] Ofer Biran , Shlomo Moran , Shmuel Zaks Deciding 1-sovability of distributed task is NP-hard. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:206-220 [Conf ] Michel Habib , Michel Morvan , Jean-Xavier Rampon Remarks on Some Concurrency Measures. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:221-238 [Conf ] Frank Hoffmann , Michael Kaufmann On the Rectilinear Art Gallery Problem - Algorithmic Aspects. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:239-250 [Conf ] Paul Fischer , Hans-Ulrich Simon Separation Problems and Circular Arc Systems. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:251-259 [Conf ] Klaus Reuter , Ivan Rival Genus of Order and Lattices. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:260-275 [Conf ] Iain A. Stewart Comparing the expressibility of two languages formed using NP-complete graph operators. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:276-290 [Conf ] Dietmar Seipel Decomposition of Linear Recursive Logic Programs. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:291-310 [Conf ] Didier Caucal , Roland Monfort On the transition graphs of automata and grammars. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:311-337 [Conf ] Michael Löwe , Hartmut Ehrig Algebraic Approach to Graph Transformation Based on Single Pushout Derivations. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:338-353 [Conf ]