TY - GEN A1 - Beisegel, Jesse A1 - Chiarelli, Nina A1 - Köhler, Ekkehard A1 - Krnc, Matjaž A1 - Milanič, Martin A1 - Pivač, Nevena A1 - Scheffler, Robert A1 - Strehler, Martin ED - Adler, Isolde ED - Müller, Haiko T1 - Edge Elimination and Weighted Graph Classes T2 - Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020 Y1 - 2020 SN - 978-3-030-60439-4 SN - 978-3-030-60440-0 U6 - https://doi.org/10.1007/978-3-030-60440-0_11 SN - 1611-3349 SN - 0302-9743 SP - 134 EP - 147 PB - Springer CY - Cham ER - TY - GEN A1 - Beisegel, Jesse A1 - Köhler, Ekkehard A1 - Scheffler, Robert A1 - Strehler, Martin T1 - Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs T2 - Algorithmica Y1 - 2023 U6 - https://doi.org/10.1007/s00453-023-01107-1 SN - 0178-4617 VL - 85 IS - 8 SP - 2454 EP - 2481 ER - TY - GEN A1 - Beisegel, Jesse A1 - Denkert, Carolin A1 - Köhler, Ekkehard A1 - Krnc, Matjaž A1 - Pivač, Nevena A1 - Scheffler, Robert A1 - Strehler, Martin T1 - The Recognition Problem of Graph Search Trees T2 - SIAM Journal on Discrete Mathematics Y1 - 2021 U6 - https://doi.org/10.1137/20M1313301 SN - 1095-7146 SN - 0895-4801 VL - 35 IS - 2 SP - 1418 EP - 1446 ER - TY - GEN A1 - Beisegel, Jesse A1 - Chudnovsky, Maria A1 - Gurvich, Vladimir A1 - Milanič, Martin A1 - Servatius, Mary ED - Friggstad, Zachary ED - Sack, Jörg-Rüdiger ED - Salavatipour, Mohammad T1 - Avoidable Vertices and Edges in Graphs T2 - Algorithms and Data Structures : 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings Y1 - 2019 SN - 978-3-030-24765-2 SN - 978-3-030-24766-9 U6 - https://doi.org/10.1007/978-3-030-24766-9_10 SN - 0302-9743 SN - 1611-3349 SP - 126 EP - 139 PB - Springer CY - Cham ER - TY - GEN A1 - Beisegel, Jesse A1 - Köhler, Ekkehard A1 - Scheffler, Robert A1 - Strehler, Martin T1 - Linear Time LexDFS on Chordal Graphs T2 - 28th Annual European Symposium on Algorithms (ESA) 2020, September 7-9, 2020, Pisa, Italy) Y1 - 2020 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0030-drops-128790 UR - https://drops.dagstuhl.de/opus/volltexte/2020/12879 VL - 173 SP - 13:1 EP - 13:13 PB - Schloss Dagstuhl, Leibnitz Zentrum für Informatik ER - TY - GEN A1 - Beisegel, Jesse A1 - Denkert, Carolin A1 - Köhler, Ekkehard A1 - Krnc, Matjaž A1 - Pivač, Nevena A1 - Scheffler, Robert A1 - Strehler, Martin ED - Coutinho, Gabriel ED - Kohayakawa, Yoshiharu ED - dos Santos, Vinicius ED - Urrutia, Sebastián T1 - Recognizing Graph Search Trees T2 - The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019) 2-7 June 2019, Belo Horizonte, Brazil Y1 - 2019 U6 - https://doi.org/10.1016/j.entcs.2019.08.010 SN - 1571-0661 SP - 99 EP - 110 PB - Elsevier ER - TY - GEN A1 - Beisegel, Jesse A1 - Denkert, Carolin A1 - Köhler, Ekkehard A1 - Krnc, Matjaž A1 - Pivač, Nevena A1 - Scheffler, Robert A1 - Strehler, Martin T1 - On the End-Vertex Problem of Graph Searches T2 - Discrete Mathematics & Theoretical Computer Science Y1 - 2019 SN - 1365-8050 SN - 1462-7264 VL - 21 IS - 1 ER - TY - GEN A1 - Beisegel, Jesse A1 - Denkert, Carolin A1 - Köhler, Ekkehard A1 - Krnc, Matjaž A1 - Pivač, Nevena A1 - Scheffler, Robert A1 - Strehler, Martin T1 - Recognizing Graph Search Trees T2 - arXiv.org Y1 - 2018 UR - https://arxiv.org/abs/1811.09249v2 ER - TY - GEN A1 - Beisegel, Jesse ED - Brandstädt, Andreas ED - Köhler, Ekkehard ED - Meer, Klaus T1 - Characterising AT-free Graphs with BFS T2 - Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27–29, 2018, Proceedings Y1 - 2018 SN - 978-3-030-00255-8 SN - 978-3-030-00256-5 U6 - https://doi.org/10.1007/978-3-030-00256-5_2 SN - 0302-9743 SN - 1611-3349 SP - 15 EP - 26 PB - Springer CY - Cham ER - TY - GEN A1 - Maier, Isidor Konrad A1 - Kuhn, Johannes A1 - Beisegel, Jesse A1 - Huber-Liebl, Markus A1 - Wolff, Matthias T1 - Minimalist Grammar: Construction without Overgeneration T2 - arXiv N2 - In this paper we give instructions on how to write a minimalist grammar (MG). In order to present the instructions as an algorithm, we use a variant of context free grammars (CFG) as an input format. We can exclude overgeneration, if the CFG has no recursion, i.e. no non-terminal can (indirectly) derive to a right-hand side containing itself. The constructed MGs utilize licensors/-ees as a special way of exception handling. A CFG format for a derivation A_eats_B↦∗peter_eats_apples, where A and B generate noun phrases, normally leads to overgeneration, e.\,g., i_eats_apples. In order to avoid overgeneration, a CFG would need many non-terminal symbols and rules, that mainly produce the same word, just to handle exceptions. In our MGs however, we can summarize CFG rules that produce the same word in one item and handle exceptions by a proper distribution of licensees/-ors. The difficulty with this technique is that in most generations the majority of licensees/-ors is not needed, but still has to be triggered somehow. We solve this problem with ϵ-items called \emph{adapters}. Y1 - 2023 UR - https://arxiv.org/abs/2311.01820 U6 - https://doi.org/10.48550/arXiv.2311.01820 ER - TY - RPRT A1 - Beisegel, Jesse A1 - Buhl, Johannes A1 - Izar, Rameez A1 - Schmidt, Johannes A1 - Bambach, Markus A1 - Fügenschuh, Armin ED - Fügenschuh, Armin T1 - Mixed-integer programming for additive manufacturing Y1 - 2021 U6 - https://doi.org/10.26127/BTUOpen-5731 CY - Cottbus ER - TY - CHAP A1 - Beisegel, Jesse A1 - Buhl, Johannes A1 - Israr, Rameez A1 - Schmidt, Johannes A1 - Bambach, Martin A1 - Fügenschuh, Armin ED - Cristiani, Emiliano ED - Falcone, Maurizio ED - Tozza, Silvia T1 - Mixed-Integer Programming Models for Two Metal Additive Manufacturing Methods T2 - Mathematical Methods for Objects Reconstruction Y1 - 2023 SN - 978-981-9907-75-5 SN - 978-981-9907-76-2 SP - 121 EP - 155 PB - Springer CY - Heidelberg ER -