default search action
Martin Vatshelle
Person information
- affiliation: University of Bergen, Norway
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c15]Emmanuel Arrighi, Pål Grønås Drange, Kenneth Langedal
, Farhad Vadiee, Martin Vatshelle, Petra Wolf:
PACE Solver Description: Zygosity. IPEC 2023: 39:1-39:3 - 2022
- [c14]Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle:
Recognition of Linear and Star Variants of Leaf Powers is in P. WG 2022: 70-83 - 2021
- [i7]Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle:
On Alternative Models for Leaf Powers. CoRR abs/2105.12407 (2021)
2010 – 2019
- 2018
- [i6]Johan M. M. van Rooij, Hans L. Bodlaender, Erik Jan van Leeuwen, Peter Rossmanith, Martin Vatshelle:
Fast Dynamic Programming on Graph Decompositions. CoRR abs/1806.01667 (2018) - 2017
- [j13]J. Mark Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle:
An algorithm for the maximum weight independent set problem on outerstring graphs. Comput. Geom. 60: 19-25 (2017) - 2016
- [j12]Sigve Hortemo Sæther, Martin Vatshelle:
Hardness of computing width parameters based on branch decompositions over the vertex set. Theor. Comput. Sci. 615: 120-125 (2016) - 2015
- [j11]Chính T. Hoàng, Brian Moore, Daniel Recoskie, Joe Sawada, Martin Vatshelle:
Constructions of k-critical P5-free graphs. Discret. Appl. Math. 182: 91-98 (2015) - [j10]Sigve Hortemo Sæther, Martin Vatshelle:
Hardness of computing width parameters based on branch decompositions over the vertex set. Electron. Notes Discret. Math. 49: 301-308 (2015) - [j9]Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle:
Solving #SAT and MAXSAT by Dynamic Programming. J. Artif. Intell. Res. 54: 59-82 (2015) - [c13]J. Mark Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle:
An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs. CCCG 2015 - 2014
- [j8]Sang-il Oum
Faster algorithms for vertex partitioning problems parameterized by clique-width. Theor. Comput. Sci. 535: 16-24 (2014) - [c12]Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle:
Solving MaxSAT and #SAT on Structured CNF Formulas. SAT 2014: 16-31 - [c11]Daniel Lokshtanov, Martin Vatshelle, Yngve Villanger:
Independent Set in P5-Free Graphs in Polynomial Time. SODA 2014: 570-581 - [i5]Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle:
Solving MaxSAT and #SAT on structured CNF formulas. CoRR abs/1402.6485 (2014) - 2013
- [j7]Binh-Minh Bui-Xuan, Ondrej Suchý
Feedback vertex set on graphs of low clique-width. Eur. J. Comb. 34(3): 666-679 (2013) - [j6]Therese Biedl, Martin Vatshelle:
The Point-Set Embeddability Problem for Plane graphs. Int. J. Comput. Geom. Appl. 23(4-5): 357-396 (2013) - [j5]Rémy Belmonte, Martin Vatshelle:
Graph classes with structured neighborhoods and algorithmic applications. Theor. Comput. Sci. 511: 54-65 (2013) - [j4]Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theor. Comput. Sci. 511: 66-76 (2013) - [c10]Yuri Rabinovich, Jan Arne Telle, Martin Vatshelle:
Upper Bounds on Boolean-Width with Applications to Exact Algorithms. IPEC 2013: 308-320 - [i4]Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle:
Faster Algorithms Parameterized by Clique-width. CoRR abs/1311.0224 (2013) - 2012
- [c9]Therese Biedl, Martin Vatshelle:
The point-set embeddability problem for plane graphs. SCG 2012: 41-50 - [c8]Fedor V. Fomin
k-Gap Interval Graphs. LATIN 2012: 350-361 - 2011
- [j3]Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
Boolean-width of graphs. Theor. Comput. Sci. 412(39): 5187-5204 (2011) - [c7]Eivind Magnus Hvidevold, Sadia Sharmin, Jan Arne Telle, Martin Vatshelle:
Finding Good Decompositions for Dynamic Programming on Dense Graphs. IPEC 2011: 219-231 - [c6]Rémy Belmonte, Martin Vatshelle:
Graph Classes with Structured Neighborhoods and Algorithmic Applications. WG 2011: 47-58 - [i3]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) - 2010
- [j2]Daniel Meister, Jan Arne Telle, Martin Vatshelle:
Recognizing digraphs of Kelly-width 2. Discret. Appl. Math. 158(7): 741-746 (2010) - [j1]Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discret. Appl. Math. 158(7): 809-819 (2010) - [c5]Hans L. Bodlaender
Faster Algorithms on Branch and Clique Decompositions. MFCS 2010: 174-185 - [c4]Isolde Adler, Binh-Minh Bui-Xuan, Yuri Rabinovich, Gabriel Renault, Jan Arne Telle, Martin Vatshelle:
On the Boolean-Width of a Graph: Structure and Applications. WG 2010: 159-170 - [i2]Rémy Belmonte, Martin Vatshelle:
On graph classes with logarithmic boolean-width. CoRR abs/1009.0216 (2010)
2000 – 2009
- 2009
- [c3]Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
Feedback Vertex Set on Graphs of Low Cliquewidth. IWOCA 2009: 113-124 - [c2]Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
Boolean-Width of Graphs. IWPEC 2009: 61-74 - [i1]Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions. CoRR abs/0903.4796 (2009) - 2007
- [c1]Daniel Meister, Jan Arne Telle, Martin Vatshelle:
Characterization and Recognition of Digraphs of Bounded Kelly-width. WG 2007: 270-279
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 20:21 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: