Остановите войну!
for scientists:
default search action
Stefan Arnborg
- > Home > Persons > Stefan Arnborg
Publications
- 2020
- [c16]Stefan Arnborg, Andrzej Proskurowski:
Seeing Arboretum for the (partial k-) Trees. Treewidth, Kernels, and Algorithms 2020: 3-6 - 1998
- [e1]Stefan Arnborg, Lars Ivansson:
Algorithm Theory - SWAT '98, 6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings. Lecture Notes in Computer Science 1432, Springer 1998, ISBN 3-540-64682-5 [contents] - 1994
- [c11]Stefan Arnborg, Andrzej Proskurowski:
A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths. TAGT 1994: 469-486 - 1993
- [j12]Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese:
An Algebraic Theory of Graph Reduction. J. ACM 40(5): 1134-1164 (1993) - 1992
- [j10]Stefan Arnborg, Andrzej Proskurowski:
Canonical Representations of Partial 2- and 3-Trees. BIT 32(2): 197-214 (1992) - 1991
- [j9]Stefan Arnborg, Jens Lagergren, Detlef Seese:
Easy Problems for Tree-Decomposable Graphs. J. Algorithms 12(2): 308-340 (1991) - [c9]Jens Lagergren, Stefan Arnborg:
Finding Minimal Forbidden Minors Using a Finite Congruence. ICALP 1991: 532-543 - 1990
- [j8]Stefan Arnborg, Andrzej Proskurowski, Derek G. Corneil:
Forbidden minors characterization of partial 3-trees. Discret. Math. 80(1): 1-19 (1990) - [c8]Stefan Arnborg, Andrzej Proskurowski, Detlef Seese:
Monadic Second Order Logic, Tree Automata and Forbidden Minors. CSL 1990: 1-16 - [c7]Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese:
An Algebraic Theory of Graph Reduction. Graph-Grammars and Their Application to Computer Science 1990: 70-83 - [c6]Stefan Arnborg, Andrzej Proskurowski:
Canonical Representation of Partial 2- and 3-Trees. SWAT 1990: 310-319 - 1989
- [j7]Stefan Arnborg, Andrzej Proskurowski:
Linear time algorithms for NP-hard problems restricted to partial k-trees. Discret. Appl. Math. 23(1): 11-24 (1989) - 1988
- [c4]Stefan Arnborg, Jens Lagergren, Detlef Seese:
Problems Easy for Tree-Decomposable Graphs (Extended Abstract). ICALP 1988: 38-51 - 1985
- [j3]Stefan Arnborg, Andrzej Proskurowski:
Problems on graphs with bounded decomposability. Bull. EATCS 25: 7-10 (1985)
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-04-21 17:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint