E-LIB Suche - Ergebnisse für: Beisegel, Jesse

1

Mixed-Integer Programming Models for Two Metal Additive Man..:

, In: Springer INdAM Series; Mathematical Methods for Objects Reconstruction,

Beisegel, Jesse ; Buhl, Johannes ; Israr, Rameez... - p. 121-155 , 2023

Link: https://doi.org/10.1007/..

2

Certifying Fully Dynamic Algorithms for Recognition and Ham..:

Beisegel, Jesse ; Köhler, Ekkehard ; Scheffler, Robert.
Algorithmica. 85 (2023) 8 - p. 2454-2481 , 2023

Link: https://doi.org/10.1007/..

3

Avoidable vertices and edges in graphs: Existence, characte..:

Beisegel, Jesse ; Chudnovsky, Maria ; Gurvich, Vladimir..
Discrete Applied Mathematics. 309 (2022) - p. 285-300 , 2022

Link: https://doi.org/10.1016/..

4

The Recognition Problem of Graph Search Trees:

Beisegel, Jesse ; Denkert, Carolin ; Köhler, Ekkehard...
SIAM Journal on Discrete Mathematics. 35 (2021) 2 - p. 1418-1446 , 2021

Link: https://doi.org/10.1137/..

5

Convexity in graphs: vertex order characterisations and gra..:

Beisegel, Jesse , 2020

Link: https://nbn-resolving.de..

6

Edge Elimination and Weighted Graph Classes:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Beisegel, Jesse ; Chiarelli, Nina ; Köhler, Ekkehard... - p. 134-147 , 2020

Link: https://doi.org/10.1007/..

7

Avoidable Vertices and Edges in Graphs:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,

Beisegel, Jesse ; Chudnovsky, Maria ; Gurvich, Vladimir.. - p. 126-139 , 2019

Link: https://doi.org/10.1007/..

8

Recognizing Graph Search Trees:

Beisegel, Jesse ; Denkert, Carolin ; Köhler, Ekkehard...
Electronic Notes in Theoretical Computer Science. 346 (2019) - p. 99-110 , 2019

Link: https://doi.org/10.1016/..

9

Characterising AT-free Graphs with BFS:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Beisegel, Jesse - p. 15-26 , 2018

Link: https://doi.org/10.1007/..

10

Minimalist Grammar: Construction without Overgeneration:

Maier, Isidor Konrad ; Kuhn, Johannes ; Beisegel, Jesse..
http://arxiv.org/abs/2311.01820. , 2023

Link: http://arxiv.org/abs/231..

11

The recognition problem of graph search trees read more:

Beisegel, Jesse ; Denkert, Carolin ; Köhler, Ekkehard...
info:eu-repo/semantics/altIdentifier/doi/10.1137/20M1313301. , 2021

Link: https://repozitorij.upr...

12

Mixed-integer programming for additive manufacturing ; Gemi..:

Beisegel, Jesse ; Buhl, Johannes ; Israr, Rameez...
https://opus4.kobv.de/opus4-btu/frontdoor/index/index/docId/5731. , 2021

Link: https://opus4.kobv.de/op..

13

Edge elimination schemes of weighted graph classes, Worksho..:

Milanič, Martin ; Beisegel, Jesse ; Chiarelli, Nina...
https://repozitorij.upr.si/IzpisGradiva.php?id=12520. , 2020

Link: https://repozitorij.upr...

14

Edge elimination and weighted graph classes:

Beisegel, Jesse ; Chiarelli, Nina ; Köhler, Ekkehard...
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-030-60440-0_11. , 2020

Link: https://repozitorij.upr...

15

Convexity in graphs: vertex order characterisations and gra..:

Beisegel, Jesse
https://opus4.kobv.de/opus4-btu/frontdoor/index/index/docId/5145. , 2020

Link: https://opus4.kobv.de/op..