×
Compute Distance To:
Author ID: heggernes.pinar Recent zbMATH articles by "Heggernes, Pinar"
Published as: Heggernes, Pinar; Heggernes, P.
Homepage: http://www.ii.uib.no/~pinar/
External Links: MGP · ORCID · Wikidata · Google Scholar · dblp · GND
all top 5

Co-Authors

3 single-authored
38 van ’t Hof, Pim
34 Golovach, Petr A.
32 Villanger, Yngve
31 Kratsch, Dieter
23 Meister, Daniel
21 Papadopoulos, Charis
15 Lokshtanov, Daniel
15 Telle, Jan Arne
11 Mancini, Federico
10 Fomin, Fedor V.
10 Paul, Christophe
10 Paulusma, Daniël
10 Saei, Reza
9 Berry, Anne
7 Lima, Paloma T.
7 Mihai, Rodica
6 Belmonte, Rémy
6 Bodlaender, Hans L.
6 Ekim, Tınaz
6 Proskurowski, Andrzej
5 Blair, Jean R. S.
4 Kanté, Mamadou Moustapha
4 Lévêque, Benjamin
4 Milanič, Martin
4 Nederlof, Jesper
4 Rotics, Udi
4 Saurabh, Saket
4 Van Leeuwen, Erik Jan
3 Bordat, Jean-Paul
3 Couturier, Jean-Francois
3 Fellows, Michael Ralph
3 Fernau, Henning
3 Kamiński, Marcin Marek
3 Kratochvíl, Jan
3 Manne, Fredrik
3 Rafiey, Arash
3 Rosamond, Frances A.
3 Sæther, Sigve Hortemo
3 Simonet, Geneviève
2 Abu-Khzam, Faisal N.
2 Basavaraju, Manu
2 Boros, Endre
2 Cygan, Marek
2 dos Santos, Vinícius Fernandes
2 Fiala, Jiří
2 Jansen, Bart M. P.
2 Konstantinidis, Athanasios L.
2 Kratsch, Stefan
2 Kristiansen, Petter
2 Lindzey, Nathan
2 Marx, Dániel
2 McConnell, Ross M.
2 Misra, Neeldhara
2 Montealegre, Pedro
2 Peyton, Barry W.
2 Pilipczuk, Michał
2 Raman, Venkatesh
2 Şeker, Oylum
2 Spinrad, Jeremy P.
2 Sritharan, R.
2 Suchan, Karol
2 Taşkın, Z. Caner
2 Todinca, Ioan
1 Aspvall, Bengt
1 Berger, André
1 Björck, Åke
1 Brešar, Boštjan
1 Bui-Xuan, Binh-Minh
1 Christophe, Paul
1 Cohen, Johanne
1 Courcelle, Bruno
1 Dahlhaus, Elias
1 Dibek, Cemil
1 Erey, Aysel
1 Feghali, Carl
1 Grigoriev, Alexander
1 Horton, Steve
1 Issac, Davis
1 Jaffke, Lars
1 Katoen, Joost-Pieter
1 Kucherov, Gregory
1 Lauri, Juho
1 Matstoms, Pontus
1 Oum, Sang-Il
1 Potočnik, Primož
1 Rossmanith, Peter
1 Sloper, Christian
1 Szwarcfiter, Jayme Luiz
1 Thilikos, Dimitrios M.
1 Trotignon, Nicolas
1 van der Zwaan, Ruben

Publications by Year

Citations contained in zbMATH Open

140 Publications have been cited 1,001 times in 627 Documents Cited by Year
Minimal triangulations of graphs: a survey. Zbl 1086.05069
Heggernes, Pinar
53
2006
Linear-time certifying recognition algorithms and forbidden induced subgraphs. Zbl 1169.68653
Heggernes, Pinar; Kratsch, Dieter
34
2007
Maximum cardinality search for computing minimal triangulations of graphs. Zbl 1090.68080
Berry, Anne; Blair, Jean R. S.; Heggernes, Pinar; Peyton, Barry W.
29
2004
Partitioning graphs into generalized dominating sets. Zbl 0905.68100
Heggernes, Pinar; Telle, Jan Arne
27
1998
Interval completion is fixed parameter tractable. Zbl 1227.05241
Villanger, Yngve; Heggernes, Pinar; Paul, Christophe; Telle, Jan Arne
26
2009
Finding \(k\) disjoint triangles in an arbitrary graph. Zbl 1112.68418
Fellows, Mike; Heggernes, Pinar; Rosamond, Frances; Sloper, Christian; Telle, Jan Arne
25
2004
Optimal broadcast domination in polynomial time. Zbl 1115.68115
Heggernes, Pinar; Lokshtanov, Daniel
23
2006
A wide-range algorithm for minimal triangulation from an arbitrary ordering. Zbl 1093.68137
Berry, Anne; Bordat, Jean-Paul; Heggernes, Pinar; Simonet, Geneviéve; Villanger, Yngve
21
2006
Computing minimal triangulations in time \(O(n^{\alpha}\log n) = o(n ^{2.376})\). Zbl 1105.05066
Heggernes, Pinar; Telle, Jan Arne; Villanger, Yngve
20
2005
Contracting graphs to paths and trees. Zbl 1310.68229
Heggernes, Pinar; van ’t Hof, Pim; Lévêque, Benjamin; Lokshtanov, Daniel; Paul, Christophe
19
2014
A practical algorithm for making filled graphs minimal. Zbl 0952.68104
Blair, J. R. S.; Heggernes, P.; Telle, J. A.
18
2001
Minimal dominating sets in graph classes: combinatorial bounds and enumeration. Zbl 1283.05200
Couturier, Jean-François; Heggernes, Pinar; van ’t Hof, Pim; Kratsch, Dieter
17
2013
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs. Zbl 1238.05196
Heggernes, Pinar; Meister, Daniel; Papadopoulos, Charis
16
2012
Obtaining a bipartite graph by contracting few edges. Zbl 1285.05167
Heggernes, Pinar; Van ’T Hof, Pim; Lokshtanov, Daniel; Paul, Christophe
15
2013
Methods for large scale total least squares problems. Zbl 0974.65037
Björck, Åke; Heggernes, P.; Matstoms, P.
15
2000
Enumerating minimal subset feedback vertex sets. Zbl 1303.05189
Fomin, Fedor V.; Heggernes, Pinar; Kratsch, Dieter; Papadopoulos, Charis; Villanger, Yngve
15
2014
Recognizing weakly triangulated graphs by edge separability. Zbl 0972.68126
Berry, Anne; Bordat, Jean-Paul; Heggernes, Pinar
14
2000
Graphs of linear clique-width at most 3. Zbl 1225.68135
Heggernes, Pinar; Meister, Daniel; Papadopoulos, Charis
13
2011
Broadcast domination algorithms for interval graphs, series-parallel graphs, and trees. Zbl 1066.05138
Blair, Jean R. S.; Heggernes, Pinar; Horton, Steve; Manne, Frederik
13
2004
Computing the metric dimension for chain graphs. Zbl 1329.05095
Fernau, Henning; Heggernes, Pinar; van ’t Hof, Pim; Meister, Daniel; Saei, Reza
13
2015
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets. Zbl 1330.05118
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Villanger, Yngve
12
2015
Subset feedback vertex sets in chordal graphs. Zbl 1298.05302
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Saei, Reza
12
2014
Exact algorithms for graph homomorphisms. Zbl 1119.68133
Fomin, Fedor V.; Heggernes, Pinar; Kratsch, Dieter
12
2007
Graph searching, elimination trees, and a generalization of bandwidth. Zbl 1082.68082
Fomin, Fedor V.; Heggernes, Pinar; Telle, Jan Arne
12
2005
Enumerating minimal dominating sets in chordal bipartite graphs. Zbl 1326.05105
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou M.; Kratsch, Dieter; Villanger, Yngve
11
2016
A vertex incremental approach for maintaining chordality. Zbl 1087.05054
Berry, Anne; Heggernes, Pinar; Villanger, Yngve
11
2006
Parameterized complexity of vertex deletion into perfect graph classes. Zbl 1407.68223
Heggernes, Pinar; van ’t Hof, Pim; Jansen, Bart M. P.; Kratsch, Stefan; Villanger, Yngve
11
2013
Computing minimum geodetic sets of proper interval graphs. Zbl 1353.68119
Ekim, Tınaz; Erey, Aysel; Heggernes, Pinar; van ’t Hof, Pim; Meister, Daniel
11
2012
Optimal linear arrangement of interval graphs. Zbl 1132.68501
Cohen, Johanne; Fomin, Fedor; Heggernes, Pinar; Kratsch, Dieter; Kucherov, Gregory
11
2006
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Zbl 1383.05162
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve H.; Villanger, Yngve
10
2018
Detecting fixed patterns in chordal graphs in polynomial time. Zbl 1291.68173
Belmonte, Rémy; Golovach, Petr A.; Heggernes, Pinar; van’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël
10
2014
Finding minimum height elimination trees for interval graphs in polynomial time. Zbl 0822.68071
Aspvall, Bengt; Heggernes, Pinar
10
1994
The minimum degree heuristic and the minimal triangulation process. Zbl 1255.05186
Berry, Anne; Heggernes, Pinar; Simonet, Geneviève
10
2003
Interval completion with few edges. Zbl 1232.68074
Heggernes, Pinar; Paul, Christophe; Teile, Jan Arne; Villanger, Yngve
10
2007
Minimal comparability completions of arbitrary graphs. Zbl 1136.05072
Heggernes, Pinar; Mancini, Federico; Papadopoulos, Charis
9
2008
Obtaining a bipartite graph by contracting few edges. Zbl 1246.68132
Heggernes, Pinar; van ’t Hof, Pim; Lokshtanov, Daniel; Paul, Christophe
9
2011
Minimal split completions. Zbl 1211.05136
Heggernes, Pinar; Mancini, Federico
9
2009
Enumerating minimal dominating sets in chordal graphs. Zbl 1371.05127
Abu-Khzam, Faisal N.; Heggernes, Pinar
9
2016
Bandwidth of bipartite permutation graphs in polynomial time. Zbl 1209.05242
Heggernes, Pinar; Kratsch, Dieter; Meister, Daniel
9
2009
Induced subgraph isomorphism on proper interval and bipartite permutation graphs. Zbl 1303.68060
Heggernes, Pinar; van ’t Hof, Pim; Meister, Daniel; Villanger, Yngve
9
2015
A new representation of proper interval graphs with an application to clique-width. Zbl 1267.05176
Heggernes, Pinar; Meister, Daniel; Papadopoulos, Charis
8
2009
Parameterized complexity of vertex deletion into perfect graph classes. Zbl 1342.68165
Heggernes, Pinar; van’t Hof, Pim; Jansen, Bart M. P.; Kratsch, Stefan; Villanger, Yngve
8
2011
A multi-parameter analysis of hard problems on deterministic finite automata. Zbl 1320.68090
Fernau, Henning; Heggernes, Pinar; Villanger, Yngve
8
2015
Graph classes and Ramsey numbers. Zbl 1298.05220
Belmonte, Rémy; Heggernes, Pinar; van’t Hof, Pim; Rafiey, Arash; Saei, Reza
8
2014
Finding clubs in graph classes. Zbl 1298.05092
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Rafiey, Arash
8
2014
Contracting chordal graphs and bipartite graphs to paths and trees. Zbl 1288.05060
Heggernes, Pinar; van ’t Hof, Pim; Lévêque, Benjamin; Paul, Christophe
7
2014
Minimal interval completions. Zbl 1162.68494
Heggernes, Pinar; Suchan, Karol; Todinca, Ioan; Villanger, Yngve
7
2005
Faster parameterized algorithms for Minimum Fill-in. Zbl 1230.68100
Bodlaender, Hans L.; Heggernes, Pinar; Villanger, Yngve
7
2011
Finding contractions and induced minors in chordal graphs via disjoint paths. Zbl 1350.68129
Belmonte, Rémy; Golovach, Petr A.; Heggernes, Pinar; van ’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël
7
2011
Minimal split completions of graphs. Zbl 1145.05324
Heggernes, Pinar; Mancini, Federico
7
2006
A complete characterisation of the linear clique-width of path powers. Zbl 1241.05120
Heggernes, Pinar; Meister, Daniel; Papadopoulos, Charis
7
2009
Maximum number of minimal feedback vertex sets in chordal graphs and cographs. Zbl 1365.05133
Couturier, Jean-François; Heggernes, Pinar; van ’t Hof, Pim; Villanger, Yngve
7
2012
Characterizing minimal interval completions. Towards better understanding of profile and pathwidth. (Extended abstract). Zbl 1171.68620
Heggernes, Pinar; Suchan, Karol; Todinca, Ioan; Villanger, Yngve
7
2007
Generalized graph clustering: recognizing \((p,q)\)-cluster graphs. Zbl 1309.68153
Heggernes, Pinar; Lokshtanov, Daniel; Nederlof, Jesper; Paul, Christophe; Telle, Jan Arne
7
2010
Enumerating minimal connected dominating sets in graphs of bounded chordality. Zbl 1339.05190
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter
7
2016
Finding disjoint paths in split graphs. Zbl 1329.68142
Heggernes, Pinar; van ’t Hof, Pim; van Leeuwen, Erik Jan; Saei, Reza
6
2015
Cutwidth of split graphs and threshold graphs. Zbl 1237.05089
Heggernes, Pinar; Lokshtanov, Daniel; Mihai, Rodica; Papadopoulos, Charis
6
2011
Edge contractions in subclasses of chordal graphs. Zbl 1331.68097
Belmonte, Rémy; Heggernes, Pinar; van ’t Hof, Pim
6
2011
Dynamically maintaining split graphs. Zbl 1179.05106
Heggernes, Pinar; Mancini, Federico
6
2009
A vertex incremental approach for dynamically maintaining chordal graphs. Zbl 1205.68256
Berry, Anne; Heggernes, Pinar; Villanger, Yngve
6
2003
Choosability of \(P _{5}\)-free graphs. Zbl 1250.68127
Golovach, Petr A.; Heggernes, Pinar
6
2009
Maximum cardinality search for computing minimal triangulations. Zbl 1022.68088
Berry, Anne; Blair, Jean R. S.; Heggernes, Pinar
6
2002
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions. Zbl 1161.68040
Heggernes, Pinar; Papadopoulos, Charis
6
2009
Induced subgraph isomorphism on interval and proper interval graphs. Zbl 1310.68109
Heggernes, Pinar; Meister, Daniel; Villanger, Yngve
6
2010
Polar permutation graphs. Zbl 1267.05215
Ekim, Tınaz; Heggernes, Pinar; Meister, Daniel
6
2009
Enumeration and maximum number of minimal connected vertex covers in graphs. Zbl 1373.05008
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter
5
2018
Minimal dominating sets in interval graphs and trees. Zbl 1350.05121
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Villanger, Yngve
5
2017
On recognition of threshold tolerance graphs and their complements. Zbl 1350.05054
Golovach, Petr A.; Heggernes, Pinar; Lindzey, Nathan; McConnell, Ross M.; dos Santos, Vinícius Fernandes; Spinrad, Jeremy P.; Szwarcfiter, Jayme Luiz
5
2017
Computing the clique-width of large path powers in linear time via a new characterisation of clique-width. Zbl 1332.68078
Heggernes, Pinar; Meister, Daniel; Rotics, Udi
5
2011
Edge contractions in subclasses of chordal graphs. Zbl 1243.05225
Belmonte, Rémy; Heggernes, Pinar; Van ’t Hof, Pim
5
2012
Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing. Zbl 1285.68207
Heggernes, Pinar; Kratsch, Dieter; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
5
2010
A characterisation of clique-width through nested partitions. Zbl 1315.05110
Courcelle, Bruno; Heggernes, Pinar; Meister, Daniel; Papadopoulos, Charis; Rotics, Udi
5
2015
Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree. Zbl 1155.68088
Berry, Anne; Dahlhaus, Elias; Heggernes, Pinar; Simonet, Geneviève
5
2008
Linear-time generation of random chordal graphs. Zbl 1486.68138
Şeker, Oylum; Heggernes, Pinar; Ekim, Tınaz; Taşkın, Z. Caner
4
2017
The firefighter problem on graph classes. Zbl 1333.05290
Fomin, Fedor V.; Heggernes, Pinar; van Leeuwen, Erik Jan
4
2016
Contracting chordal graphs and bipartite graphs to paths and trees. Zbl 1268.05201
Heggernes, Pinar; van ’t Hof, Pim; Lévêque, Benjamin; Christophe, Paul
4
2011
Enumerating minimal subset feedback vertex sets. Zbl 1342.68162
Fomin, Fedor V.; Heggernes, Pinar; Kratsch, Dieter; Papadopoulos, Charis; Villanger, Yngve
4
2011
Mixed search number of permutation graphs. Zbl 1143.68588
Heggernes, Pinar; Mihai, Rodica
4
2008
Mixed search number and linear-width of interval and split graphs. Zbl 1141.68526
Fomin, Fedor V.; Heggernes, Pinar; Mihai, Rodica
4
2007
Broadcast domination on block graphs in linear time. Zbl 1360.05115
Heggernes, Pinar; Sæther, Sigve H.
4
2012
Computing role assignments of proper interval graphs in polynomial time. Zbl 1247.05240
Heggernes, Pinar; Van ’t Hof, Pim; Paulusma, Daniël
4
2012
Efficient implementation of a minimal triangulation algorithm. Zbl 1019.68809
Heggernes, Pinar; Villanger, Yngve
4
2002
Polar permutation graphs are polynomial-time recognisable. Zbl 1257.05127
Ekim, Tınaz; Heggernes, Pinar; Meister, Daniel
4
2013
Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\). Zbl 1297.05120
Heggernes, Pinar; Telle, Jan Arne; Villanger, Yngve
4
2005
Hadwiger number of graphs with small chordality. Zbl 1327.05322
Golovach, Petr A.; Heggernes, Pinar; van ’t Hof, Pim; Paul, Christophe
3
2015
Maximal induced matchings in triangle-free graphs. Zbl 1417.05159
Basavaraju, Manu; Heggernes, Pinar; van’t Hof, Pim; Saei, Reza; Villanger, Yngve
3
2014
Hadwiger number of graphs with small chordality. Zbl 1417.05209
Golovach, Petr A.; Heggernes, Pinar; van’t Hof, Pim; Paul, Christophe
3
2014
Bandwidth on AT-free graphs. Zbl 1228.68036
Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter; Lokshtanov, Daniel; Meister, Daniel; Saurabh, Saket
3
2011
Edge search number of cographs. Zbl 1238.68107
Golovach, Petr A.; Heggernes, Pinar; Mihai, Rodica
3
2012
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs. Zbl 1211.68287
Heggernes, Pinar; Meister, Daniel; Proskurowski, Andrzej
3
2011
Making arbitrary graphs transitively orientable: Minimal comparability completions. Zbl 1135.05305
Heggernes, Pinar; Mancini, Federico; Papadopoulos, Charis
3
2006
Contracting graphs to paths and trees. Zbl 1310.68228
Heggernes, Pinar; van ’t Hof, Pim; Lévêque, Benjamin; Lokshtanov, Daniel; Paul, Christophe
3
2012
Minimal dominating sets in graph classes: combinatorial bounds and enumeration. Zbl 1298.05246
Couturier, Jean-François; Heggernes, Pinar; van’t Hof, Pim; Kratsch, Dieter
3
2012
A parameterized algorithm for chordal sandwich. Zbl 1200.05226
Heggernes, Pinar; Mancini, Federico; Nederlof, Jesper; Villanger, Yngve
3
2010
Maximal induced matchings in triangle-free graphs. Zbl 1350.05130
Basavaraju, Manu; Heggernes, Pinar; Hof, Pim van’t; Saei, Reza; Villanger, Yngve
3
2016
Generalized \(H\)-coloring and \(H\)-covering of trees. Zbl 1094.68609
Fiala, Jiří; Heggernes, Pinar; Kristiansen, Petter; Telle, Jan Arne
3
2003
An exact algorithm for subset feedback vertex set on chordal graphs. Zbl 1374.05216
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Saei, Reza
3
2012
A multivariate analysis of some DFA problems. Zbl 1377.68109
Fernau, Henning; Heggernes, Pinar; Villanger, Yngve
3
2013
Clustering with partial information. Zbl 1173.68596
Bodlaender, Hans L.; Fellows, Michael R.; Heggernes, Pinar; Mancini, Federico; Papadopoulos, Charis; Rosamond, Frances
3
2008
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions. Zbl 1206.05097
Heggernes, Pinar; Papadopoulos, Charis
3
2007
Parameterized aspects of strong subgraph closure. Zbl 1442.68168
Golovach, Petr A.; Heggernes, Pinar; Konstantinidis, Athanasios L.; Lima, Paloma T.; Papadopoulos, Charis
2
2020
Enumeration of minimal connected dominating sets for chordal graphs. Zbl 1437.05104
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Saei, Reza
1
2020
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. Zbl 1421.68082
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Lima, Paloma T.; Paulusma, Daniël
1
2019
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Zbl 1383.05162
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve H.; Villanger, Yngve
10
2018
Enumeration and maximum number of minimal connected vertex covers in graphs. Zbl 1373.05008
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter
5
2018
Rainbow vertex coloring bipartite graphs and chordal graphs. Zbl 07378400
Heggernes, Pinar; Issac, Davis; Lauri, Juho; Lima, Paloma T.; van Leeuwen, Erik Jan
2
2018
Parameterized aspects of strong subgraph closure. Zbl 1442.68169
Golovach, Petr A.; Heggernes, Pinar; Konstantinidis, Athanasios L.; Lima, Paloma T.; Papadopoulos, Charis
1
2018
Minimal dominating sets in interval graphs and trees. Zbl 1350.05121
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Villanger, Yngve
5
2017
On recognition of threshold tolerance graphs and their complements. Zbl 1350.05054
Golovach, Petr A.; Heggernes, Pinar; Lindzey, Nathan; McConnell, Ross M.; dos Santos, Vinícius Fernandes; Spinrad, Jeremy P.; Szwarcfiter, Jayme Luiz
5
2017
Linear-time generation of random chordal graphs. Zbl 1486.68138
Şeker, Oylum; Heggernes, Pinar; Ekim, Tınaz; Taşkın, Z. Caner
4
2017
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. Zbl 1421.68081
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Lima, Paloma T.; Paulusma, Daniël
2
2017
Enumerating minimal dominating sets in chordal bipartite graphs. Zbl 1326.05105
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou M.; Kratsch, Dieter; Villanger, Yngve
11
2016
Enumerating minimal dominating sets in chordal graphs. Zbl 1371.05127
Abu-Khzam, Faisal N.; Heggernes, Pinar
9
2016
Enumerating minimal connected dominating sets in graphs of bounded chordality. Zbl 1339.05190
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter
7
2016
The firefighter problem on graph classes. Zbl 1333.05290
Fomin, Fedor V.; Heggernes, Pinar; van Leeuwen, Erik Jan
4
2016
Maximal induced matchings in triangle-free graphs. Zbl 1350.05130
Basavaraju, Manu; Heggernes, Pinar; Hof, Pim van’t; Saei, Reza; Villanger, Yngve
3
2016
Enumeration and maximum number of minimal connected vertex covers in graphs. Zbl 1476.68208
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter
3
2016
Clique-width of path powers. Zbl 1333.05221
Heggernes, Pinar; Meister, Daniel; Papadopoulos, Charis; Rotics, Udi
2
2016
Computing the metric dimension for chain graphs. Zbl 1329.05095
Fernau, Henning; Heggernes, Pinar; van ’t Hof, Pim; Meister, Daniel; Saei, Reza
13
2015
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets. Zbl 1330.05118
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Villanger, Yngve
12
2015
Induced subgraph isomorphism on proper interval and bipartite permutation graphs. Zbl 1303.68060
Heggernes, Pinar; van ’t Hof, Pim; Meister, Daniel; Villanger, Yngve
9
2015
A multi-parameter analysis of hard problems on deterministic finite automata. Zbl 1320.68090
Fernau, Henning; Heggernes, Pinar; Villanger, Yngve
8
2015
Finding disjoint paths in split graphs. Zbl 1329.68142
Heggernes, Pinar; van ’t Hof, Pim; van Leeuwen, Erik Jan; Saei, Reza
6
2015
A characterisation of clique-width through nested partitions. Zbl 1315.05110
Courcelle, Bruno; Heggernes, Pinar; Meister, Daniel; Papadopoulos, Charis; Rotics, Udi
5
2015
Hadwiger number of graphs with small chordality. Zbl 1327.05322
Golovach, Petr A.; Heggernes, Pinar; van ’t Hof, Pim; Paul, Christophe
3
2015
Recognizability equals definability for graphs of bounded treewidth and bounded chordality. Zbl 1346.05249
Bodlaender, Hans L.; Heggernes, Pinar; Telle, Jan Arne
3
2015
On the parameterized complexity of finding separators with non-hereditary properties. Zbl 1328.68094
Heggernes, Pinar; van ’t Hof, Pim; Marx, Dániel; Misra, Neeldhara; Villanger, Yngve
1
2015
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Zbl 1382.05033
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve H.; Villanger, Yngve
1
2015
Contracting graphs to paths and trees. Zbl 1310.68229
Heggernes, Pinar; van ’t Hof, Pim; Lévêque, Benjamin; Lokshtanov, Daniel; Paul, Christophe
19
2014
Enumerating minimal subset feedback vertex sets. Zbl 1303.05189
Fomin, Fedor V.; Heggernes, Pinar; Kratsch, Dieter; Papadopoulos, Charis; Villanger, Yngve
15
2014
Subset feedback vertex sets in chordal graphs. Zbl 1298.05302
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Saei, Reza
12
2014
Detecting fixed patterns in chordal graphs in polynomial time. Zbl 1291.68173
Belmonte, Rémy; Golovach, Petr A.; Heggernes, Pinar; van’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël
10
2014
Graph classes and Ramsey numbers. Zbl 1298.05220
Belmonte, Rémy; Heggernes, Pinar; van’t Hof, Pim; Rafiey, Arash; Saei, Reza
8
2014
Finding clubs in graph classes. Zbl 1298.05092
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Rafiey, Arash
8
2014
Contracting chordal graphs and bipartite graphs to paths and trees. Zbl 1288.05060
Heggernes, Pinar; van ’t Hof, Pim; Lévêque, Benjamin; Paul, Christophe
7
2014
Maximal induced matchings in triangle-free graphs. Zbl 1417.05159
Basavaraju, Manu; Heggernes, Pinar; van’t Hof, Pim; Saei, Reza; Villanger, Yngve
3
2014
Hadwiger number of graphs with small chordality. Zbl 1417.05209
Golovach, Petr A.; Heggernes, Pinar; van’t Hof, Pim; Paul, Christophe
3
2014
Finding disjoint paths in split graphs. Zbl 1432.68357
Heggernes, Pinar; van ’t Hof, Pim; van Leeuwen, Erik Jan; Saei, Reza
2
2014
Vector connectivity in graphs. Zbl 1386.05096
Boros, Endre; Heggernes, Pinar; van’t Hof, Pim; Milanič, Martin
1
2014
Minimal dominating sets in graph classes: combinatorial bounds and enumeration. Zbl 1283.05200
Couturier, Jean-François; Heggernes, Pinar; van ’t Hof, Pim; Kratsch, Dieter
17
2013
Obtaining a bipartite graph by contracting few edges. Zbl 1285.05167
Heggernes, Pinar; Van ’T Hof, Pim; Lokshtanov, Daniel; Paul, Christophe
15
2013
Parameterized complexity of vertex deletion into perfect graph classes. Zbl 1407.68223
Heggernes, Pinar; van ’t Hof, Pim; Jansen, Bart M. P.; Kratsch, Stefan; Villanger, Yngve
11
2013
Polar permutation graphs are polynomial-time recognisable. Zbl 1257.05127
Ekim, Tınaz; Heggernes, Pinar; Meister, Daniel
4
2013
A multivariate analysis of some DFA problems. Zbl 1377.68109
Fernau, Henning; Heggernes, Pinar; Villanger, Yngve
3
2013
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets. Zbl 1336.05133
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Villanger, Yngve
2
2013
Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization. Zbl 1358.68313
Heggernes, Pinar; Kratsch, Dieter; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
2
2013
Choosability on \(H\)-free graphs. Zbl 1259.68092
Golovach, Petr A.; Heggernes, Pinar; van ’t Hof, Pim; Paulusma, Daniël
1
2013
Vector connectivity in graphs. Zbl 1372.68119
Boros, Endre; Heggernes, Pinar; van ’t Hof, Pim; Milanič, Martin
1
2013
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs. Zbl 1238.05196
Heggernes, Pinar; Meister, Daniel; Papadopoulos, Charis
16
2012
Computing minimum geodetic sets of proper interval graphs. Zbl 1353.68119
Ekim, Tınaz; Erey, Aysel; Heggernes, Pinar; van ’t Hof, Pim; Meister, Daniel
11
2012
Maximum number of minimal feedback vertex sets in chordal graphs and cographs. Zbl 1365.05133
Couturier, Jean-François; Heggernes, Pinar; van ’t Hof, Pim; Villanger, Yngve
7
2012
Edge contractions in subclasses of chordal graphs. Zbl 1243.05225
Belmonte, Rémy; Heggernes, Pinar; Van ’t Hof, Pim
5
2012
Broadcast domination on block graphs in linear time. Zbl 1360.05115
Heggernes, Pinar; Sæther, Sigve H.
4
2012
Computing role assignments of proper interval graphs in polynomial time. Zbl 1247.05240
Heggernes, Pinar; Van ’t Hof, Pim; Paulusma, Daniël
4
2012
Edge search number of cographs. Zbl 1238.68107
Golovach, Petr A.; Heggernes, Pinar; Mihai, Rodica
3
2012
Contracting graphs to paths and trees. Zbl 1310.68228
Heggernes, Pinar; van ’t Hof, Pim; Lévêque, Benjamin; Lokshtanov, Daniel; Paul, Christophe
3
2012
Minimal dominating sets in graph classes: combinatorial bounds and enumeration. Zbl 1298.05246
Couturier, Jean-François; Heggernes, Pinar; van’t Hof, Pim; Kratsch, Dieter
3
2012
An exact algorithm for subset feedback vertex set on chordal graphs. Zbl 1374.05216
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Saei, Reza
3
2012
Ramsey numbers for line graphs and perfect graphs. Zbl 1365.05190
Belmonte, Rémy; Heggernes, Pinar; van ’t Hof, Pim; Saei, Reza
2
2012
Computing the cutwidth of bipartite permutation graphs in linear time. Zbl 1256.05213
Heggernes, Pinar; Van ’t Hof, Pim; Lokshtanov, Daniel; Nederlof, Jesper
2
2012
How to eliminate a graph. Zbl 1311.68119
Golovach, Petr A.; Heggernes, Pinar; van’t Hof, Pim; Manne, Fredrik; Paulusma, Daniël; Pilipczuk, Michał
1
2012
On the parameterized complexity of finding separators with non-hereditary properties. Zbl 1341.68060
Heggernes, Pinar; van’t Hof, Pim; Marx, Dániel; Misra, Neeldhara; Villanger, Yngve
1
2012
Graphs of linear clique-width at most 3. Zbl 1225.68135
Heggernes, Pinar; Meister, Daniel; Papadopoulos, Charis
13
2011
Obtaining a bipartite graph by contracting few edges. Zbl 1246.68132
Heggernes, Pinar; van ’t Hof, Pim; Lokshtanov, Daniel; Paul, Christophe
9
2011
Parameterized complexity of vertex deletion into perfect graph classes. Zbl 1342.68165
Heggernes, Pinar; van’t Hof, Pim; Jansen, Bart M. P.; Kratsch, Stefan; Villanger, Yngve
8
2011
Faster parameterized algorithms for Minimum Fill-in. Zbl 1230.68100
Bodlaender, Hans L.; Heggernes, Pinar; Villanger, Yngve
7
2011
Finding contractions and induced minors in chordal graphs via disjoint paths. Zbl 1350.68129
Belmonte, Rémy; Golovach, Petr A.; Heggernes, Pinar; van ’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël
7
2011
Cutwidth of split graphs and threshold graphs. Zbl 1237.05089
Heggernes, Pinar; Lokshtanov, Daniel; Mihai, Rodica; Papadopoulos, Charis
6
2011
Edge contractions in subclasses of chordal graphs. Zbl 1331.68097
Belmonte, Rémy; Heggernes, Pinar; van ’t Hof, Pim
6
2011
Computing the clique-width of large path powers in linear time via a new characterisation of clique-width. Zbl 1332.68078
Heggernes, Pinar; Meister, Daniel; Rotics, Udi
5
2011
Contracting chordal graphs and bipartite graphs to paths and trees. Zbl 1268.05201
Heggernes, Pinar; van ’t Hof, Pim; Lévêque, Benjamin; Christophe, Paul
4
2011
Enumerating minimal subset feedback vertex sets. Zbl 1342.68162
Fomin, Fedor V.; Heggernes, Pinar; Kratsch, Dieter; Papadopoulos, Charis; Villanger, Yngve
4
2011
Bandwidth on AT-free graphs. Zbl 1228.68036
Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter; Lokshtanov, Daniel; Meister, Daniel; Saurabh, Saket
3
2011
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs. Zbl 1211.68287
Heggernes, Pinar; Meister, Daniel; Proskurowski, Andrzej
3
2011
Strongly chordal and chordal bipartite graphs are sandwich monotone. Zbl 1230.90161
Heggernes, Pinar; Mancini, Federico; Papadopoulos, Charis; Sritharan, R.
1
2011
A generic approach to decomposition algorithms, with an application to digraph decomposition. Zbl 1353.68291
Bui-Xuan, Binh-Minh; Heggernes, Pinar; Meister, Daniel; Proskurowski, Andrzej
1
2011
Generalized graph clustering: recognizing \((p,q)\)-cluster graphs. Zbl 1309.68153
Heggernes, Pinar; Lokshtanov, Daniel; Nederlof, Jesper; Paul, Christophe; Telle, Jan Arne
7
2010
Induced subgraph isomorphism on interval and proper interval graphs. Zbl 1310.68109
Heggernes, Pinar; Meister, Daniel; Villanger, Yngve
6
2010
Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing. Zbl 1285.68207
Heggernes, Pinar; Kratsch, Dieter; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
5
2010
A parameterized algorithm for chordal sandwich. Zbl 1200.05226
Heggernes, Pinar; Mancini, Federico; Nederlof, Jesper; Villanger, Yngve
3
2010
Hardness and approximation of minimum distortion embeddings. Zbl 1209.68372
Heggernes, Pinar; Meister, Daniel
3
2010
Mixed search number and linear-width of interval and split graphs. Zbl 1204.68145
Fomin, Fedor V.; Heggernes, Pinar; Mihai, Rodica
3
2010
Clustering with partial information. Zbl 1213.05222
Bodlaender, Hans L.; Fellows, Michael R.; Heggernes, Pinar; Mancini, Federico; Papadopoulos, Charis; Rosamond, Frances
2
2010
Computing the cutwidth of bipartite permutation graphs in linear time. Zbl 1310.05199
Heggernes, Pinar; van ’t Hof, Pim; Lokshtanov, Daniel; Nederlof, Jesper
2
2010
Exploiting restricted linear structure to cope with the hardness of clique-width. Zbl 1284.68280
Heggernes, Pinar; Meister, Daniel; Rotics, Udi
1
2010
Interval completion is fixed parameter tractable. Zbl 1227.05241
Villanger, Yngve; Heggernes, Pinar; Paul, Christophe; Telle, Jan Arne
26
2009
Minimal split completions. Zbl 1211.05136
Heggernes, Pinar; Mancini, Federico
9
2009
Bandwidth of bipartite permutation graphs in polynomial time. Zbl 1209.05242
Heggernes, Pinar; Kratsch, Dieter; Meister, Daniel
9
2009
A new representation of proper interval graphs with an application to clique-width. Zbl 1267.05176
Heggernes, Pinar; Meister, Daniel; Papadopoulos, Charis
8
2009
A complete characterisation of the linear clique-width of path powers. Zbl 1241.05120
Heggernes, Pinar; Meister, Daniel; Papadopoulos, Charis
7
2009
Dynamically maintaining split graphs. Zbl 1179.05106
Heggernes, Pinar; Mancini, Federico
6
2009
Choosability of \(P _{5}\)-free graphs. Zbl 1250.68127
Golovach, Petr A.; Heggernes, Pinar
6
2009
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions. Zbl 1161.68040
Heggernes, Pinar; Papadopoulos, Charis
6
2009
Polar permutation graphs. Zbl 1267.05215
Ekim, Tınaz; Heggernes, Pinar; Meister, Daniel
6
2009
Edge search number of cographs in linear time. Zbl 1248.05200
Heggernes, Pinar; Mihai, Rodica
2
2009
Bandwidth on AT-free graphs. Zbl 1272.05199
Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter; Lokshtanov, Daniel; Meister, Daniel; Saurabh, Saket
2
2009
Minimal comparability completions of arbitrary graphs. Zbl 1136.05072
Heggernes, Pinar; Mancini, Federico; Papadopoulos, Charis
9
2008
Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree. Zbl 1155.68088
Berry, Anne; Dahlhaus, Elias; Heggernes, Pinar; Simonet, Geneviève
5
2008
Mixed search number of permutation graphs. Zbl 1143.68588
Heggernes, Pinar; Mihai, Rodica
4
2008
Clustering with partial information. Zbl 1173.68596
Bodlaender, Hans L.; Fellows, Michael R.; Heggernes, Pinar; Mancini, Federico; Papadopoulos, Charis; Rosamond, Frances
3
2008
...and 40 more Documents
all top 5

