Items where authors include "Adler, I"

Article

Adler, I orcid.org/0000-0002-9667-9841, Benediktsson, BG and Macpherson, D (2022) Vapnik–Chervonenkis dimension and density on Johnson and Hamming graphs. Discrete Applied Mathematics, 312. pp. 29-44. ISSN 0166-218X

Adler, I orcid.org/0000-0002-9667-9841 and Köhler, N (2022) An explicit construction of graphs of bounded degree that are far from being Hamiltonian. Discrete Mathematics and Theoretical Computer Science, 24 (1). 3. ISSN 1462-7264

Aboulker, P, Adler, I orcid.org/0000-0002-9667-9841, Kim, EJ et al. (2 more authors) (2021) On the tree-width of even-hole-free graphs. European Journal of Combinatorics, 98. 103394. ISSN 0195-6698

Adler, I orcid.org/0000-0002-9667-9841, Paul, C and Thilikos, DM (2021) Connected Search for a Lazy Robber. Journal of Graph Theory, 97 (4). pp. 510-552. ISSN 0364-9024

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 orcid.org/0000-0002-9667-9841, Köhler, N and Peng, P (2021) GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing. In: Kabanets, V, (ed.) Proceedings of 36th Computational Complexity Conference (CCC 2021). 36th Computational Complexity Conference (CCC 2021), 20-23 Jul 2021, Toronto, Canada. Leibniz International Proceedings in Informatics (LIPIcs), 200 . Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 34:1-34:27. ISBN 978-3-95977-193-1

Adler, I orcid.org/0000-0002-9667-9841, Köhler, N and Peng, P (2021) On Testability of First-Order Properties in Bounded-Degree Graphs. In: SODA '21: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '21: ACM-SIAM Symposium on Discrete Algorithms, 10-13 Jan 2021, Online. ACM , pp. 1578-1597. ISBN 9781611976465

Adler, I orcid.org/0000-0002-9667-9841 and Fahey, P (2020) Faster Property Testers in a Variation of the Bounded Degree Model. In: 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020). 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020), 14-18 Dec 2020, Online. Schloss Dagstuhl - Leibniz-Zentrum für Informatik . ISBN 978-3-95977-174-0

Adler, I, Paul, C and Thilikos, DT (2019) Connected Search for a Lazy Robber. In: Chattopadhyay, A and Gastin, P, (eds.) 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 fuer Informatik , Dagstuhl, Germany , 7:1-7:14. ISBN 978-3-95977-131-3

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