Follow
Isabel Beckenbach
Isabel Beckenbach
Verified email at zib.de - Homepage
Title
Cited by
Cited by
Year
Hall’s and Kőnig’s theorem in graphs and hypergraphs
I Beckenbach, R Borndörfer
Discrete Mathematics 341 (10), 2753-2761, 2018
82018
Mixed-integer programming for cycle detection in nonreversible Markov processes
J Witzig, I Beckenbach, L Eifler, K Fackeldey, A Gleixner, A Grever, ...
Multiscale Modeling & Simulation 16 (1), 248-265, 2018
52018
Matchings and flows in hypergraphs
IL Beckenbach
42019
A hypergraph network simplex algorithm
I Beckenbach
Operations Research Proceedings 2017, 309-315, 2018
42018
Perfect f-matchings and f-factors in hypergraphs—A combinatorial approach
I Beckenbach, R Scheidweiler
Discrete Mathematics 340 (10), 2499-2506, 2017
32017
A Combinatorial Proof of a König-type Theorem for Unimodular Hypergraphs
I Beckenbach, B Peis, O Schaudt, R Scheidweiler
22017
Mixed-integer programming for cycle detection in non-reversible markov processes
I Beckenbach, L Eifler, K Fackeldey, A Gleixner, A Grever, M Weber, ...
arXiv preprint arXiv:1609.02063, 2016
12016
An Approximation Result for Matchings in Partitioned Hypergraphs
I Beckenbach, R Borndörfer
Operations Research Proceedings 2014, 31-36, 2016
12016
Special cases of the hypergraph assignment problem
I Beckenbach
Zuse Institute Berlin (ZIB), 2013
12013
Von Graphen zu Hypergraphen
I Beckenbach
OR News, 2020
2020
The Tight Cut Decomposition of Matching Covered Uniformable Hypergraphs
I Beckenbach, M Hatzel, S Wiederrecht
arXiv preprint arXiv:1812.05461, 2018
2018
A Hall Condition for Normal Hypergraphs
I Beckenbach, R Borndörfer
2015
The S-Bahn Challenge in Berlin
I Beckenbach, R Borndörfer, L Knoben, D Kretz, M Uetz
2015
Uber den Core nicht-bipartiter Matchingspiele
I Beckenbach, W Hochstättler
2010
A Tight Cut Decomposition for Hypergraphs with Perfect Matchings
I Beckenbach, M Hatzel, S Wiederrecht
The system can't perform the operation now. Try again later.
Articles 1–15