Pinar Heggernes

ORCID

Publication Activity (10 Years)

Years Active: 1996-2022
Publications (10 Years): 49

Top Venues

Publications

Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin
Generation of random chordal graphs using subtrees of a tree. RAIRO Oper. Res. 56 (2) (2022)
Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. Algorithmica 84 (12) (2022)
Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre
Finding connected secluded subgraphs. J. Comput. Syst. Sci. 113 (2020)
Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos
Parameterized Aspects of Strong Subgraph Closure. Algorithmica 82 (7) (2020)
Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes
Partitioning a graph into degenerate subgraphs. Eur. J. Comb. 83 (2020)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei
Enumeration of minimal connected dominating sets for chordal graphs. Discret. Appl. Math. 278 (2020)
Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. LATIN (2020)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Algorithmica 81 (7) (2019)
Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos
Parameterized Aspects of Strong Subgraph Closure. CoRR (2018)
Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin
Generation of random chordal graphs using subtrees of a tree. CoRR (2018)
Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes
Partitioning a graph into degenerate subgraphs. CoRR (2018)
Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen
Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. MFCS (2018)
Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos
Parameterized Aspects of Strong Subgraph Closure. SWAT (2018)
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Algorithmica 80 (2) (2018)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
Enumeration and maximum number of minimal connected vertex covers in graphs. Eur. J. Comb. 68 (2018)
Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
On recognition of threshold tolerance graphs and their complements. Discret. Appl. Math. 216 (2017)
Bostjan Bresar, Pinar Heggernes, Marcin Jakub Kaminski, Martin Milanic, Daniël Paulusma, Primoz Potocnik, Nicolas Trotignon
Preface: Algorithmic Graph Theory on the Adriatic Coast. Discret. Appl. Math. 231 (2017)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. CoRR (2017)
Lars Jaffke, Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle
Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees. Eur. J. Comb. 66 (2017)
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger
Minimal dominating sets in interval graphs and trees. Discret. Appl. Math. 216 (2017)
Cemil Dibek, Tínaz Ekim, Pinar Heggernes
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded. Discret. Math. 340 (5) (2017)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. WG (2017)
Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre
Finding Connected Secluded Subgraphs. CoRR (2017)
Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre
Finding Connected Secluded Subgraphs. IPEC (2017)
Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin
Linear-Time Generation of Random Chordal Graphs. CIAC (2017)
Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger
Maximal Induced Matchings in Triangle-Free Graphs. J. Graph Theory 83 (3) (2016)
Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen
The Firefighter problem on graph classes. Theor. Comput. Sci. 613 (2016)
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger
Enumerating minimal dominating sets in chordal bipartite graphs. Discret. Appl. Math. 199 (2016)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. CoRR (2016)
Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics
Clique-width of path powers. Discret. Appl. Math. 205 (2016)
Marek Cygan, Pinar Heggernes
Foreword: Special Issue on IPEC 2014. Algorithmica 75 (2) (2016)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
Enumerating minimal connected dominating sets in graphs of bounded chordality. Theor. Comput. Sci. 630 (2016)
Pinar Heggernes, Andrzej Proskurowski, Dimitrios M. Thilikos
Foreword: Sixth Workshop on Graph Classes, Optimization, and Width Parameters, Santorini, Greece, October 2013. Discret. Appl. Math. 199 (2016)
Faisal N. Abu-Khzam, Pinar Heggernes
Enumerating minimal dominating sets in chordal graphs. Inf. Process. Lett. 116 (12) (2016)
Marek Cygan, Pinar Heggernes
Erratum to: Foreword: Special Issue on IPEC 2014. Algorithmica 75 (2) (2016)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. IWOCA (2015)
Henning Fernau, Pinar Heggernes, Pim van 't Hof, Daniel Meister, Reza Saei
Computing the metric dimension for chain graphs. Inf. Process. Lett. 115 (9) (2015)
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. CoRR (2015)
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk
Modifying a Graph Using Vertex Elimination. Algorithmica 72 (1) (2015)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. Algorithmica 72 (3) (2015)
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. ISAAC (2015)
Bruno Courcelle, Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics
A characterisation of clique-width through nested partitions. Discret. Appl. Math. 187 (2015)
Henning Fernau, Pinar Heggernes, Yngve Villanger
A multi-parameter analysis of hard problems on deterministic finite automata. J. Comput. Syst. Sci. 81 (4) (2015)
Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. Algorithmica 72 (3) (2015)
Pinar Heggernes, Pim van 't Hof, Daniel Meister, Yngve Villanger
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs. Theor. Comput. Sci. 562 (2015)
Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle
Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality. Electron. Notes Discret. Math. 49 (2015)
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
Hadwiger Number of Graphs with Small Chordality. SIAM J. Discret. Math. 29 (3) (2015)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality. IPEC (2015)
Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei
Finding Disjoint Paths in Split Graphs. Theory Comput. Syst. 57 (1) (2015)
André Berger, Alexander Grigoriev, Pinar Heggernes, Ruben van der Zwaan
Scheduling unit-length jobs with precedence constraints of small height. Oper. Res. Lett. 42 (2) (2014)
Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei
Finding Disjoint Paths in Split Graphs. SOFSEM (2014)
Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
Contracting Graphs to Paths and Trees. Algorithmica 68 (1) (2014)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei
Subset feedback vertex sets in chordal graphs. J. Discrete Algorithms 26 (2014)
Hans L. Bodlaender, Pinar Heggernes, Daniel Lokshtanov
Graph Modification Problems (Dagstuhl Seminar 14071). Dagstuhl Reports 4 (2) (2014)
Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger
Maximal Induced Matchings in Triangle-Free Graphs. WG (2014)
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
Hadwiger Number of Graphs with Small Chordality. WG (2014)
Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Arash Rafiey, Reza Saei
Graph classes and Ramsey numbers. Discret. Appl. Math. 173 (2014)
Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul
Contracting chordal graphs and bipartite graphs to paths and trees. Discret. Appl. Math. 164 (2014)
Pinar Heggernes, Jan Kratochvíl, Sang-il Oum
Guest editors' foreword. Discret. Appl. Math. 168 (2014)
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
Hadwiger number of graphs with small chordality. CoRR (2014)
Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic
Vector connectivity in graphs. Networks 63 (4) (2014)
Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger
Enumerating Minimal Subset Feedback Vertex Sets. Algorithmica 69 (1) (2014)
Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
Detecting Fixed Patterns in Chordal Graphs in Polynomial Time. Algorithmica 69 (3) (2014)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey
Finding clubs in graph classes. Discret. Appl. Math. 174 (2014)
Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad
) Time. WG (2014)
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul
Obtaining a Bipartite Graph by Contracting Few Edges. SIAM J. Discret. Math. 27 (4) (2013)
Tínaz Ekim, Pinar Heggernes, Daniel Meister
Polar permutation graphs are polynomial-time recognisable. Eur. J. Comb. 34 (3) (2013)
Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger
Maximal induced matchings in triangle-free graphs. CoRR (2013)
Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization. Inf. Comput. 231 (2013)
Henning Fernau, Pinar Heggernes, Yngve Villanger
A Multivariate Analysis of Some DFA Problems. LATA (2013)
Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger
Parameterized complexity of vertex deletion into perfect graph classes. Theor. Comput. Sci. 511 (2013)
Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch
Minimal dominating sets in graph classes: Combinatorial bounds and enumeration. Theor. Comput. Sci. 487 (2013)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey
Cliques and Clubs. CIAC (2013)
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Daniël Paulusma
Choosability on H-free graphs. Inf. Process. Lett. 113 (4) (2013)
Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic
Vector Connectivity in Graphs. TAMC (2013)
Pinar Heggernes, Pim van 't Hof, Martin Milanic
Induced Subtrees in Interval Graphs. IWOCA (2013)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. ICALP (1) (2013)
Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Reza Saei
Ramsey Numbers for Line Graphs and Perfect Graphs. COCOON (2012)
Pinar Heggernes, Pim van 't Hof, Daniël Paulusma
Computing role assignments of proper interval graphs in polynomial time. J. Discrete Algorithms 14 (2012)
Rémy Belmonte, Pinar Heggernes, Pim van 't Hof
Edge contractions in subclasses of chordal graphs. Discret. Appl. Math. 160 (7-8) (2012)
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk
How to Eliminate a Graph. WG (2012)
Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski
Guest editors' foreword. Discret. Appl. Math. 160 (6) (2012)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger
Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay CoRR (2012)
Petr A. Golovach, Pinar Heggernes, Rodica Mihai
Edge search number of cographs. Discret. Appl. Math. 160 (6) (2012)
Pinar Heggernes, Daniel Meister, Charis Papadopoulos
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs. Discret. Appl. Math. 160 (6) (2012)
Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Yngve Villanger
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs. COCOON (2012)
Tínaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister
Computing Minimum Geodetic Sets of Proper Interval Graphs. LATIN (2012)
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. SIAM J. Discret. Math. 26 (3) (2012)
Pinar Heggernes, Sigve Hortemo Sæther
Broadcast Domination on Block Graphs in Linear Time. CSR (2012)
Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch
Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. SOFSEM (2012)
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)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei
An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs. IPEC (2012)
Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen
Making Life Easier for Firefighters. FUN (2012)
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul
Obtaining a Bipartite Graph by Contracting Few Edges CoRR (2011)
Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. ISAAC (2011)
Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos
Cutwidth of Split Graphs and Threshold Graphs. SIAM J. Discret. Math. 25 (3) (2011)
Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
Contracting Graphs to Paths and Trees CoRR (2011)
Andreas Brandstädt, Martin Charles Golumbic, Pinar Heggernes, Ross M. McConnell
Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182). Dagstuhl Reports 1 (5) (2011)
Pinar Heggernes, Daniel Meister, Udi Rotics
Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width. CSR (2011)
Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger
Faster Parameterized Algorithms for Minimum Fill-in. Algorithmica 61 (4) (2011)

Pinar Heggernes.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Pinar Heggernes