Browse by Person

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 11.


Adler, I and Krause, PK (2019) A lower bound on the tree-width of graphs with irrelevant vertices. Journal of Combinatorial Theory, Series B, 137. pp. 126-136. ISSN 1096-0902

Adler, I, Le, NK, Muller, H et al. (3 more authors) (2017) On rank-width of even-hole-free graphs. Discrete Mathematics and Theoretical Computer Science, 19 (1). 25. ISSN 1462-7264

Adler, I, Kanté, MM and Kwon, O-J (2017) Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm. Algorithmica, 78 (1). pp. 342-377. ISSN 0178-4617

Adler, I, Kolliopoulos, SG, Krause, PK et al. (3 more authors) (2017) Irrelevant vertices for the planar Disjoint Paths Problem. Journal of Combinatorial Theory, Series B, 122. pp. 815-843. ISSN 0095-8956

Adler, I, Kolliopoulos, SG and Thilikos, DM (2016) Planar Disjoint-Paths Completion. Algorithmica, 76 (2). pp. 401-425. ISSN 0178-4617

Adler, I and Kante, MM (2015) Linear rank-width and linear clique-width of trees. Theoretical Computer Science, 589. pp. 87-98. ISSN 0304-3975

Adler, I, Farley, AM and Proskurowski, A (2014) Obstructions for linear rank-width at most 1. Discrete Applied Mathematics, 168. pp. 3-13. ISSN 0166-218X

Adler, H and Adler, I (2014) Interpreting nowhere dense graph classes as a classical notion of model theory. European Journal of Combinatorics, 36. pp. 322-330. ISSN 0195-6698

Proceedings Paper

Adler, I, Paul, C and Thilikos, DT (2019) Connected Search for a Lazy Robber. In: LIPIcs : Leibniz International Proceedings in Informatics. FSTTCS 2019: 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 11-13 Dec 2019, Indian Institute of Technology Bombay, Mumbai, India. Schloss Dagstuhl - Leibniz-Zentrum für Informatik . (In Press)

Adler, I and Harwath, F (2018) Property Testing for Bounded Degree Databases. In: 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018). STACS 2018, 28 Feb - 03 Mar 2018, Caen, France. Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , 6:1-6:14. ISBN 978-3-95977-062-0

Adler, I, Kante, MM and Kwon, O-J (2014) Linear Rank-Width of Distance-Hereditary Graphs. In: Kratsch, D and Todinca, I, (eds.) Graph-Theoretic Concepts in Computer Science. 40th International Workshop (WG 2014), 25-27 Jun 2014, Nouan-le-Fuzelier, France. Lecture Notes in Computer Science (8747). Springer , pp. 42-55. ISBN 978-3-319-12339-4

This list was generated on Sat Jan 11 22:50:10 2020 GMT.