Cited by 873 Authors

54 Heggernes, Pinar
43 Paulusma, Daniël
32 Golovach, Petr A.
24 Kratsch, Dieter
22 Papadopoulos, Charis
20 Villanger, Yngve
18 Lokshtanov, Daniel
18 van ’t Hof, Pim
16 Fomin, Fedor V.
16 Saurabh, Saket
14 Meister, Daniel
12 Pilipczuk, Michał
12 Thilikos, Dimitrios M.
11 Ekim, Tınaz
11 Telle, Jan Arne
11 Todinca, Ioan
11 Van Leeuwen, Erik Jan
11 Wang, Jianxin
10 Dabrowski, Konrad Kazimierz
10 Gutin, Gregory Z.
10 Kanté, Mamadou Moustapha
9 Berry, Anne
9 Henning, Michael Anthony
9 Johnson, Matthew
9 Liedloff, Mathieu
9 Marx, Dániel
9 Milanič, Martin
9 Otachi, Yota
9 Rautenbach, Dieter
9 Tale, Prafullkumar
8 Bodlaender, Hans L.
8 Fernau, Henning
8 Komusiewicz, Christian
8 Mancini, Federico
7 Brandstädt, Andreas
7 Crespelle, Christophe
7 Dereniowski, Dariusz
7 Feng, Qilong
7 Paul, Christophe
7 Perez, Anthony
7 Uno, Takeaki
7 Yeo, Anders
6 Agrawal, Akanksha
6 Bessy, Stéphane
6 Chen, Jian-er
6 Dourado, Mitre Costa
6 Fiala, Jiří
6 Gurski, Frank
6 Huang, Jing
6 Kwon, Ojoung
6 Lima, Paloma T.
6 Lozin, Vadim Vladislavovich
6 Pilipczuk, Marcin L.
6 Simonet, Geneviève
5 Abu-Khzam, Faisal N.
5 Alecu, Bogdan
5 Belmonte, Rémy
5 Bonamy, Marthe
5 Courcelle, Bruno
5 Golumbic, Martin Charles
5 Habib, Michel A.
5 Hell, Pavol
5 Kamiński, Marcin Marek
5 Kratochvíl, Jan
5 Mihai, Rodica
5 Müller, Haiko
5 Saei, Reza
5 Saitoh, Toshiki
5 Sayadi, Mohamed Yosri
4 Blair, Jean R. S.
4 Cao, Yixin
4 Dyer, Danny D.
4 Fellows, Michael Ralph
4 Foucaud, Florent
4 Guo, Jiong
4 Jaffke, Lars
4 Kijima, Shuji
4 Kim, Eun Jung
4 Konstantinidis, Athanasios L.
4 Kratsch, Stefan
4 Lê Văn Băng
4 Lévêque, Benjamin
4 Li, Wenjun
4 Lipshteyn, Marina
4 MacGillivray, Gary
4 Martin, Barnaby D.
4 Monnot, Jérôme
4 Mynhardt, Christina Magdalena
4 Niedermeier, Rolf
4 Okamoto, Yoshio
4 Raman, Venkatesh
4 Rehs, Carolin
4 Rotics, Udi
4 Şeker, Oylum
4 Shalom, Mordechai
4 Sikora, Florian
4 Szeider, Stefan
4 Uehara, Ryuhei
4 Wahlström, Magnus
4 Zamaraev, Victor A.
...and 773 more Authors
all top 5

