| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels |
Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs.  |
WG  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern (eds.) |
Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert H. Sloan, Despina Stasi, György Turán |
Hydras: Directed Hypergraphs and Horn Formulas. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Berend, Amir Sapir |
Which Multi-peg Tower of Hanoi Problems Are Exponential? |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilad Braunschvig, Shiri Chechik, David Peleg |
Fault Tolerant Additive Spanners. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | David Peleg |
Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Hermelin, Julián Mestre, Dror Rawitz |
Optimization Problems in Dotted Interval Graphs. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Javelle, Mehdi Mhalla, Simon Perdrix |
On the Minimum Degree Up to Local Complementation: Bounds and Complexity. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mathew C. Francis, Daniel Gonçalves, Pascal Ochem |
The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract). |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Chaplick, Vít Jelínek, Jan Kratochvíl, Tomás Vyskocil |
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Berry, Annegret Wagler |
Triangulation and Clique Separator Decomposition of Claw-Free Graphs. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani |
h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk |
On Group Feedback Vertex Set Parameterized by the Size of the Cutset. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomoya Hibi, Toshihiro Fujito |
Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma |
Solutions for the Stable Roommates Problem with Payments. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Mnich, Rico Zenklusen |
Bisections above Tight Lower Bounds. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Neele Leithäuser, Sven Oliver Krumke, Maximilian Merkert |
Approximating Infeasible 2VPI-Systems. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Amitava Bhattacharya |
Alternating Reachability and Integer Sum of Closed Alternating Trails - The 3rd Annual Uri N. Peled Memorial Lecture. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Haiko Müller |
On the Stable Degree of Graphs. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach |
Account on Intervals. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern |
Student Poster Session. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fanica Gavril |
Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
Parameterized Algorithms for Even Cycle Transversal. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukasz Kowalik, Marcin Mucha |
A 9k Kernel for Nonseparating Independent Set in Planar Graphs. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk |
How to Eliminate a Graph. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer |
The Duals of Upward Planar Graphs on Cylinders. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim E. Levit, Martin Milanic, David Tankus |
On the Recognition of k-Equistable Graphs. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski |
Determining the L(2, 1)-Span in Polynomial Space. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger |
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Gerhard J. Woeginger |
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé |
Parameterized Domination in Circle Graphs. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sara Brunetti, Gennaro Cordasco, Luisa Gargano, Elena Lodi, Walter Quattrociocchi |
Minimum Weight Dynamo and Fast Opinion Spreading - (Extended Abstract). |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Kratsch, Pascal Schweitzer |
Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Carmen Cecilia Centeno, Lucia Draque Penso, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá |
Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3-Convexity. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christine T. Cheng, Eric McDermid, Ichiro Suzuki |
Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rémy Belmonte, Martin Vatshelle |
Graph Classes with Structured Neighborhoods and Algorithmic Applications. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ondrej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec |
On the Complexity of Planar Covering of Small Graphs. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan |
Complexity of Splits Reconstruction for Low-Degree Trees. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Matthias Mnich, Saket Saurabh |
Planar k-Path in Subexponential Time and Polynomial Space. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Katarína Cechlárová, Eva Jelínková |
Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Important Separators and Parameterized Algorithms. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Chaplick, Elad Cohen, Juraj Stacho |
Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström |
Parameterized Two-Player Nash Equilibrium. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki |
Approximability of the Path-Distance-Width for AT-free Graphs. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin |
Alternation Graphs. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Dieter Kratsch |
Exact Algorithms for Kayles. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Liliana Alcón, Luerbio Faria, Celina M. Herrera de Figueiredo, Marisa Gutierrez |
Split Clique Graph Complexity. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Frantisek Galcík, Ján Katrenic, Gabriel Semanisin |
On Computing an Optimal Semi-matching. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Kolman, Jan Kratochvíl (eds.) |
Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
Hanani-Tutte and Monotone Drawings. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marijke H. L. Bodlaender, Cor A. J. Hurkens, Gerhard J. Woeginger |
The Cinderella Game on Holes and Anti-holes. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew R. A. McGrae, Michele Zito |
Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Marchetti-Spaccamela |
Structures and Hyperstructures in Metabolic Networks. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller |
From Few Components to an Eulerian Graph by Adding Arcs. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Felix Arends, Joël Ouaknine, Charles W. Wampler |
On Searching for Small Kochen-Specker Vector Systems. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Fenghui Zhang |
On the Independence Number of Graphs with Maximum Degree 3. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hisao Tamaki |
A Polynomial Time Algorithm for Bounded Directed Pathwidth. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstanty Junosza-Szaniawski, Zbigniew Lonc, Michal Tuczynski |
Counting Independent Sets in Claw-Free Graphs. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter |
Parameterized Complexity of Eulerian Deletion Problems. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Ravsky, Oleg Verbitsky |
On Collinear Sets in Straight-Line Drawings. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Toru Hasunuma, Hiroshi Nagamochi |
Improved Bounds for Minimum Fault-Tolerant Gossip Graphs. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christopher Auer, Andreas Gleißner |
Characterizations of Deque and Queue Graphs. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Emil Feldmann, Shantanu Das 0001, Peter Widmayer |
Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych |
Maximum Independent Set in 2-Direction Outersegment Graphs. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma |
List Coloring in the Absence of a Linear Forest. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Geevarghese Philip, Venkatesh Raman, Yngve Villanger |
A Quartic Kernel for Pathwidth-One Vertex Deletion. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen |
Complexity Results for the Spanning Tree Congestion Problem. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller |
Efficient Algorithms for Eulerian Extension. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitrios M. Thilikos (eds.) |
Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jannik Matuschke, Britta Peis |
Lattices and Maximum Flow Algorithms in Planar Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song |
Narrowing Down the Gap on the Complexity of Coloring Pk-Free Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries |
Colouring Vertices of Triangle-Free Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mike Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu |
Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas |
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamás Fleiner |
On Stable Matchings and Flows. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Paul, Michel Habib (eds.) |
Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Kaminski |
max-cut and Containment Relations in Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx, Ildikó Schlotter |
Parameterized Complexity of the Arc-Preserving Subsequence Problem. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Padmini Mukkamala, János Pach, Deniz Sariöz |
Graphs with Large Obstacle Numbers. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid, Tobias Müller |
The Number of Bits Needed to Represent a Unit Disk Graph. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Paola Flocchini, Bernard Mans, Nicola Santoro |
Network Exploration by Silent and Oblivious Robots. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine |
Algorithmic Graph Minors and Bidimensionality. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof |
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Annabell Berger, Matthias Müller-Hannemann |
Uniform Sampling of Digraphs with a Fixed Degree Sequence. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Isolde Adler, Binh-Minh Bui-Xuan, Yuri Rabinovich, Gabriel Renault, Jan Arne Telle, Martin Vatshelle |
On the Boolean-Width of a Graph: Structure and Applications. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas |
Algorithmic Barriers from Phase Transitions in Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mathieu Liedloff, Ioan Todinca, Yngve Villanger |
Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle |
Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Elsässer, Adrian Ogierman |
Efficient Broadcasting in Random Power Law Networks. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Edyta Szymanska |
The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kyriaki Ioannidou, Stavros D. Nikolopoulos |
The Longest Path Problem is Polynomial on Cocomparability Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Moric, Csaba D. Tóth |
Graphs that Admit Right Angle Crossing Drawings. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ge Xia, Yong Zhang |
On the Small Cycle Transversal of Planar Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | René van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier |
Measuring Indifference: Unit Interval Vertex Deletion. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Dieter Kratsch, Jean-François Couturier |
Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Chaplick, Marisa Gutierrez, Benjamin Lévêque, Silvia B. Tondato |
From Path Graphs to Directed Path Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiri Chechik, David Peleg |
Low-Port Tree Representations. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Andreas Wiese, Fenghui Zhang |
Local Algorithms for Edge Colorings in UDGs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul |
Maximum Series-Parallel Subgraph. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")