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 ] 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 ] 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 ] Conf ] Egon Wanke Bounded Tree-Width and LOGCFL. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender On Reduction Algorithms for Graphs with Small Treewidth. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Charles Golumbic , Haim Kaplan , Ron Shamir Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Marchetti-Spaccamela , Umberto Nanni , Hans Rohnert On-line Graph Algorithms for Incremental Compilation. [Citation Graph (0, 0)][DBLP ] 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 ] Conf ] Zoran Ivkovic , Errol L. Lloyd Fully Dynamic Maintenance of Vertex Cover. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender Dynamic Algorithms for Graphs with Treewidth 2. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Brandstädt , Heinz-Jürgen Voss Short Disjoint Cycles in Graphs with Degree Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Koichi Wada , Kimio Kawaguchi Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Zbigniew Lonc Toward a Solution of the Holyer's Problem. [Citation Graph (0, 0)][DBLP ] Conf ] George Havas , Bohdan S. Majewski , Nicholas C. Wormald , Zbigniew J. Czech Graphs, Hypergraphs and Hashing. [Citation Graph (0, 0)][DBLP ] Conf ] Ludek Kucera Coloring k-Colorable Graphs in Constant Expected Parallel Time. [Citation Graph (0, 0)][DBLP ] Conf ] Ingo Schiermeyer Deciding 3-Colourability in Less Than O(1.415^n) Steps. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Jansen A Rainbow About T-Colorings for Complete Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Nai-Wei Lin Approximating the Chromatic Polynomial of a Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Derek G. Corneil , Stephan Olariu , Lorna Stewart Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Elias Dahlhaus The Parallel Complexity of Elimination Ordering Procedures. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Brandstädt , Feodor F. Dragan , Victor Chepoi , Vitaly I. Voloshin Dually Chordal Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Ingo Wegener The Size of Reduced OBDDs and Optimal Read-once Branching Programs for Almost all Boolean Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Jörg Desel Regular Marked Petri Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Javier Esparza , Bernhard von Stengel The Asynchronous Committee Meeting Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Juraj Hromkovic , Ralf Klasing , Elena Stöhr Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Sabine R. Öhring , Sajal K. Das The Folded Petersen Network: A New Versatile Multiprocessor Interconnection Topology. [Citation Graph (0, 0)][DBLP ] Conf ] Jacques E. Boillat Fast Load Balancing in Cayley Graphs and in Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Farhad Shahrokhi , László A. Székely Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Evangelos Kranakis , Danny Krizanc , S. S. Ravi On Multi-Label Linear Interval Routing Schemes (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] S. Haldar An `All Pairs Shortest Path' Distributed Algorithm Using 2n² Messages. [Citation Graph (0, 0)][DBLP ] Conf ] Koji Nakano Linear Layouts of Generalized Hypercubes. [Citation Graph (0, 0)][DBLP ] Conf ] Jianer Chen , Saroja P. Kanchi Graph Ear Decompositions and Graph Embeddings (Extended Abstract). [Citation Graph (0, 0)][DBLP ] 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 ] Conf ] Goos Kant , Xin He Two Algorithms for Finding Rectangular Duals of Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Goos Kant A More Compact Visibility Representation. [Citation Graph (0, 0)][DBLP ] Conf ] 