default search action
Yngve Villanger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2019
- [j34]Jan Arne Telle, Yngve Villanger:
FPT algorithms for domination in sparse graphs and beyond. Theor. Comput. Sci. 770: 62-68 (2019) - 2018
- [j33]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) - 2017
- [j32]Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
Treewidth and Pathwidth parameterized by the vertex cover number. Discret. Appl. Math. 216: 114-129 (2017) - [j31]Petr A. Golovach
Minimal dominating sets in interval graphs and trees. Discret. Appl. Math. 216: 162-170 (2017) - 2016
- [j30]Ivan Bliznets
Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n. Algorithmica 76(2): 569-594 (2016) - [j29]Petr A. Golovach
Enumerating minimal dominating sets in chordal bipartite graphs. Discret. Appl. Math. 199: 30-36 (2016) - [j28]Manu Basavaraju, Pinar Heggernes, Pim van 't Hof
Maximal Induced Matchings in Triangle-Free Graphs. J. Graph Theory 83(3): 231-250 (2016) - [j27]Henning Fernau
On the Parameterised Complexity of String Morphism Problems. Theory Comput. Syst. 59(1): 24-51 (2016) - [r2]Yngve Villanger:
Fast Minimal Triangulation. Encyclopedia of Algorithms 2016: 731-735 - 2015
- [j26]Fedor V. Fomin
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. Algorithmica 71(1): 1-20 (2015) - [j25]Pinar Heggernes
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. Algorithmica 72(3): 687-713 (2015) - [j24]Petr A. Golovach
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. Algorithmica 72(3): 836-859 (2015) - [j23]Henning Fernau
A multi-parameter analysis of hard problems on deterministic finite automata. J. Comput. Syst. Sci. 81(4): 747-765 (2015) - [j22]Fedor V. Fomin
Large Induced Subgraphs via Triangulations and CMSO. SIAM J. Comput. 44(1): 54-87 (2015) - [j21]Pinar Heggernes, Pim van 't Hof
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs. Theor. Comput. Sci. 562: 252-269 (2015) - [j20]Pål Grønås Drange, Fedor V. Fomin
Exploring the Subexponential Complexity of Completion Problems. ACM Trans. Comput. Theory 7(4): 14:1-14:38 (2015) - [c45]Petr A. Golovach
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. ISAAC 2015: 248-258 - [i16]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
- [j19]Fedor V. Fomin
Enumerating Minimal Subset Feedback Vertex Sets. Algorithmica 69(1): 216-231 (2014) - [j18]Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
Solving Capacitated Dominating Set by using covering by subsets and maximum matching. Discret. Appl. Math. 168: 60-68 (2014) - [j17]Fedor V. Fomin
Searching for better fill-in. J. Comput. Syst. Sci. 80(7): 1374-1383 (2014) - [j16]Fedor V. Fomin
Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters. J. Comput. Syst. Sci. 80(7): 1430-1447 (2014) - [c44]Daniel Lokshtanov, Martin Vatshelle, Yngve Villanger:
Independent Set in P5-Free Graphs in Polynomial Time. SODA 2014: 570-581 - [c43]Fedor V. Fomin, Ioan Todinca
Large induced subgraphs via triangulations and CMSO. SODA 2014: 582-583 - [c42]Pål Grønås Drange
Exploring Subexponential Parameterized Complexity of Completion Problems. STACS 2014: 288-299 - [c41]Manu Basavaraju, Pinar Heggernes, Pim van 't Hof
Maximal Induced Matchings in Triangle-Free Graphs. WG 2014: 93-104 - 2013
- [j15]Pim van 't Hof
Proper Interval Vertex Deletion. Algorithmica 65(4): 845-867 (2013) - [j14]Fedor V. Fomin
Subexponential Parameterized Algorithm for Minimum Fill-In. SIAM J. Comput. 42(6): 2197-2216 (2013) - [j13]Fedor V. Fomin
A Polynomial Kernel for Proper Interval Vertex Deletion. SIAM J. Discret. Math. 27(4): 1964-1976 (2013) - [j12]Pinar Heggernes
Parameterized complexity of vertex deletion into perfect graph classes. Theor. Comput. Sci. 511: 172-180 (2013) - [c40]Ivan Bliznets
Largest Chordal and Interval Subgraphs Faster Than 2 n. ESA 2013: 193-204 - [c39]Henning Fernau
On the Parameterised Complexity of String Morphism Problems. FSTTCS 2013: 55-66 - [c38]Petr A. Golovach
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. ICALP (1) 2013: 485-496 - [c37]Henning Fernau
A Multivariate Analysis of Some DFA Problems. LATA 2013: 275-286 - [c36]Fedor V. Fomin
Searching for better fill-in. STACS 2013: 8-19 - [c35]Fedor V. Fomin
Tight bounds for Parameterized Complexity of Cluster Editing. STACS 2013: 32-43 - [c34]Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
Treewidth and Pathwidth Parameterized by the Vertex Cover Number. WADS 2013: 232-243 - [c33]Jan Arne Telle, Yngve Villanger:
Connecting Terminals and 2-Disjoint Connected Subgraphs. WG 2013: 418-428 - [i15]Jan Arne Telle, Yngve Villanger:
Connecting Terminals and 2-Disjoint Connected Subgraphs. CoRR abs/1301.2506 (2013) - [i14]Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
TREEWIDTH and PATHWIDTH parameterized by vertex cover. CoRR abs/1305.0433 (2013) - [i13]Fedor V. Fomin, Ioan Todinca
Large induced subgraphs via triangulations and CMSO. CoRR abs/1309.1559 (2013) - [i12]Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger:
Exploring Subexponential Parameterized Complexity of Completion Problems. CoRR abs/1309.4022 (2013) - [i11]Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger:
Largest chordal and interval subgraphs faster than 2^n. CoRR abs/1311.4055 (2013) - [i10]Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei
Maximal induced matchings in triangle-free graphs. CoRR abs/1312.5180 (2013) - 2012
- [j11]Fedor V. Fomin
Treewidth computation and extremal combinatorics. Comb. 32(3): 289-308 (2012) - [j10]Michael R. Fellows
Local search: Is brute-force avoidable? J. Comput. Syst. Sci. 78(3): 707-719 (2012) - [j9]Daniel Binkele-Raible, Henning Fernau
Kernel(s) for problems with no kernel: On out-trees with many leaves. ACM Trans. Algorithms 8(4): 38:1-38:19 (2012) - [c32]Jean-François Couturier, Pinar Heggernes
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs. COCOON 2012: 133-144 - [c31]Fedor V. Fomin
A Polynomial Kernel for Proper Interval Vertex Deletion. ESA 2012: 467-478 - [c30]Jan Arne Telle, Yngve Villanger:
FPT Algorithms for Domination in Biclique-Free Graphs. ESA 2012: 802-812 - [c29]Fedor V. Fomin
k-Gap Interval Graphs. LATIN 2012: 350-361 - [c28]Fedor V. Fomin, Yngve Villanger:
Subexponential parameterized algorithm for minimum fill-in. SODA 2012: 1737-1746 - [c27]Pinar Heggernes
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. WG 2012: 332-343 - [i9]Fedor V. Fomin, Saket Saurabh, Yngve Villanger:
A Polynomial kernel for Proper Interval Vertex Deletion. CoRR abs/1204.4880 (2012) - [i8]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
- [j8]Hans L. Bodlaender
Faster Parameterized Algorithms for Minimum Fill-in. Algorithmica 61(4): 817-838 (2011) - [c26]Fedor V. Fomin
Exact Algorithm for the Maximum Induced Planar Subgraph Problem. ESA 2011: 287-298 - [c25]Pinar Heggernes
Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. FCT 2011: 240-251 - [c24]Fedor V. Fomin
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. FSTTCS 2011: 164-175 - [c23]Fedor V. Fomin
Enumerating Minimal Subset Feedback Vertex Sets. WADS 2011: 399-410 - [i7]Fedor V. Fomin, Yngve Villanger:
Subexponential Parameterized Algorithm for Minimum Fill-in. CoRR abs/1104.2230 (2011) - [i6]Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger:
k-Gap Interval Graphs. CoRR abs/1112.3244 (2011) - [i5]Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger:
Subexponential fixed-parameter tractability of cluster editing. CoRR abs/1112.4419 (2011) - 2010
- [c22]Pinar Heggernes
A Parameterized Algorithm for Chordal Sandwich. CIAC 2010: 120-130 - [c21]Pinar Heggernes
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs. ISAAC (2) 2010: 399-409 - [c20]Yngve Villanger:
Proper Interval Vertex Deletion. IPEC 2010: 228-238 - [c19]Fedor V. Fomin
Finding Induced Subgraphs via Minimal Triangulations. STACS 2010: 383-394 - [c18]Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. WG 2010: 88-99 - [c17]Geevarghese Philip, Venkatesh Raman, Yngve Villanger:
A Quartic Kernel for Pathwidth-One Vertex Deletion. WG 2010: 196-207 - [i4]Geevarghese Philip, Venkatesh Raman, Yngve Villanger:
A Quartic Kernel for Pathwidth-One Vertex Deletion. CoRR abs/1009.0806 (2010)
2000 – 2009
- 2009
- [j7]Yngve Villanger, Pinar Heggernes
Interval Completion Is Fixed Parameter Tractable. SIAM J. Comput. 38(5): 2007-2020 (2009) - [c16]Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger:
Local Search: Is Brute-Force Avoidable? IJCAI 2009: 486-491 - [c15]Karol Suchan
Computing Pathwidth Faster Than 2n. IWPEC 2009: 324-335 - [c14]Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger:
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. STACS 2009: 421-432 - [i3]Fedor V. Fomin, Yngve Villanger:
Finding Induced Subgraphs via Minimal Triangulations. CoRR abs/0909.5278 (2009) - 2008
- [j6]Jianer Chen, Fedor V. Fomin
Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. 74(7): 1188-1198 (2008) - [j5]Fedor V. Fomin
Exact Algorithms for Treewidth and Minimum Fill-In. SIAM J. Comput. 38(3): 1058-1079 (2008) - [c13]Fedor V. Fomin
Treewidth Computation and Extremal Combinatorics. ICALP (1) 2008: 210-221 - [c12]Hans L. Bodlaender
Faster Parameterized Algorithms for Minimum Fill-In. ISAAC 2008: 282-293 - [c11]Michael Dom, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger:
Capacitated Domination and Covering: A Parameterized Perspective. IWPEC 2008: 78-90 - [c10]Petr A. Golovach
Parameterized Complexity for Domination Problems on Degenerate Graphs. WG 2008: 195-205 - [r1]Yngve Villanger:
Fast Minimal Triangulation. Encyclopedia of Algorithms 2008 - [i2]Fedor V. Fomin, Yngve Villanger:
Treewidth computation and extremal combinatorics. CoRR abs/0803.1321 (2008) - [i1]Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger:
Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves. CoRR abs/0810.4796 (2008) - 2007
- [c9]Pinar Heggernes, Karol Suchan, Ioan Todinca
Characterizing Minimal Interval Completions. STACS 2007: 236-247 - [c8]Pinar Heggernes
Interval completion with few edges. STOC 2007: 374-381 - [c7]Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger:
Improved Algorithms for the Feedback Vertex Set Problems. WADS 2007: 422-433 - 2006
- [j4]Anne Berry, Pinar Heggernes
A vertex incremental approach for maintaining chordality. Discret. Math. 306(3): 318-336 (2006) - [j3]Yngve Villanger:
Lex M versus MCS-M. Discret. Math. 306(3): 393-400 (2006) - [j2]Anne Berry, Jean Paul Bordat, Pinar Heggernes
A wide-range algorithm for minimal triangulation from an arbitrary ordering. J. Algorithms 58(1): 33-66 (2006) - [c6]Yngve Villanger:
Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In. LATIN 2006: 800-811 - 2005
- [j1]Pinar Heggernes
Computing Minimal Triangulations in Time O(nalpha log n) = o(n 2.376). SIAM J. Discret. Math. 19(4): 900-913 (2005) - [c5]Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger:
Minimal Interval Completions. ESA 2005: 403-414 - [c4]Pinar Heggernes, Jan Arne Telle, Yngve Villanger:
Computing minimal triangulations in time O(nalpha log n) = o(n2.376). SODA 2005: 907-916 - 2004
- [c3]Pinar Heggernes
Simple and Efficient Modifications of Elimination Orderings. PARA 2004: 788-797 - 2003
- [c2]Anne Berry, Pinar Heggernes, Yngve Villanger:
A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. ISAAC 2003: 47-57 - 2002
- [c1]Pinar Heggernes
Efficient Implementation of a Minimal Triangulation Algorithm. ESA 2002: 550-561
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-08-05 21:22 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: