Pinar Heggernes

185 papers A* 2A 3B 42C 14Misc 10Journal 105Unranked 9

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	On the hardness of problems around s-clubs on split graphs. Discret. Appl. Math. Cristina Bazgan, Pinar Heggernes, André Nichterlein, Thomas Pontoizeau
2022	J	`jnl`	Generation of random chordal graphs using subtrees of a tree. RAIRO Oper. Res. Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin
2022	J	`jnl`	On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. Algorithmica Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov
2020	J	`jnl`	Enumeration of minimal connected dominating sets for chordal graphs. Discret. Appl. Math. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei
2020	J	`jnl`	Finding connected secluded subgraphs. J. Comput. Syst. Sci. Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre
2020	B	`conf`	On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. LATIN Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov
2020	J	`jnl`	Parameterized Aspects of Strong Subgraph Closure. Algorithmica Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos
2020	J	`jnl`	Partitioning a graph into degenerate subgraphs. Eur. J. Comb. Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes
2019	B	`ed.`	44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, Aachen, Germany, August 26-30, 2019 MFCS Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen
2019	C	`ed.`	Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019, Proceedings CIAC Pinar Heggernes
2019	J	`jnl`	Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Algorithmica Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma
2018	J	`jnl`	Enumeration and maximum number of minimal connected vertex covers in graphs. Eur. J. Comb. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
2018	J	`jnl`	Generation of random chordal graphs using subtrees of a tree. CoRR Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin
2018	J	`jnl`	Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Algorithmica Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
2018	—	`conf`	Parameterized Aspects of Strong Subgraph Closure. SWAT Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos
2018	J	`jnl`	Parameterized Aspects of Strong Subgraph Closure. CoRR Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos
2018	J	`jnl`	Partitioning a graph into degenerate subgraphs. CoRR Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes
2018	B	`conf`	Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. MFCS Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen
2017	B	`conf`	Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. WG Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma
2017	J	`jnl`	Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. CoRR Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma
2017	J	`jnl`	Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees. Eur. J. Comb. Lars Jaffke, Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle
2017	B	`conf`	Finding Connected Secluded Subgraphs. IPEC Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre
2017	J	`jnl`	Finding Connected Secluded Subgraphs. CoRR Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre
2017	C	`conf`	Linear-Time Generation of Random Chordal Graphs. CIAC Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin
2017	J	`jnl`	Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded. Discret. Math. Cemil Dibek, Tínaz Ekim, Pinar Heggernes
2017	J	`jnl`	Minimal dominating sets in interval graphs and trees. Discret. Appl. Math. Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger
2017	J	`jnl`	On recognition of threshold tolerance graphs and their complements. Discret. Appl. Math. Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
2017	J	`jnl`	Preface: Algorithmic Graph Theory on the Adriatic Coast. Discret. Appl. Math. Bostjan Bresar, Pinar Heggernes, Marcin Jakub Kaminski, Martin Milanic, Daniël Paulusma, Primoz Potocnik, Nicolas Trotignon
2016	J	`jnl`	Clique-width of path powers. Discret. Appl. Math. Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics
2016	J	`jnl`	Enumerating minimal connected dominating sets in graphs of bounded chordality. Theor. Comput. Sci. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
2016	J	`jnl`	Enumerating minimal dominating sets in chordal bipartite graphs. Discret. Appl. Math. Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger
2016	J	`jnl`	Enumerating minimal dominating sets in chordal graphs. Inf. Process. Lett. Faisal N. Abu-Khzam, Pinar Heggernes
2016	J	`jnl`	Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. CoRR Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
2016	J	`jnl`	Erratum to: Foreword: Special Issue on IPEC 2014. Algorithmica Marek Cygan, Pinar Heggernes
2016	J	`jnl`	Foreword: Sixth Workshop on Graph Classes, Optimization, and Width Parameters, Santorini, Greece, October 2013. Discret. Appl. Math. Pinar Heggernes, Andrzej Proskurowski, Dimitrios M. Thilikos
2016	J	`jnl`	Foreword: Special Issue on IPEC 2014. Algorithmica Marek Cygan, Pinar Heggernes
2016	B	`ed.`	Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers WG Pinar Heggernes
2016	J	`jnl`	Maximal Induced Matchings in Triangle-Free Graphs. J. Graph Theory Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger
2016	J	`jnl`	The Firefighter problem on graph classes. Theor. Comput. Sci. Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen
2015	J	`jnl`	A characterisation of clique-width through nested partitions. Discret. Appl. Math. Bruno Courcelle, Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics
2015	J	`jnl`	A multi-parameter analysis of hard problems on deterministic finite automata. J. Comput. Syst. Sci. Henning Fernau, Pinar Heggernes, Yngve Villanger
2015	J	`jnl`	An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. Algorithmica Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger
2015	J	`jnl`	Computing the metric dimension for chain graphs. Inf. Process. Lett. Henning Fernau, Pinar Heggernes, Pim van 't Hof, Daniel Meister, Reza Saei
2015	B	`conf`	Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality. IPEC Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
2015	C	`conf`	Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. IWOCA Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
2015	J	`jnl`	Finding Disjoint Paths in Split Graphs. Theory Comput. Syst. Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei
2015	J	`jnl`	Hadwiger Number of Graphs with Small Chordality. SIAM J. Discret. Math. Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
2015	J	`jnl`	Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs. Theor. Comput. Sci. Pinar Heggernes, Pim van 't Hof, Daniel Meister, Yngve Villanger
2015	J	`jnl`	Modifying a Graph Using Vertex Elimination. Algorithmica Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk
2015	J	`jnl`	On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. Algorithmica Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger
2015	B	`conf`	Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. ISAAC Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
2015	J	`jnl`	Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. CoRR Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
2015	J	`jnl`	Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality. Electron. Notes Discret. Math. Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle
2014	J	`jnl`	Contracting Graphs to Paths and Trees. Algorithmica Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
2014	J	`jnl`	Contracting chordal graphs and bipartite graphs to paths and trees. Discret. Appl. Math. Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul
2014	J	`jnl`	Detecting Fixed Patterns in Chordal Graphs in Polynomial Time. Algorithmica Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
2014	J	`jnl`	Enumerating Minimal Subset Feedback Vertex Sets. Algorithmica Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger
2014	B	`conf`	Finding Disjoint Paths in Split Graphs. SOFSEM Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei
2014	J	`jnl`	Finding clubs in graph classes. Discret. Appl. Math. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey
2014	J	`jnl`	Graph Modification Problems (Dagstuhl Seminar 14071). Dagstuhl Reports Hans L. Bodlaender, Pinar Heggernes, Daniel Lokshtanov
2014	J	`jnl`	Graph classes and Ramsey numbers. Discret. Appl. Math. Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Arash Rafiey, Reza Saei
2014	J	`jnl`	Guest editors' foreword. Discret. Appl. Math. Pinar Heggernes, Jan Kratochvíl, Sang-il Oum
2014	B	`conf`	Hadwiger Number of Graphs with Small Chordality. WG Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
2014	J	`jnl`	Hadwiger number of graphs with small chordality. CoRR Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
2014	B	`conf`	Maximal Induced Matchings in Triangle-Free Graphs. WG Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger
2014	B	`ed.`	Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers IPEC Marek Cygan, Pinar Heggernes
2014	B	`conf`	Recognizing Threshold Tolerance Graphs in O(n WG Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad
2014	J	`jnl`	Scheduling unit-length jobs with precedence constraints of small height. Oper. Res. Lett. André Berger, Alexander Grigoriev, Pinar Heggernes, Ruben van der Zwaan
2014	J	`jnl`	Subset feedback vertex sets in chordal graphs. J. Discrete Algorithms Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei
2014	J	`jnl`	Vector connectivity in graphs. Networks Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic
2013	C	`conf`	A Multivariate Analysis of Some DFA Problems. LATA Henning Fernau, Pinar Heggernes, Yngve Villanger
2013	—	`conf`	An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. ICALP (1) Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger
2013	J	`jnl`	Choosability on H-free graphs. Inf. Process. Lett. Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Daniël Paulusma
2013	C	`conf`	Cliques and Clubs. CIAC Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey
2013	J	`jnl`	Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization. Inf. Comput. Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2013	C	`conf`	Induced Subtrees in Interval Graphs. IWOCA Pinar Heggernes, Pim van 't Hof, Martin Milanic
2013	J	`jnl`	Maximal induced matchings in triangle-free graphs. CoRR Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger
2013	J	`jnl`	Minimal dominating sets in graph classes: Combinatorial bounds and enumeration. Theor. Comput. Sci. Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch
2013	J	`jnl`	Obtaining a Bipartite Graph by Contracting Few Edges. SIAM J. Discret. Math. Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul
2013	J	`jnl`	Parameterized complexity of vertex deletion into perfect graph classes. Theor. Comput. Sci. Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger
2013	J	`jnl`	Polar permutation graphs are polynomial-time recognisable. Eur. J. Comb. Tínaz Ekim, Pinar Heggernes, Daniel Meister
2013	C	`conf`	Vector Connectivity in Graphs. TAMC Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic
2012	B	`conf`	An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs. IPEC Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei
2012	Misc	`conf`	Broadcast Domination on Block Graphs in Linear Time. CSR Pinar Heggernes, Sigve Hortemo Sæther
2012	J	`jnl`	Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs. Discret. Appl. Math. Pinar Heggernes, Daniel Meister, Charis Papadopoulos
2012	B	`conf`	Computing Minimum Geodetic Sets of Proper Interval Graphs. LATIN Tínaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister
2012	J	`jnl`	Computing role assignments of proper interval graphs in polynomial time. J. Discrete Algorithms Pinar Heggernes, Pim van 't Hof, Daniël Paulusma
2012	J	`jnl`	Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. SIAM J. Discret. Math. Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof
2012	J	`jnl`	Edge contractions in subclasses of chordal graphs. Discret. Appl. Math. Rémy Belmonte, Pinar Heggernes, Pim van 't Hof
2012	J	`jnl`	Edge search number of cographs. Discret. Appl. Math. Petr A. Golovach, Pinar Heggernes, Rodica Mihai
2012	J	`jnl`	Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay CoRR Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger
2012	J	`jnl`	Guest editors' foreword. Discret. Appl. Math. Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski
2012	B	`conf`	How to Eliminate a Graph. WG Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk
2012	Misc	`conf`	Making Life Easier for Firefighters. FUN Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen
2012	Misc	`conf`	Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs. COCOON Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Yngve Villanger
2012	B	`conf`	Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. SOFSEM Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch
2012	B	`conf`	On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. WG Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger
2012	Misc	`conf`	Ramsey Numbers for Line Graphs and Perfect Graphs. COCOON Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Reza Saei
2011	Misc	`conf`	A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. COCOON Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski
2011	J	`jnl`	Bandwidth on AT-free graphs. Theor. Comput. Sci. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh
2011	J	`jnl`	Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs. Theor. Comput. Sci. Pinar Heggernes, Daniel Meister, Andrzej Proskurowski
2011	Misc	`conf`	Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width. CSR Pinar Heggernes, Daniel Meister, Udi Rotics
2011	J	`jnl`	Contracting Graphs to Paths and Trees CoRR Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
2011	B	`conf`	Contracting Graphs to Paths and Trees. IPEC Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
2011	J	`jnl`	Contracting chordal graphs and bipartite graphs to paths and trees. Electron. Notes Discret. Math. Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul
2011	J	`jnl`	Cutwidth of Split Graphs and Threshold Graphs. SIAM J. Discret. Math. Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos
2011	C	`conf`	Edge Contractions in Subclasses of Chordal Graphs. TAMC Rémy Belmonte, Pinar Heggernes, Pim van 't Hof
2011	B	`conf`	Enumerating Minimal Subset Feedback Vertex Sets. WADS Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger
2011	J	`jnl`	Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182). Dagstuhl Reports Andreas Brandstädt, Martin Charles Golumbic, Pinar Heggernes, Ross M. McConnell
2011	J	`jnl`	Faster Parameterized Algorithms for Minimum Fill-in. Algorithmica Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger
2011	B	`conf`	Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. ISAAC Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
2011	J	`jnl`	Graphs of linear clique-width at most 3. Theor. Comput. Sci. Pinar Heggernes, Daniel Meister, Charis Papadopoulos
2011	J	`jnl`	Obtaining a Bipartite Graph by Contracting Few Edges CoRR Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul
2011	—	`conf`	Obtaining a Bipartite Graph by Contracting Few Edges. FSTTCS Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul
2011	B	`conf`	Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. FCT Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger
2011	J	`jnl`	Strongly chordal and chordal bipartite graphs are sandwich monotone. J. Comb. Optim. Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan
2010	C	`conf`	A Parameterized Algorithm for Chordal Sandwich. CIAC Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger
2010	J	`jnl`	Clustering with partial information. Theor. Comput. Sci. Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond
2010	C	`conf`	Computing Role Assignments of Proper Interval Graphs in Polynomial Time. IWOCA Pinar Heggernes, Pim van 't Hof, Daniël Paulusma
2010	B	`conf`	Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. WG Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof
2010	C	`conf`	Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. TAMC Pinar Heggernes, Daniel Meister, Udi Rotics
2010	—	`conf`	Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. SWAT Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	B	`conf`	Generalized Graph Clustering: Recognizing ( WG Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle
2010	J	`jnl`	Guest Editors' Foreword. Discret. Appl. Math. Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski
2010	J	`jnl`	Hardness and approximation of minimum distortion embeddings. Inf. Process. Lett. Pinar Heggernes, Daniel Meister
2010	—	`conf`	Induced Subgraph Isomorphism on Interval and Proper Interval Graphs. ISAAC (2) Pinar Heggernes, Daniel Meister, Yngve Villanger
2010	J	`jnl`	Mixed search number and linear-width of interval and split graphs. Networks Fedor V. Fomin, Pinar Heggernes, Rodica Mihai
2009	C	`conf`	A Complete Characterisation of the Linear Clique-Width of Path Powers. TAMC Pinar Heggernes, Daniel Meister, Charis Papadopoulos
2009	J	`jnl`	A new representation of proper interval graphs with an application to clique-width. Electron. Notes Discret. Math. Pinar Heggernes, Daniel Meister, Charis Papadopoulos
2009	J	`jnl`	Bandwidth of bipartite permutation graphs in polynomial time. J. Discrete Algorithms Pinar Heggernes, Dieter Kratsch, Daniel Meister
2009	B	`conf`	Bandwidth on AT-Free Graphs. ISAAC Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh
2009	B	`conf`	Choosability of P5-Free Graphs. MFCS Petr A. Golovach, Pinar Heggernes
2009	J	`jnl`	Dynamically maintaining split graphs. Discret. Appl. Math. Pinar Heggernes, Federico Mancini
2009	Misc	`conf`	Edge Search Number of Cographs in Linear Time. FAW Pinar Heggernes, Rodica Mihai
2009	J	`jnl`	Interval Completion Is Fixed Parameter Tractable. SIAM J. Comput. Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle
2009	J	`jnl`	Minimal split completions. Discret. Appl. Math. Pinar Heggernes, Federico Mancini
2009	C	`conf`	Polar Permutation Graphs. IWOCA Tínaz Ekim, Pinar Heggernes, Daniel Meister
2009	J	`jnl`	Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions. Theor. Comput. Sci. Pinar Heggernes, Charis Papadopoulos
2009	Misc	`conf`	Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone. COCOON Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan
2008	B	`conf`	Bandwidth of Bipartite Permutation Graphs in Polynomial Time. LATIN Pinar Heggernes, Dieter Kratsch, Daniel Meister
2008	B	`conf`	Clustering with Partial Information. MFCS Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond
2008	B	`conf`	Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. WG Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos
2008	J	`jnl`	Fast Computation of Minimal Fill Inside A Given Elimination Ordering. SIAM J. Matrix Anal. Appl. Pinar Heggernes, Barry W. Peyton
2008	B	`conf`	Faster Parameterized Algorithms for Minimum Fill-In. ISAAC Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger
2008	C	`conf`	Graphs of Linear Clique-Width at Most 3. TAMC Pinar Heggernes, Daniel Meister, Charis Papadopoulos
2008	J	`jnl`	Minimal comparability completions of arbitrary graphs. Discret. Appl. Math. Pinar Heggernes, Federico Mancini, Charis Papadopoulos
2008	—	`conf`	Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs. SWAT Pinar Heggernes, Daniel Meister, Andrzej Proskurowski
2008	Misc	`conf`	Mixed Search Number of Permutation Graphs. FAW Pinar Heggernes, Rodica Mihai
2008	J	`jnl`	Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree. Theor. Comput. Sci. Anne Berry, Elias Dahlhaus, Pinar Heggernes, Geneviève Simonet
2007	A	`conf`	Characterizing Minimal Interval Completions. STACS Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger
2007	J	`jnl`	Exact Algorithms for Graph Homomorphisms. Theory Comput. Syst. Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch
2007	A*	`conf`	Interval completion with few edges. STOC Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger
2007	J	`jnl`	Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nord. J. Comput. Pinar Heggernes, Dieter Kratsch
2007	B	`conf`	Mixed Search Number and Linear-Width of Interval and Split Graphs. WG Fedor V. Fomin, Pinar Heggernes, Rodica Mihai
2007	Misc	`conf`	Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions. COCOON Pinar Heggernes, Charis Papadopoulos
2006	J	`jnl`	A completely dynamic algorithm for split graphs. Electron. Notes Discret. Math. Federico Mancini, Pinar Heggernes
2006	J	`jnl`	A vertex incremental approach for maintaining chordality. Discret. Math. Anne Berry, Pinar Heggernes, Yngve Villanger
2006	J	`jnl`	A wide-range algorithm for minimal triangulation from an arbitrary ordering. J. Algorithms Anne Berry, Jean Paul Bordat, Pinar Heggernes, Geneviève Simonet, Yngve Villanger
2006	B	`conf`	Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions. ISAAC Pinar Heggernes, Federico Mancini, Charis Papadopoulos
2006	B	`conf`	Minimal Split Completions of Graphs. LATIN Pinar Heggernes, Federico Mancini
2006	J	`jnl`	Minimal triangulations of graphs: A survey. Discret. Math. Pinar Heggernes
2006	B	`conf`	Optimal Linear Arrangement of Interval Graphs. MFCS Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov
2006	J	`jnl`	Optimal broadcast domination in polynomial time. Discret. Math. Pinar Heggernes, Daniel Lokshtanov
2005	J	`jnl`	Computing Minimal Triangulations in Time SIAM J. Discret. Math. Pinar Heggernes, Jan Arne Telle, Yngve Villanger
2005	A*	`conf`	Computing minimal triangulations in time O(n SODA Pinar Heggernes, Jan Arne Telle, Yngve Villanger
2005	B	`conf`	Exact Algorithms for Graph Homomorphisms. FCT Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch
2005	J	`jnl`	Graph Searching, Elimination Trees, and a Generalization of Bandwidth. Algorithmica Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
2005	A	`conf`	Minimal Interval Completions. ESA Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger
2005	B	`conf`	Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time. WG Pinar Heggernes, Daniel Lokshtanov
2004	B	`conf`	Finding k Disjoint Triangles in an Arbitrary Graph. WG Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle
2004	J	`jnl`	Maximum Cardinality Search for Computing Minimal Triangulations of Graphs. Algorithmica Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton
2004	—	`conf`	Simple and Efficient Modifications of Elimination Orderings. PARA Pinar Heggernes, Yngve Villanger
2003	B	`conf`	A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. ISAAC Anne Berry, Pinar Heggernes, Yngve Villanger
2003	J	`jnl`	Generalized H-coloring and H-covering of Trees. Nord. J. Comput. Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle
2003	B	`conf`	Graph Searching, Elimination Trees, and a Generalization of Bandwidth. FCT Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
2003	B	`conf`	The Minimum Degree Heuristic and the Minimal Triangulation Process. WG Anne Berry, Pinar Heggernes, Geneviève Simonet
2002	A	`conf`	Efficient Implementation of a Minimal Triangulation Algorithm. ESA Pinar Heggernes, Yngve Villanger
2002	B	`conf`	Generalized H-Coloring and H-Covering of Trees. WG Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle
2002	B	`conf`	Maximum Cardinality Search for Computing Minimal Triangulations. WG Anne Berry, Jean R. S. Blair, Pinar Heggernes
2001	J	`jnl`	A practical algorithm for making filled graphs minimal. Theor. Comput. Sci. Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle
2000	J	`jnl`	Methods for Large Scale Total Least Squares Problems. SIAM J. Matrix Anal. Appl. Åke Björck, Pinar Heggernes, P. Matstoms
2000	—	`conf`	Recognizing Weakly Triangulated Graphs by Edge Separability. SWAT Anne Berry, Jean Paul Bordat, Pinar Heggernes
2000	J	`jnl`	Recognizing Weakly Triangulated Graphs by Edge Separability. Nord. J. Comput. Anne Berry, Jean Paul Bordat, Pinar Heggernes
1998	J	`jnl`	Partitioning Graphs into Generalized Dominating Sets. Nord. J. Comput. Pinar Heggernes, Jan Arne Telle
1996	—	`conf`	Making an Arbitrary Filled Graph Minimal by Removing Fill Edges. SWAT Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle