Pinar Heggernes
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
65
Venues
20
Active years
2002–2020
Best venue rank
A*
Where they publish
Papers
65 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2020 | LATIN | On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. | Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov |
| 2018 | MFCS | Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. | Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen |
| 2017 | CIAC | Linear-Time Generation of Random Chordal Graphs. | Oylum Seker, Pinar Heggernes, Tnaz Ekim, Z. Caner Taskin |
| 2017 | WG | Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Danil Paulusma |
| 2015 | ISAAC | Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. | Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kant, Dieter Kratsch, Sigve Hortemo Sther, Yngve Villanger |
| 2015 | IWOCA | Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch |
| 2014 | SOFSEM | Finding Disjoint Paths in Split Graphs. | Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei |
| 2014 | WG | Maximal Induced Matchings in Triangle-Free Graphs. | Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger |
| 2014 | WG | Hadwiger Number of Graphs with Small Chordality. | Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul |
| 2014 | WG | Recognizing Threshold Tolerance Graphs in O(n | Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vincius Fernandes dos Santos, Jeremy P. Spinrad |
| 2013 | CIAC | Cliques and Clubs. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey |
| 2013 | ICALP | An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger |
| 2013 | IWOCA | Induced Subtrees in Interval Graphs. | Pinar Heggernes, Pim van 't Hof, Martin Milanic |
| 2013 | LATA | A Multivariate Analysis of Some DFA Problems. | Henning Fernau, Pinar Heggernes, Yngve Villanger |
| 2013 | TAMC | Vector Connectivity in Graphs. | Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic |
| 2012 | COCOON | Ramsey Numbers for Line Graphs and Perfect Graphs. | Rmy Belmonte, Pinar Heggernes, Pim van 't Hof, Reza Saei |
| 2012 | COCOON | Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs. | Jean-Franois Couturier, Pinar Heggernes, Pim van 't Hof, Yngve Villanger |
| 2012 | CSR | Broadcast Domination on Block Graphs in Linear Time. | Pinar Heggernes, Sigve Hortemo Sther |
| 2012 | FUN | Making Life Easier for Firefighters. | Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen |
| 2012 | LATIN | Computing Minimum Geodetic Sets of Proper Interval Graphs. | Tnaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister |
| 2012 | SOFSEM | Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. | Jean-Franois Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch |
| 2012 | WG | How to Eliminate a Graph. | Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Danil Paulusma, Michal Pilipczuk |
| 2012 | WG | On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. | Pinar Heggernes, Pim van 't Hof, Dniel Marx, Neeldhara Misra, Yngve Villanger |
| 2011 | COCOON | A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. | Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski |
| 2011 | CSR | Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width. | Pinar Heggernes, Daniel Meister, Udi Rotics |
| 2011 | FCT | Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. | Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger |
| 2011 | ISAAC | Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. | Rmy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Danil Paulusma |
| 2011 | TAMC | Edge Contractions in Subclasses of Chordal Graphs. | Rmy Belmonte, Pinar Heggernes, Pim van 't Hof |
| 2011 | WADS | Enumerating Minimal Subset Feedback Vertex Sets. | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger |
| 2010 | CIAC | A Parameterized Algorithm for Chordal Sandwich. | Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger |
| 2010 | ISAAC | Induced Subgraph Isomorphism on Interval and Proper Interval Graphs. | Pinar Heggernes, Daniel Meister, Yngve Villanger |
| 2010 | IWOCA | Computing Role Assignments of Proper Interval Graphs in Polynomial Time. | Pinar Heggernes, Pim van 't Hof, Danil Paulusma |
| 2010 | TAMC | Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. | Pinar Heggernes, Daniel Meister, Udi Rotics |
| 2010 | WG | Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof |
| 2010 | WG | Generalized Graph Clustering: Recognizing ( | Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle |
| 2009 | COCOON | Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone. | Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan |
| 2009 | FAW | Edge Search Number of Cographs in Linear Time. | Pinar Heggernes, Rodica Mihai |
| 2009 | ISAAC | Bandwidth on AT-Free Graphs. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh |
| 2009 | IWOCA | Polar Permutation Graphs. | Tnaz Ekim, Pinar Heggernes, Daniel Meister |
| 2009 | MFCS | Choosability of P5-Free Graphs. | Petr A. Golovach, Pinar Heggernes |
| 2009 | TAMC | A Complete Characterisation of the Linear Clique-Width of Path Powers. | Pinar Heggernes, Daniel Meister, Charis Papadopoulos |
| 2008 | FAW | Mixed Search Number of Permutation Graphs. | Pinar Heggernes, Rodica Mihai |
| 2008 | ISAAC | Faster Parameterized Algorithms for Minimum Fill-In. | Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger |
| 2008 | LATIN | Bandwidth of Bipartite Permutation Graphs in Polynomial Time. | Pinar Heggernes, Dieter Kratsch, Daniel Meister |
| 2008 | MFCS | Clustering with Partial Information. | Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond |
| 2008 | TAMC | Graphs of Linear Clique-Width at Most 3. | Pinar Heggernes, Daniel Meister, Charis Papadopoulos |
| 2008 | WG | Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. | Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos |
| 2007 | COCOON | Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions. | Pinar Heggernes, Charis Papadopoulos |
| 2007 | STOC | Interval completion with few edges. | Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger |
| 2007 | STACS | Characterizing Minimal Interval Completions. | Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger |
| 2007 | WG | Mixed Search Number and Linear-Width of Interval and Split Graphs. | Fedor V. Fomin, Pinar Heggernes, Rodica Mihai |
| 2006 | ISAAC | Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions. | Pinar Heggernes, Federico Mancini, Charis Papadopoulos |
| 2006 | LATIN | Minimal Split Completions of Graphs. | Pinar Heggernes, Federico Mancini |
| 2006 | MFCS | Optimal Linear Arrangement of Interval Graphs. | Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov |
| 2005 | ESA | Minimal Interval Completions. | Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger |
| 2005 | FCT | Exact Algorithms for Graph Homomorphisms. | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch |
| 2005 | SODA | Computing minimal triangulations in time O(n | Pinar Heggernes, Jan Arne Telle, Yngve Villanger |
| 2005 | WG | Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time. | Pinar Heggernes, Daniel Lokshtanov |
| 2004 | WG | Finding k Disjoint Triangles in an Arbitrary Graph. | Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle |
| 2003 | FCT | Graph Searching, Elimination Trees, and a Generalization of Bandwidth. | Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle |
| 2003 | ISAAC | A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. | Anne Berry, Pinar Heggernes, Yngve Villanger |
| 2003 | WG | The Minimum Degree Heuristic and the Minimal Triangulation Process. | Anne Berry, Pinar Heggernes, Genevive Simonet |
| 2002 | ESA | Efficient Implementation of a Minimal Triangulation Algorithm. | Pinar Heggernes, Yngve Villanger |
| 2002 | WG | Maximum Cardinality Search for Computing Minimal Triangulations. | Anne Berry, Jean R. S. Blair, Pinar Heggernes |
| 2002 | WG | Generalized H-Coloring and H-Covering of Trees. | Jir Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle |