Current Research Information SysTem In Norway
 
 

 English version


 
Hovedside
Forskningsresultater/NVI
Forskere
Prosjekter
Forskningsenheter
Logg inn
Om Cristin
 
 
   
Eksporter til


Viser treff 1-50 av 196 << Forrige 1 2 3 4    Neste >>

2020
1 Golovach, Petr; Heggernes, Pinar; Konstantinidis, Athanasios; Lima, Paloma T.; Papadopoulos, Charis.
Parameterized Aspects of Strong Subgraph Closure. Algorithmica 2020
UiB Untitled
 
2019
2 Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter; Lima, Paloma T.; Paulusma, Daniel.
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Algorithmica 2019 ;Volum 81.(7) s. 2795-2828
UiB Untitled
 
3 Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter; Saei, Reza.
Enumeration of Minimal Connected Dominating Sets for Chordal Graphs. Discrete Applied Mathematics 2019
NORD UiB Untitled
 
4 Heggernes, Pinar.
Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019, Proceedings. Springer 2019 (ISBN 978-3-030-17401-9) 376 s. Lecture Notes in Computer Science (LNCS)(11485)
UiB Untitled
 
5 Heggernes, Pinar; Olsen, Kai.
Dette er Darwin’s «survival of the fittest». Dagens næringsliv 2019
UiB Untitled
 
6 Lima, Paloma T..
Structural and Algorithmic Graph Theory Through the Lenses of Graph Classes. : Universitetet i Bergen 2019 (ISBN 9788230843963)
UiB Untitled
 
7 Rossmanith, Peter; Heggernes, Pinar; Katoen, Joost-Pieter.
44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany. : Leibniz-Zentrum für Informatik 2019 (ISBN 978-3-95977-117-7) 1182 s. Leibniz International Proceedings in Informatics(138)
UiB Untitled
 
2018
8 Golovach, Petr; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve Hortemo; Villanger, Yngve.
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Algorithmica 2018 ;Volum 80.(2) s. 714-741
UiB Untitled
 
9 Golovach, Petr; Heggernes, Pinar; Konstantinidis, Athanasios; T. Lima, Paloma; Papadopoulos, Charis.
Parameterized Aspects of Strong Subgraph Closure. Leibniz International Proceedings in Informatics 2018 ;Volum 101. s. 23:1-23:13
UiB Untitled
 
10 Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter.
Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. European journal of combinatorics (Print) 2018 ;Volum 68. s. 132-147
UiB Untitled
 
11 Golovach, Petr; Heggernes, Pinar; Thomé de Lima, Paloma; Montealegre, Pedro.
Finding connected secluded subgraphs. Leibniz International Proceedings in Informatics 2018 ;Volum 89. s. 1-13
UiB Untitled
 
12 Heggernes, Pinar; Issac, Davis; Lauri, Juho; T. Lima, Paloma; van Leeuwen, Erik Jan.
Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. Leibniz International Proceedings in Informatics 2018 ;Volum 117. s. 83:1-83:13
UiB Untitled
 
2017
13 Brešar, Boštjan; Heggernes, Pinar; Kamiński, Marcin; Milanič, Martin; Paulusma, Daniël; Potočnik, Primož; Trotignon, Nicolas.
Preface: Algorithmic Graph Theory on the Adriatic Coast. Discrete Applied Mathematics 2017 ;Volum 231. s. 1-3
UiB Untitled
 
14 Dibek, Cemil; Ekim, Tınaz; Heggernes, Pinar.
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded. Discrete Mathematics 2017 ;Volum 340.(5) s. 927-934
UiB Untitled
 
15 Golovach, Petr; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve Hortemo; Villanger, Yngve.
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Algorithmica 2017 ;Volum 80.(2) s. 714-741
UiB Untitled
 
16 Golovach, Petr; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Villanger, Yngve.
Minimal dominating sets in interval graphs and trees. Discrete Applied Mathematics 2017 ;Volum 216. s. 162-170
UiB Untitled
 
17 Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter; Lima, Paloma; Paulusma, Daniël.
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. Lecture Notes in Computer Science (LNCS) 2017 ;Volum 10520 LNCS. s. 275-288
UiB Untitled
 