Cited in 83 Serials

98 Theoretical Computer Science
94 Discrete Applied Mathematics
52 Algorithmica
29 Information Processing Letters
28 Discrete Mathematics
25 Journal of Computer and System Sciences
15 SIAM Journal on Discrete Mathematics
13 Theory of Computing Systems
8 European Journal of Combinatorics
8 Journal of Combinatorial Optimization
7 Graphs and Combinatorics
7 Information and Computation
7 Discrete Optimization
6 Discrete Mathematics, Algorithms and Applications
5 Linear Algebra and its Applications
5 Discussiones Mathematicae. Graph Theory
5 Journal of Discrete Algorithms
5 Algorithms
4 Journal of Combinatorial Theory. Series B
4 Numerical Algorithms
4 The Electronic Journal of Combinatorics
3 Artificial Intelligence
3 Applied Mathematics and Computation
3 Journal of Graph Theory
3 Networks
3 SIAM Journal on Computing
3 Computational Geometry
3 European Journal of Operational Research
3 RAIRO. Operations Research
3 Bulletin of the Malaysian Mathematical Sciences Society. Second Series
2 Applied Numerical Mathematics
2 International Journal of Approximate Reasoning
2 Annals of Operations Research
2 International Journal of Foundations of Computer Science
2 Computational Statistics and Data Analysis
2 The Australasian Journal of Combinatorics
2 Cybernetics and Systems Analysis
2 The Journal of Artificial Intelligence Research (JAIR)
2 Bernoulli
2 Logical Methods in Computer Science
2 Ars Mathematica Contemporanea
2 Computer Science Review
2 ACM Transactions on Computation Theory
1 Acta Informatica
1 BIT
1 Calcolo
1 Information Sciences
1 Journal of Computational and Applied Mathematics
1 Kyungpook Mathematical Journal
1 Numerische Mathematik
1 Operations Research
1 Quaestiones Mathematicae
1 Advances in Applied Mathematics
1 Acta Mathematicae Applicatae Sinica. English Series
1 Journal of Automated Reasoning
1 SIAM Journal on Matrix Analysis and Applications
1 International Journal of Computer Mathematics
1 Journal of Knot Theory and its Ramifications
1 SIAM Journal on Optimization
1 Fractals
1 Journal of Geodesy
1 Soft Computing
1 Mathematical Methods of Operations Research
1 Journal of Graph Algorithms and Applications
1 Discrete Mathematics and Theoretical Computer Science. DMTCS
1 Central European Journal of Mathematics
1 Quantum Information Processing
1 South East Asian Journal of Mathematics and Mathematical Sciences
1 ACM Transactions on Computational Logic
1 ACM Journal of Experimental Algorithmics
1 Internet Mathematics
1 Acta Numerica
1 AKCE International Journal of Graphs and Combinatorics
1 Parallel Processing Letters
1 Optimization Letters
1 Applicable Analysis and Discrete Mathematics
1 Acta Universitatis Sapientiae. Informatica
1 RAIRO. Theoretical Informatics and Applications
1 Statistics and Computing
1 EURO Journal on Computational Optimization
1 Open Mathematics
1 Journal of Siberian Federal University. Mathematics & Physics
1 Prikladnaya Diskretnaya Matematika

Citations by Year

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.