Peter Recht

According to our database, Peter Recht authored at least 10 papers between 1986 and 2019.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2019

Maximum cycle packing using SPR-trees.

Christin Otto, Peter Recht

Electron. J. Graph Theory Appl., 2019

2015

Maximum cycle packing in Eulerian graphs using local traces.

Peter Recht, Eva-Maria Sprengel

Discuss. Math. Graph Theory, 2015

2014

On maximum cycle packings in polyhedral graphs.

Peter Recht, Stefan Stehling

Electron. J. Graph Theory Appl., 2014

2011

Packing Euler graphs with traces.

Peter Recht, Eva-Maria Sprengel

Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

2010

Packing disjoint cycles over vertex cuts.

Jochen Harant, Dieter Rautenbach, Peter Recht, Ingo Schiermeyer, Eva-Maria Sprengel

Discret. Math., 2010

Packing edge-disjoint cycles in graphs and the cyclomatic number.

Jochen Harant, Dieter Rautenbach, Peter Recht, Friedrich Regen

Discret. Math., 2010

2006

Online Dial-A-Ride Problem with Time Windows: An Exact Algorithm Using Status Vectors.

Anke Fabri, Peter Recht

Proceedings of the Operations Research, 2006

2001

Identifying non-active restrictions in convex quadratic programming.

Peter Recht

Math. Methods Oper. Res., 2001

1992

On generalized gradients.

Peter Recht

ZOR Methods Model. Oper. Res., 1992

1986

Hačijan-Shor methods and quadratic optimization.

Peter Recht

PhD thesis, 1986