18 Golovach, Petr; Heggernes, Pinar; Lindzey, Nathan; McConnell, Ross M.; dos Santos, Vínicius Fernandes; Spinrad, Jeremy P.; Szwarcfiter, Jayme Luiz.
On recognition of threshold tolerance graphs and their complements. Discrete Applied Mathematics 2017 ;Volum 216. s. 171-180
UiB Untitled
 
19 Seker, Oylum; Heggernes, Pinar; Ekim, Tinaz; Taskin, Z Caner.
Linear-time generation of random chordal graphs. Lecture Notes in Computer Science (LNCS) 2017 ;Volum 10236 LNCS. s. 442-453
UiB Untitled
 
2016
20 Abu-Khzam, Faisal N.; Heggernes, Pinar.
Enumerating minimal dominating sets in chordal graphs. Information Processing Letters 2016 ;Volum 116.(12) s. 739-743
UiB Untitled
 
21 Basavaraju, Manu; Heggernes, Pinar; van 't Hof, Pim; Saei, Reza; Villanger, Yngve.
Maximal induced matchings in triangle-free graphs. Journal of Graph Theory 2016 ;Volum 83.(3) s. 231-250
UiB Untitled
 
22 Cygan, Marek; Heggernes, Pinar.
Erratum to: Foreword: Special Issue on IPEC 2014 (Algorithmica, DOI 10.1007/s00453-016-0151-x). Algorithmica 2016 ;Volum 75.(2) s. 257-257
UiB Untitled
 
23 Cygan, Marek; Heggernes, Pinar.
Foreword: Special Issue on IPEC 2014. Algorithmica 2016 ;Volum 75.(2) s. 255-256
UiB Untitled
 
24 Cygan, Marek; Heggernes, Pinar.
Special Issue on IPEC 2014. Springer 2016 ;Volum 75.180 s. Algorithmica(2)
UiB Untitled
 
25 Fomin, Fedor; Heggernes, Pinar; van Leeuwen, Erik Jan.
The Firefighter problem on graph classes. Theoretical Computer Science 2016 ;Volum 613. s. 38-50
UiB Untitled
 
26 Golovach, Petr; Heggernes, Pinar; Kanté, Mamadou M.; Kratsch, Dieter; Villanger, Yngve.
Enumerating minimal dominating sets in chordal bipartite graphs. Discrete Applied Mathematics 2016 ;Volum 199. s. 30-36
UiB Untitled
 
27 Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter.
Enumerating minimal connected dominating sets in graphs of bounded chordality. Theoretical Computer Science 2016 ;Volum 630. s. 63-75
UiB Untitled
 
28 Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter.
Enumeration and maximum number of minimal connected vertex covers in graphs. Lecture Notes in Computer Science (LNCS) 2016 ;Volum 9538. s. 235-247
UiB Untitled
 
29 Heggernes, Pinar.
Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers. Springer 2016 (ISBN 978-3-662-53535-6) 310 s. Lecture Notes in Computer Science(9941)
UiB Untitled
 
30 Heggernes, Pinar.
Preface. Lecture Notes in Computer Science (LNCS) 2016 ;Volum 9941 LNCS. s. V-V
UiB Untitled
 
31 Heggernes, Pinar; Meister, Daniel; Papadopoulos, Charis; Rotics, Udi.
Clique-width of path powers. Discrete Applied Mathematics 2016 ;Volum 205. s. 62-72
UiB Untitled
 
32 Heggernes, Pinar; Proskurowski, Andrzej; Thilikos, Dimitrios M..
Foreword: Sixth Workshop on Graph Classes, Optimization, and Width Parameters, Santorini, Greece, October 2013. Discrete Applied Mathematics 2016 ;Volum 199. s. 1-2
UiB Untitled
 
33 Heggernes, Pinar; Proskurowski, Andrzej; Thilikos, Dimitrios M..
Sixth Workshop on Graph Classes, Optimization, and Width Parameters, Santorini, Greece, October 2013. Elsevier 2016 ;Volum 199.230 s. Discrete Applied Mathematics(1-2)
UiB Untitled
 
2015
34 Bodlaender, Hans; Heggernes, Pinar; Telle, Jan Arne.
Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality. Electronic Notes in Discrete Mathematics 2015
UiB Untitled
 
