Conferences in DBLP
Hans L. Bodlaender Treewidth: Characterizations, Applications, and Computations. [Citation Graph (0, 0)][DBLP ] Conf ] Jirí Fiala , Jan Kratochvíl Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Foniok , Jaroslav Nesetril , Claude Tardif Generalised Dualities and Finite Maximal Antichains. [Citation Graph (0, 0)][DBLP ] Conf ] Dániel Marx Chordal Deletion Is Fixed-Parameter Tractable. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Knauer , Andreas Spillner A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim Kneis , Daniel Mölle , Stefan Richter , Peter Rossmanith Divide-and-Color. [Citation Graph (0, 0)][DBLP ] Conf ] Masashi Kiyomi , Shuji Kijima , Takeaki Uno Listing Chordal Graphs and Interval Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Serge Gaspers , Mathieu Liedloff A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Lukasz Kowalik Improved Edge-Coloring with Three Colors. [Citation Graph (0, 0)][DBLP ] Conf ] Yasuhiko Takenaga , Kenichi Higashide Vertex Coloring of Comparability+k e and -k e Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Seok-Hee Hong , Hiroshi Nagamochi Convex Drawings of Graphs with Non-convex Boundary. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Grigoriev , Joyce van Loon , René Sitters , Marc Uetz How to Sell a Graph: Guidelines for Graph Retailers. [Citation Graph (0, 0)][DBLP ] Conf ] Magnús M. Halldórsson , Ragnar K. Karlsson Strip Graphs: Recognition and Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Michele Flammini , Gianpiero Monaco , Luca Moscardelli , Mordechai Shalom , Shmuel Zaks Approximating the Traffic Grooming Problem in Tree and Star Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Gaurav Goel , Jens Gustedt Bounded Arboricity to Determine the Local Structure of Sparse Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew R. Curtis , Clemente Izurieta , Benson Joeris , Scott Lundberg , Ross M. McConnell An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time. [Citation Graph (0, 0)][DBLP ] Conf ] David B. Chandler , Maw-Shang Chang , Ton Kloks , Jiping Liu , Sheng-Lung Peng Partitioned Probe Comparability Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Johann A. Makowsky , Udi Rotics , Ilya Averbouch , Benny Godlin Computing Graph Polynomials on Graphs of Bounded Clique-Width. [Citation Graph (0, 0)][DBLP ] Conf ] Christophe Paul , Andrzej Proskurowski , Jan Arne Telle Generation of Graphs with Bounded Branchwidth. [Citation Graph (0, 0)][DBLP ] Conf ] Ivan Rapaport , Karol Suchan , Ioan Todinca Minimal Proper Interval Completions. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Fraigniaud , Nicolas Nisse Monotony Properties of Connected Visible Graph Searching. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Charles Golumbic , Marina Lipshteyn , Michal Stern Finding Intersection Models of Weakly Chordal Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Stavros D. Nikolopoulos , Leonidas Palios , Charis Papadopoulos A Fully Dynamic Algorithm for the Recognition of P 4 -Sparse Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Liliana Alcón , Luerbio Faria , Celina M. Herrera de Figueiredo , Marisa Gutierrez Clique Graph Recognition Is NP-Complete. [Citation Graph (0, 0)][DBLP ] Conf ] Binh-Minh Bui-Xuan , Michel Habib , Vincent Limouzy , Fabien de Montgolfier Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Haim Kaplan , Yahav Nussbaum Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jérémie Chalopin , Daniël Paulusma Graph Labelings Derived from Models in Distributed Computing. [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Bartha , Miklós Krész Flexible Matchings. [Citation Graph (0, 0)][DBLP ] Conf ] Elisabeth Gassner , Michael Jünger , Merijam Percan , Marcus Schaefer , Michael Schulz Simultaneous Graph Embeddings with Fixed Edges. [Citation Graph (0, 0)][DBLP ] Conf ] Bodo Manthey Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions. [Citation Graph (0, 0)][DBLP ] Conf ] Sylvain Coulonges Circular-Perfect Concave-Round Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] 