default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPinar Heggernes
Person information
- affiliation: University of Bergen, Norway
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j90]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): 3587-3602 (2022)- [j89]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): 565-582 (2022) - 2020
- [j88]Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos:
Parameterized Aspects of Strong Subgraph Closure. Algorithmica 82(7): 2006-2038 (2020) - [j87]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei:
Enumeration of minimal connected dominating sets for chordal graphs. Discret. Appl. Math. 278: 3-11 (2020) - [j86]Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes:
Partitioning a graph into degenerate subgraphs. Eur. J. Comb. 83 (2020) - [j85]Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre:
Finding connected secluded subgraphs. J. Comput. Syst. Sci. 113: 101-124 (2020) - [c76]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: 600-612
2010 – 2019
- 2019
- [j84]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): 2795-2828 (2019) - [e4]Pinar Heggernes:
Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019, Proceedings. Lecture Notes in Computer Science 11485, Springer 2019, ISBN 978-3-030-17401-9 [contents] - [e3]Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen:
44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany. LIPIcs 138, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-117-7 [contents] - 2018
- [j83]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): 714-741 (2018) - [j82]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch:
Enumeration and maximum number of minimal connected vertex covers in graphs. Eur. J. Comb. 68: 132-147 (2018) - [c75]Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen:
Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. MFCS 2018: 83:1-83:13 - [c74]Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos:
Parameterized Aspects of Strong Subgraph Closure. SWAT 2018: 23:1-23:13 - [i14]Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos:
Parameterized Aspects of Strong Subgraph Closure. CoRR abs/1802.10386 (2018) - [i13]Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes:
Partitioning a graph into degenerate subgraphs. CoRR abs/1803.04388 (2018) - [i12]Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin:
Generation of random chordal graphs using subtrees of a tree. CoRR abs/1810.13326 (2018) - 2017
- [j81]Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger:
Minimal dominating sets in interval graphs and trees. Discret. Appl. Math. 216: 162-170 (2017) - [j80]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: 171-180 (2017) - [j79]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: 1-3 (2017) - [j78]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): 927-934 (2017) - [j77]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: 191-234 (2017) - [c73]Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin:
Linear-Time Generation of Random Chordal Graphs. CIAC 2017: 442-453 - [c72]Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre:
Finding Connected Secluded Subgraphs. IPEC 2017: 18:1-18:13 - [c71]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: 275-288 - [i11]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 abs/1703.05102 (2017) - [i10]Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre:
Finding Connected Secluded Subgraphs. CoRR abs/1710.10979 (2017) - 2016
- [j76]Marek Cygan, Pinar Heggernes:
Foreword: Special Issue on IPEC 2014. Algorithmica 75(2): 255-256 (2016) - [j75]Marek Cygan, Pinar Heggernes:
Erratum to: Foreword: Special Issue on IPEC 2014. Algorithmica 75(2): 257 (2016) - [j74]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: 1-2 (2016) - [j73]Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger:
Enumerating minimal dominating sets in chordal bipartite graphs. Discret. Appl. Math. 199: 30-36 (2016) - [j72]Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics:
Clique-width of path powers. Discret. Appl. Math. 205: 62-72 (2016) - [j71]Faisal N. Abu-Khzam, Pinar Heggernes:
Enumerating minimal dominating sets in chordal graphs. Inf. Process. Lett. 116(12): 739-743 (2016) - [j70]Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger:
Maximal Induced Matchings in Triangle-Free Graphs. J. Graph Theory 83(3): 231-250 (2016) - [j69]Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen:
The Firefighter problem on graph classes. Theor. Comput. Sci. 613: 38-50 (2016) - [j68]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch:
Enumerating minimal connected dominating sets in graphs of bounded chordality. Theor. Comput. Sci. 630: 63-75 (2016) - [e2]Pinar Heggernes:
Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers. Lecture Notes in Computer Science 9941, 2016, ISBN 978-3-662-53535-6 [contents] - [i9]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch:
Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. CoRR abs/1602.07504 (2016) - 2015
- [j67]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): 99-125 (2015) - [j66]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): 687-713 (2015) - [j65]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger:
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. Algorithmica 72(3): 836-859 (2015) - [j64]Bruno Courcelle, Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics:
A characterisation of clique-width through nested partitions. Discret. Appl. Math. 187: 70-81 (2015) - [j63]Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle:
Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality. Electron. Notes Discret. Math. 49: 559-568 (2015) - [j62]Henning Fernau, Pinar Heggernes, Pim van 't Hof, Daniel Meister, Reza Saei:
Computing the metric dimension for chain graphs. Inf. Process. Lett. 115(9): 671-676 (2015) - [j61]Henning Fernau, Pinar Heggernes, Yngve Villanger:
A multi-parameter analysis of hard problems on deterministic finite automata. J. Comput. Syst. Sci. 81(4): 747-765 (2015) - [j60]Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei:
Finding Disjoint Paths in Split Graphs. Theory Comput. Syst. 57(1): 140-159 (2015) - [j59]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul:
Hadwiger Number of Graphs with Small Chordality. SIAM J. Discret. Math. 29(3): 1427-1451 (2015) - [j58]Pinar Heggernes, Pim van 't Hof, Daniel Meister, Yngve Villanger:
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs. Theor. Comput. Sci. 562: 252-269 (2015) - [c70]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: 248-258 - [c69]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch:
Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. IWOCA 2015: 235-247 - [c68]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch:
Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality. IPEC 2015: 307-318 - [i8]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 abs/1509.03753 (2015) - 2014
- [j57]Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul:
Contracting Graphs to Paths and Trees. Algorithmica 68(1): 109-132 (2014) - [j56]Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger:
Enumerating Minimal Subset Feedback Vertex Sets. Algorithmica 69(1): 216-231 (2014) - [j55]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): 501-521 (2014) - [j54]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: 444-449 (2014) - [j53]Pinar Heggernes, Jan Kratochvíl, Sang-il Oum:
Guest editors' foreword. Discret. Appl. Math. 168: 1-2 (2014) - [j52]Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Arash Rafiey, Reza Saei:
Graph classes and Ramsey numbers. Discret. Appl. Math. 173: 16-27 (2014) - [j51]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey:
Finding clubs in graph classes. Discret. Appl. Math. 174: 57-65 (2014) - [j50]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei:
Subset feedback vertex sets in chordal graphs. J. Discrete Algorithms 26: 7-15 (2014) - [j49]Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic:
Vector connectivity in graphs. Networks 63(4): 277-285 (2014) - [j48]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): 166-172 (2014) - [c67]Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei:
Finding Disjoint Paths in Split Graphs. SOFSEM 2014: 315-326 - [c66]Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger:
Maximal Induced Matchings in Triangle-Free Graphs. WG 2014: 93-104 - [c65]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul:
Hadwiger Number of Graphs with Small Chordality. WG 2014: 201-213 - [c64]Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad:
Recognizing Threshold Tolerance Graphs in O(n2) Time. WG 2014: 214-224 - [e1]Marek Cygan, Pinar Heggernes:
Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers. Lecture Notes in Computer Science 8894, Springer 2014, ISBN 978-3-319-13523-6 [contents] - [i7]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul:
Hadwiger number of graphs with small chordality. CoRR abs/1406.3812 (2014) - [i6]Hans L. Bodlaender, Pinar Heggernes, Daniel Lokshtanov:
Graph Modification Problems (Dagstuhl Seminar 14071). Dagstuhl Reports 4(2): 38-59 (2014) - 2013
- [j47]Tínaz Ekim, Pinar Heggernes, Daniel Meister:
Polar permutation graphs are polynomial-time recognisable. Eur. J. Comb. 34(3): 576-592 (2013) - [j46]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: 109-116 (2013) - [j45]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Daniël Paulusma:
Choosability on H-free graphs. Inf. Process. Lett. 113(4): 107-110 (2013) - [j44]Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul:
Obtaining a Bipartite Graph by Contracting Few Edges. SIAM J. Discret. Math. 27(4): 2143-2156 (2013) - [j43]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: 82-94 (2013) - [j42]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: 172-180 (2013) - [c63]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey:
Cliques and Clubs. CIAC 2013: 276-287 - [c62]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger:
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. ICALP (1) 2013: 485-496 - [c61]Pinar Heggernes, Pim van 't Hof, Martin Milanic:
Induced Subtrees in Interval Graphs. IWOCA 2013: 230-243 - [c60]Henning Fernau, Pinar Heggernes, Yngve Villanger:
A Multivariate Analysis of Some DFA Problems. LATA 2013: 275-286 - [c59]Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic:
Vector Connectivity in Graphs. TAMC 2013: 331-342 - [i5]Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger:
Maximal induced matchings in triangle-free graphs. CoRR abs/1312.5180 (2013) - 2012
- [j41]Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski:
Guest editors' foreword. Discret. Appl. Math. 160(6): 683-684 (2012) - [j40]Petr A. Golovach, Pinar Heggernes, Rodica Mihai:
Edge search number of cographs. Discret. Appl. Math. 160(6): 734-743 (2012) - [j39]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): 888-901 (2012) - [j38]Rémy Belmonte, Pinar Heggernes, Pim van 't Hof:
Edge contractions in subclasses of chordal graphs. Discret. Appl. Math. 160(7-8): 999-1010 (2012) - [j37]Pinar Heggernes, Pim van 't Hof, Daniël Paulusma:
Computing role assignments of proper interval graphs in polynomial time. J. Discrete Algorithms 14: 173-188 (2012) - [j36]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): 1008-1021 (2012) - [c58]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: 133-144 - [c57]Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Reza Saei:
Ramsey Numbers for Line Graphs and Perfect Graphs. COCOON 2012: 204-215 - [c56]Pinar Heggernes, Sigve Hortemo Sæther:
Broadcast Domination on Block Graphs in Linear Time. CSR 2012: 172-183 - [c55]Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen:
Making Life Easier for Firefighters. FUN 2012: 177-188 - [c54]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei:
An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs. IPEC 2012: 85-96 - [c53]Tínaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister:
Computing Minimum Geodetic Sets of Proper Interval Graphs. LATIN 2012: 279-290 - [c52]Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch:
Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. SOFSEM 2012: 202-213 - [c51]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk:
How to Eliminate a Graph. WG 2012: 320-331 - [c50]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: 332-343 - [i4]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger:
Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay. CoRR abs/1208.5345 (2012) - 2011
- [j35]Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger:
Faster Parameterized Algorithms for Minimum Fill-in. Algorithmica 61(4): 817-838 (2011) - [j34]Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul:
Contracting chordal graphs and bipartite graphs to paths and trees. Electron. Notes Discret. Math. 37: 87-92 (2011) - [j33]Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan:
Strongly chordal and chordal bipartite graphs are sandwich monotone. J. Comb. Optim. 22(3): 438-456 (2011) - [j32]Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos:
Cutwidth of Split Graphs and Threshold Graphs. SIAM J. Discret. Math. 25(3): 1418-1437 (2011) - [j31]Pinar Heggernes, Daniel Meister, Andrzej Proskurowski:
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs. Theor. Comput. Sci. 412(12-14): 1275-1297 (2011) - [j30]Pinar Heggernes, Daniel Meister, Charis Papadopoulos:
Graphs of linear clique-width at most 3. Theor. Comput. Sci. 412(39): 5466-5486 (2011) - [j29]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh:
Bandwidth on AT-free graphs. Theor. Comput. Sci. 412(50): 7001-7008 (2011) - [c49]Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski:
A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. COCOON 2011: 331-342 - [c48]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: 233-246 - [c47]Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger:
Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. FCT 2011: 240-251 - [c46]Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul:
Obtaining a Bipartite Graph by Contracting Few Edges. FSTTCS 2011: 217-228 - [c45]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: 110-119 - [c44]Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul:
Contracting Graphs to Paths and Trees. IPEC 2011: 55-66 - [c43]Rémy Belmonte, Pinar Heggernes, Pim van 't Hof:
Edge Contractions in Subclasses of Chordal Graphs. TAMC 2011: 528-539 - [c42]Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger:
Enumerating Minimal Subset Feedback Vertex Sets. WADS 2011: 399-410 - [i3]Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul:
Obtaining a Bipartite Graph by Contracting Few Edges. CoRR abs/1102.5441 (2011) - [i2]Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul:
Contracting Graphs to Paths and Trees. CoRR abs/1104.3677 (2011) - [i1]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): 29-46 (2011) - 2010
- [j28]Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski:
Guest Editors' Foreword. Discret. Appl. Math. 158(7): 729-730 (2010) - [j27]Pinar Heggernes, Daniel Meister:
Hardness and approximation of minimum distortion embeddings. Inf. Process. Lett. 110(8-9): 312-316 (2010) - [j26]Fedor V. Fomin, Pinar Heggernes, Rodica Mihai:
Mixed search number and linear-width of interval and split graphs. Networks 56(3): 207-214 (2010) - [j25]Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond:
Clustering with partial information. Theor. Comput. Sci. 411(7-9): 1202-1211 (2010) - [c41]Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger:
A Parameterized Algorithm for Chordal Sandwich. CIAC 2010: 120-130 - [c40]Pinar Heggernes, Daniel Meister, Yngve Villanger:
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs. ISAAC (2) 2010: 399-409 - [c39]Pinar Heggernes, Pim van 't Hof, Daniël Paulusma:
Computing Role Assignments of Proper Interval Graphs in Polynomial Time. IWOCA 2010: 167-180 - [c38]Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. SWAT 2010: 334-345 - [c37]Pinar Heggernes, Daniel Meister, Udi Rotics:
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. TAMC 2010: 284-295 - [c36]Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof:
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. WG 2010: 75-87 - [c35]Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle:
Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs. WG 2010: 171-183
2000 – 2009
- 2009
- [j24]Pinar Heggernes, Federico Mancini:
Dynamically maintaining split graphs. Discret. Appl. Math. 157(9): 2057-2069 (2009) - [j23]Pinar Heggernes, Federico Mancini:
Minimal split completions. Discret. Appl. Math. 157(12): 2659-2669 (2009) - [j22]Pinar Heggernes, Daniel Meister, Charis Papadopoulos:
A new representation of proper interval graphs with an application to clique-width. Electron. Notes Discret. Math. 32: 27-34 (2009) - [j21]Pinar Heggernes, Dieter Kratsch, Daniel Meister:
Bandwidth of bipartite permutation graphs in polynomial time. J. Discrete Algorithms 7(4): 533-544 (2009) - [j20]Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle:
Interval Completion Is Fixed Parameter Tractable. SIAM J. Comput. 38(5): 2007-2020 (2009) - [j19]Pinar Heggernes, Charis Papadopoulos:
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions. Theor. Comput. Sci. 410(1): 1-15 (2009) - [c34]Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan:
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone. COCOON 2009: 398-407 - [c33]Pinar Heggernes, Rodica Mihai:
Edge Search Number of Cographs in Linear Time. FAW 2009: 16-26 - [c32]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh:
Bandwidth on AT-Free Graphs. ISAAC 2009: 573-582 - [c31]Tínaz Ekim, Pinar Heggernes, Daniel Meister:
Polar Permutation Graphs. IWOCA 2009: 218-229 - [c30]Petr A. Golovach, Pinar Heggernes:
Choosability of P5-Free Graphs. MFCS 2009: 382-391 - [c29]Pinar Heggernes, Daniel Meister, Charis Papadopoulos:
A Complete Characterisation of the Linear Clique-Width of Path Powers. TAMC 2009: 241-250 - 2008
- [j18]Pinar Heggernes, Federico Mancini, Charis Papadopoulos:
Minimal comparability completions of arbitrary graphs. Discret. Appl. Math. 156(5): 705-718 (2008) - [j17]Pinar Heggernes, Barry W. Peyton:
Fast Computation of Minimal Fill Inside A Given Elimination Ordering. SIAM J. Matrix Anal. Appl. 30(4): 1424-1444 (2008) - [j16]Anne Berry, Elias Dahlhaus, Pinar Heggernes, Geneviève Simonet:
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree. Theor. Comput. Sci. 409(3): 601-616 (2008) - [c28]Pinar Heggernes, Rodica Mihai:
Mixed Search Number of Permutation Graphs. FAW 2008: 196-207 - [c27]Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger:
Faster Parameterized Algorithms for Minimum Fill-In. ISAAC 2008: 282-293 - [c26]Pinar Heggernes, Dieter Kratsch, Daniel Meister:
Bandwidth of Bipartite Permutation Graphs in Polynomial Time. LATIN 2008: 216-227 - [c25]Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond:
Clustering with Partial Information. MFCS 2008: 144-155 - [c24]Pinar Heggernes, Daniel Meister, Andrzej Proskurowski:
Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs. SWAT 2008: 331-342 - [c23]Pinar Heggernes, Daniel Meister, Charis Papadopoulos:
Graphs of Linear Clique-Width at Most 3. TAMC 2008: 330-341 - [c22]Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos:
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. WG 2008: 218-229 - 2007
- [j15]Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch:
Exact Algorithms for Graph Homomorphisms. Theory Comput. Syst. 41(2): 381-393 (2007) - [j14]Pinar Heggernes, Dieter Kratsch:
Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nord. J. Comput. 14(1-2): 87-108 (2007) - [c21]Pinar Heggernes, Charis Papadopoulos:
Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions. COCOON 2007: 406-416 - [c20]Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger:
Characterizing Minimal Interval Completions. STACS 2007: 236-247 - [c19]Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger:
Interval completion with few edges. STOC 2007: 374-381 - [c18]Fedor V. Fomin, Pinar Heggernes, Rodica Mihai:
Mixed Search Number and Linear-Width of Interval and Split Graphs. WG 2007: 304-315 - 2006
- [j13]Pinar Heggernes:
Minimal triangulations of graphs: A survey. Discret. Math. 306(3): 297-317 (2006) - [j12]Anne Berry, Pinar Heggernes, Yngve Villanger:
A vertex incremental approach for maintaining chordality. Discret. Math. 306(3): 318-336 (2006) - [j11]Pinar Heggernes, Daniel Lokshtanov:
Optimal broadcast domination in polynomial time. Discret. Math. 306(24): 3267-3280 (2006) - [j10]Federico Mancini, Pinar Heggernes:
A completely dynamic algorithm for split graphs. Electron. Notes Discret. Math. 27: 69-70 (2006) - [j9]Anne Berry, Jean Paul Bordat, Pinar Heggernes, Geneviève Simonet, Yngve Villanger:
A wide-range algorithm for minimal triangulation from an arbitrary ordering. J. Algorithms 58(1): 33-66 (2006) - [c17]Pinar Heggernes, Federico Mancini, Charis Papadopoulos:
Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions. ISAAC 2006: 419-428 - [c16]Pinar Heggernes, Federico Mancini:
Minimal Split Completions of Graphs. LATIN 2006: 592-604 - [c15]Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov:
Optimal Linear Arrangement of Interval Graphs. MFCS 2006: 267-279 - 2005
- [j8]Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle:
Graph Searching, Elimination Trees, and a Generalization of Bandwidth. Algorithmica 41(2): 73-87 (2005) - [j7]Pinar Heggernes, Jan Arne Telle, Yngve Villanger:
Computing Minimal Triangulations in Time O(nalpha log n) = o(n 2.376). SIAM J. Discret. Math. 19(4): 900-913 (2005) - [c14]Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger:
Minimal Interval Completions. ESA 2005: 403-414 - [c13]Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch:
Exact Algorithms for Graph Homomorphisms. FCT 2005: 161-171 - [c12]Pinar Heggernes, Jan Arne Telle, Yngve Villanger:
Computing minimal triangulations in time O(nalpha log n) = o(n2.376). SODA 2005: 907-916 - [c11]Pinar Heggernes, Daniel Lokshtanov:
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time. WG 2005: 187-198 - 2004
- [j6]Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton:
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs. Algorithmica 39(4): 287-298 (2004) - [c10]Pinar Heggernes, Yngve Villanger:
Simple and Efficient Modifications of Elimination Orderings. PARA 2004: 788-797 - [c9]Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle:
Finding k Disjoint Triangles in an Arbitrary Graph. WG 2004: 235-244 - 2003
- [j5]Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle:
Generalized H-coloring and H-covering of Trees. Nord. J. Comput. 10(3): 206-223 (2003) - [c8]Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle:
Graph Searching, Elimination Trees, and a Generalization of Bandwidth. FCT 2003: 73-85 - [c7]Anne Berry, Pinar Heggernes, Yngve Villanger:
A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. ISAAC 2003: 47-57 - [c6]Anne Berry, Pinar Heggernes, Geneviève Simonet:
The Minimum Degree Heuristic and the Minimal Triangulation Process. WG 2003: 58-70 - 2002
- [c5]Pinar Heggernes, Yngve Villanger:
Efficient Implementation of a Minimal Triangulation Algorithm. ESA 2002: 550-561 - [c4]Anne Berry, Jean R. S. Blair, Pinar Heggernes:
Maximum Cardinality Search for Computing Minimal Triangulations. WG 2002: 1-12 - [c3]Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle:
Generalized H-Coloring and H-Covering of Trees. WG 2002: 198-210 - 2001
- [j4]Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle:
A practical algorithm for making filled graphs minimal. Theor. Comput. Sci. 250(1-2): 125-141 (2001) - 2000
- [j3]Anne Berry, Jean Paul Bordat, Pinar Heggernes:
Recognizing Weakly Triangulated Graphs by Edge Separability. Nord. J. Comput. 7(3): 164-177 (2000) - [j2]Åke Björck, Pinar Heggernes, P. Matstoms:
Methods for Large Scale Total Least Squares Problems. SIAM J. Matrix Anal. Appl. 22(2): 413-429 (2000) - [c2]Anne Berry, Jean Paul Bordat, Pinar Heggernes:
Recognizing Weakly Triangulated Graphs by Edge Separability. SWAT 2000: 139-149
1990 – 1999
- 1998
- [j1]Pinar Heggernes, Jan Arne Telle:
Partitioning Graphs into Generalized Dominating Sets. Nord. J. Comput. 5(2): 128-142 (1998) - 1996
- [c1]Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle:
Making an Arbitrary Filled Graph Minimal by Removing Fill Edges. SWAT 1996: 173-184
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