35 Courcelle, Bruno; Heggernes, Pinar; Meister, Daniel; Papadopoulos, Charis; Rotics, Udi.
A characterisation of clique-width through nested partitions. Discrete Applied Mathematics 2015 ;Volum 187. s. 70-81
UiB Untitled
 
36 Fernau, Henning; Heggernes, Pinar; van 't Hof, Pim; Meister, Daniel; Saei, Reza.
Computing the metric dimension for chain graphs. Information Processing Letters 2015 ;Volum 115.(9) s. 671-676
UiB Untitled
 
37 Fernau, Henning; Heggernes, Pinar; Villanger, Yngve.
A Multi-Parameter Analysis of Hard Problems on Deterministic Finite Automata. Journal of computer and system sciences (Print) 2015 ;Volum 81. s. 747-765
UiB Untitled
 
38 Golovach, Petr; Heggernes, Pinar; Kante, Mamadou; Kratsch, Dieter; Sæther, Sigve Hortemo; Villanger, Yngve.
Output-polynomial enumeration on graphs of bounded (local) linear mim-width. Lecture Notes in Computer Science (LNCS) 2015 ;Volum 9472. s. 248-258
UiB Untitled
 
39 Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter.
Enumerating minimal connected dominating sets in graphs of bounded chordality. Leibniz International Proceedings in Informatics 2015 ;Volum 43. s. 307-318
UiB Untitled
 
40 Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter; Villanger, Yngve.
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets. Algorithmica 2015 ;Volum 72. s. 836-859
UiB Untitled
 
41 Golovach, Petr; Heggernes, Pinar; van 't Hof, Pim; Manne, Fredrik; Paulusma, Daniël; Pilipczuk, Michal Pawel.
Modifying a graph using vertex elimination. Algorithmica 2015 ;Volum 72.(1) s. 99-125
UiB Untitled
 
42 Golovach, Petr; Heggernes, Pinar; van' t Hof, Pim; Paul, Christophe.
Hadwiger number of graphs with small chordality. Lecture Notes in Computer Science (LNCS) 2015 ;Volum 8747. s. 201-213
UiB Untitled
 
43 Golovach, Petr; Heggernes, Pinar; van 't Hof, Pim; Paul, Christophe.
Hadwiger number of graphs with small chordality. SIAM Journal on Discrete Mathematics 2015 ;Volum 29.(3) s. 1427-1451
UiB Untitled
 
44 Heggernes, Pinar; van 't Hof, Pim; Marx, Dániel; Misra, Neeldhara; Villanger, Yngve.
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. Algorithmica 2015 ;Volum 72.(3) s. 687-713
UiB Untitled
 
45 Heggernes, Pinar; van 't Hof, Pim; Meister, Daniel; Villanger, Yngve.
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs. Theoretical Computer Science 2015 ;Volum 562.(C) s. 252-269
UiB Untitled
 
46 Heggernes, Pinar; van 't Hof, Pim; van Leeuwen, Erik Jan; Saei, Reza.
Finding Disjoint Paths in Split Graphs. Theory of Computing Systems 2015 ;Volum 57.(1) s. 140-159
UiB Untitled
 
47 SaeiDinvar, Reza.
Algorithmic and combinatorial problems on graph classes. : Universitetet i Bergen 2015 (ISBN 978-82-308-2625-6) 200 s.
UiB Untitled
 
2014
48 Basavaraju, Manu; Heggernes, Pinar; van 't Hof, Pim; Saei, Reza; Villanger, Yngve.
Maximal induced matchings in triangle-free graphs. Lecture Notes in Computer Science (LNCS) 2014 ;Volum 8747. s. 93-104
UiB Untitled
 
49 Belmonte, Rémy; Golovach, Petr; Heggernes, Pinar; van 't Hof, Pim; Kaminski, Marcin; Paulusma, Daniël.
Detecting fixed patterns in chordal graphs in polynomial time. Algorithmica 2014 ;Volum 69.(3) s. 501-521
UiB Untitled
 
50 Belmonte, Rémy; Heggernes, Pinar; van 't Hof, Pim; Rafiey, Arash; SaeiDinvar, Reza.
Graph classes and Ramsey numbers. Discrete Applied Mathematics 2014 ;Volum 173. s. 16-27
UiB Untitled
 
    Vis neste liste