default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIsolde Adler
Person information
- affiliation: University of Bamberg, Germany
- affiliation (former): Goethe University Frankfurt am Main, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Isolde Adler, Noleen Köhler
, Pan Peng:
On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing. SIAM J. Comput. 53(4): 825-883 (2024)- [c16]Isolde Adler, Eva Fluck:
Monotonicity of the Cops and Robber Game for Bounded Depth Treewidth. MFCS 2024: 6:1-6:18 - [i18]Isolde Adler, Eva Fluck:
Monotonicity of the cops and robber game for bounded depth treewidth. CoRR abs/2402.09139 (2024) - 2023
- [j21]Isolde Adler, Polly Fahey:
Faster Property Testers in a Variation of the Bounded Degree Model. ACM Trans. Comput. Log. 24(3): 25:1-25:24 (2023) - [i17]Isolde Adler, Noleen Köhler, Pan Peng:
On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing. CoRR abs/2304.03810 (2023) - 2022
- [j20]Isolde Adler, Bjarki Geir Benediktsson, Dugald Macpherson:
Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs. Discret. Appl. Math. 312: 29-44 (2022) - [j19]Isolde Adler, Noleen Köhler:
An explicit construction of graphs of bounded degree that are far from being Hamiltonian. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - 2021
- [j18]Pierre Aboulker, Isolde Adler, Eun Jung Kim, Ni Luh Dewi Sintiari, Nicolas Trotignon:
On the tree-width of even-hole-free graphs. Eur. J. Comb. 98: 103394 (2021) - [j17]Isolde Adler, Christophe Paul, Dimitrios M. Thilikos:
Connected search for a lazy robber. J. Graph Theory 97(4): 510-552 (2021) - [c15]Isolde Adler, Noleen Köhler, Pan Peng:
GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing. CCC 2021: 34:1-34:27 - [c14]Isolde Adler, Noleen Köhler, Pan Peng:
On Testability of First-Order Properties in Bounded-Degree Graphs. SODA 2021: 1578-1597 - [i16]Isolde Adler, Polly Fahey:
Towards Approximate Query Enumeration with Sublinear Preprocessing Time. CoRR abs/2101.06240 (2021) - [i15]Isolde Adler, Noleen Köhler, Pan Peng:
GSF-locality is not sufficient for proximity-oblivious testing. CoRR abs/2105.08490 (2021) - 2020
- [c13]Isolde Adler, Polly Fahey:
Faster Property Testers in a Variation of the Bounded Degree Model. FSTTCS 2020: 7:1-7:15 - [e1]Isolde Adler, Haiko Müller:
Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12301, Springer 2020, ISBN 978-3-030-60439-4 [contents] - [i14]Pierre Aboulker, Isolde Adler, Eun Jung Kim, Ni Luh Dewi Sintiari, Nicolas Trotignon:
On the tree-width of even-hole-free graphs. CoRR abs/2008.05504 (2020) - [i13]Isolde Adler, Noleen Köhler, Pan Peng:
On Testability of First-Order Properties in Bounded-Degree Graphs. CoRR abs/2008.05800 (2020) - [i12]Isolde Adler, Noleen Köhler:
On graphs of bounded degree that are far from being Hamiltonian. CoRR abs/2008.05801 (2020) - [i11]Isolde Adler, Polly Fahey:
Faster Property Testers in a Variation of the Bounded Degree Model. CoRR abs/2009.07770 (2020)
2010 – 2019
- 2019
- [j16]Isolde Adler, Philipp Klaus Krause:
A lower bound on the tree-width of graphs with irrelevant vertices. J. Comb. Theory B 137: 126-136 (2019) - [c12]Isolde Adler, Christophe Paul, Dimitrios M. Thilikos:
Connected Search for a Lazy Robber. FSTTCS 2019: 7:1-7:14 - [i10]Isolde Adler, Philipp Klaus Krause:
A lower bound on the tree-width of graphs with irrelevant vertices. CoRR abs/1901.04325 (2019) - 2018
- [c11]Isolde Adler, Frederik Harwath:
Property Testing for Bounded Degree Databases. STACS 2018: 6:1-6:14 - 2017
- [j15]Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon:
Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm. Algorithmica 78(1): 342-377 (2017) - [j14]Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
On rank-width of even-hole-free graphs. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - [j13]Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Irrelevant vertices for the planar Disjoint Paths Problem. J. Comb. Theory B 122: 815-843 (2017) - 2016
- [j12]Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos:
Planar Disjoint-Paths Completion. Algorithmica 76(2): 401-425 (2016) - [i9]Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
On rank-width of even-hole-free graphs. CoRR abs/1611.09907 (2016) - 2015
- [j11]Isolde Adler, Mamadou Moustapha Kanté:
Linear rank-width and linear clique-width of trees. Theor. Comput. Sci. 589: 87-98 (2015) - [i8]Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos:
Planar Disjoint-Paths Completion. CoRR abs/1511.04952 (2015) - 2014
- [j10]Isolde Adler, Arthur M. Farley, Andrzej Proskurowski:
Obstructions for linear rank-width at most 1. Discret. Appl. Math. 168: 3-13 (2014) - [j9]Hans Adler, Isolde Adler:
Interpreting nowhere dense graph classes as a classical notion of model theory. Eur. J. Comb. 36: 322-330 (2014) - [c10]Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon:
Linear Rank-Width of Distance-Hereditary Graphs. WG 2014: 42-55 - [i7]Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon:
Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm. CoRR abs/1403.1081 (2014) - 2013
- [c9]Isolde Adler, Mamadou Moustapha Kanté:
Linear Rank-Width and Linear Clique-Width of Trees. WG 2013: 12-25 - [i6]Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Irrelevant Vertices for the Planar Disjoint Paths Problem. CoRR abs/1310.2378 (2013) - 2012
- [j8]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Fast Minor Testing in Planar Graphs. Algorithmica 64(1): 69-84 (2012) - [j7]Isolde Adler, Mark Weyer:
Tree-width for first order formulae. Log. Methods Comput. Sci. 8(1) (2012) - [j6]Isolde Adler, Tomas Gavenciak, Tereza Klimosová:
Hypertree-depth and minors in hypergraphs. Theor. Comput. Sci. 463: 84-95 (2012) - 2011
- [j5]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Faster parameterized algorithms for minor containment. Theor. Comput. Sci. 412(50): 7018-7028 (2011) - [c8]Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Tight Bounds for Linkages in Planar Graphs. ICALP (1) 2011: 110-121 - [c7]Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos:
Planar Disjoint-Paths Completion. IPEC 2011: 80-93 - [i5]Isolde Adler, Arthur M. Farley, Andrzej Proskurowski:
Obstructions for linear rankwidth at most 1. CoRR abs/1106.2533 (2011) - 2010
- [c6]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Fast Minor Testing in Planar Graphs. ESA (1) 2010: 97-109 - [c5]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Faster Parameterized Algorithms for Minor Containment. SWAT 2010: 322-333 - [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 - [i4]Isolde Adler, Philipp Klaus Krause:
A lower bound for the tree-width of planar graphs with vital linkages. CoRR abs/1011.2136 (2010) - [i3]Hans Adler, Isolde Adler:
Nowhere dense graph classes, stability, and the independence property. CoRR abs/1011.4016 (2010)
2000 – 2009
- 2009
- [c3]Isolde Adler, Mark Weyer:
Tree-Width for First Order Formulae. CSL 2009: 71-85 - [i2]Isolde Adler:
Games for width parameters and monotonicity. CoRR abs/0906.3857 (2009) - 2008
- [j4]Isolde Adler:
Tree-Related Widths of Graphs and Hypergraphs. SIAM J. Discret. Math. 22(1): 102-123 (2008) - [c2]Isolde Adler:
Tree-width and functional dependencies in databases. PODS 2008: 311-320 - [c1]Isolde Adler, Martin Grohe, Stephan Kreutzer:
Computing excluded minors. SODA 2008: 641-650 - [i1]Hans Adler, Isolde Adler:
A note on clique-width and tree-width for structures. CoRR abs/0806.0103 (2008) - 2007
- [j3]Isolde Adler, Georg Gottlob, Martin Grohe:
Hypertree width and related hypergraph invariants. Eur. J. Comb. 28(8): 2167-2181 (2007) - [j2]Isolde Adler:
Directed tree-width examples. J. Comb. Theory B 97(5): 718-725 (2007) - 2006
- [b1]Isolde Adler:
Width functions for hypertree decompositions (Weitefunktionen für Hyperbaumzerlegungen). University of Freiburg, Germany, 2006 - 2004
- [j1]Isolde Adler:
Marshals, monotone marshals, and hypertree-width. J. Graph Theory 47(4): 275-296 (2004)
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-12-02 22:31 CET 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:
