Conferences in DBLP
Sotiris E. Nikoletseas , Paul G. Spirakis Near-Optimal Dominating Sets in Dense Random Graphs in Polynomial Expected Time. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:1-10 [Conf ] N. W. Holloway , Somasundaram Ravindran , Alan Gibbons Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle Inequality. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:11-20 [Conf ] Madhav V. Marathe , Venkatesh Radhakrishnan , Harry B. Hunt III , S. S. Ravi Hierarchical Specified Unit Disk Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:21-32 [Conf ] Egon Wanke Bounded Tree-Width and LOGCFL. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:33-44 [Conf ] Hans L. Bodlaender On Reduction Algorithms for Graphs with Small Treewidth. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:45-56 [Conf ] Martin Charles Golumbic , Haim Kaplan , Ron Shamir Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:57-69 [Conf ] Alberto Marchetti-Spaccamela , Umberto Nanni , Hans Rohnert On-line Graph Algorithms for Incremental Compilation. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:70-86 [Conf ] Paola Alimonti , Stefano Leonardi , Alberto Marchetti-Spaccamela , Xavier Messeguer Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:87-98 [Conf ] Zoran Ivkovic , Errol L. Lloyd Fully Dynamic Maintenance of Vertex Cover. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:99-111 [Conf ] Hans L. Bodlaender Dynamic Algorithms for Graphs with Treewidth 2. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:112-124 [Conf ] Andreas Brandstädt , Heinz-Jürgen Voss Short Disjoint Cycles in Graphs with Degree Constraints. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:125-131 [Conf ] Koichi Wada , Kimio Kawaguchi Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:132-143 [Conf ] Zbigniew Lonc Toward a Solution of the Holyer's Problem. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:144-152 [Conf ] George Havas , Bohdan S. Majewski , Nicholas C. Wormald , Zbigniew J. Czech Graphs, Hypergraphs and Hashing. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:153-165 [Conf ] Ludek Kucera Coloring k-Colorable Graphs in Constant Expected Parallel Time. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:166-176 [Conf ] Ingo Schiermeyer Deciding 3-Colourability in Less Than O(1.415^n) Steps. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:177-188 [Conf ] Klaus Jansen A Rainbow About T-Colorings for Complete Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:189-199 [Conf ] Nai-Wei Lin Approximating the Chromatic Polynomial of a Graph. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:200-210 [Conf ] Derek G. Corneil , Stephan Olariu , Lorna Stewart Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:211-224 [Conf ] Elias Dahlhaus The Parallel Complexity of Elimination Ordering Procedures. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:225-236 [Conf ] Andreas Brandstädt , Feodor F. Dragan , Victor Chepoi , Vitaly I. Voloshin Dually Chordal Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:237-251 [Conf ] Ingo Wegener The Size of Reduced OBDDs and Optimal Read-once Branching Programs for Almost all Boolean Functions. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:252-263 [Conf ] Jörg Desel Regular Marked Petri Nets. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:264-275 [Conf ] Javier Esparza , Bernhard von Stengel The Asynchronous Committee Meeting Problem. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:276-287 [Conf ] Juraj Hromkovic , Ralf Klasing , Elena Stöhr Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:288-300 [Conf ] Sabine R. Öhring , Sajal K. Das The Folded Petersen Network: A New Versatile Multiprocessor Interconnection Topology. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:301-314 [Conf ] Jacques E. Boillat Fast Load Balancing in Cayley Graphs and in Circuits. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:315-326 [Conf ] Farhad Shahrokhi , László A. Székely Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary Version). [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:327-337 [Conf ] Evangelos Kranakis , Danny Krizanc , S. S. Ravi On Multi-Label Linear Interval Routing Schemes (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:338-349 [Conf ] S. Haldar An `All Pairs Shortest Path' Distributed Algorithm Using 2n² Messages. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:350-363 [Conf ] Koji Nakano Linear Layouts of Generalized Hypercubes. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:364-375 [Conf ] Jianer Chen , Saroja P. Kanchi Graph Ear Decompositions and Graph Embeddings (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:376-387 [Conf ] Farhad Shahrokhi , László A. Székely , Ondrej Sýkora , Imrich Vrto Improving Bounds for the Crossing Numbers on Surfaces of Genus g. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:388-395 [Conf ] Goos Kant , Xin He Two Algorithms for Finding Rectangular Duals of Planar Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:396-410 [Conf ] Goos Kant A More Compact Visibility Representation. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:411-424 [Conf ]