Stephan Schwartz

Orcid: 0000-0003-2901-5065

According to our database1, Stephan Schwartz authored at least 9 papers between 2016 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Vertex covering with capacitated trees.
Networks, March, 2023

2022
An overview of graph covering and partitioning.
Discret. Math., 2022

Rooted Maximum Weight Connected Subgraphs with Balancing and Capacity Constraints.
Proceedings of the 10th International Network Optimization Conference, 2022

2021
Finding Minimum Balanced Separators - An Exact Approach.
Proceedings of the Operations Research Proceedings 2021, Selected Papers of the International Conference of the Swiss, German and Austrian Operations Research Societies (SVOR/ASRO, GOR e.V., ÖGOR), University of Bern, Switzerland, August 31, 2021

Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs.
Proceedings of the Approximation, 2021

2018
The Graph Segmentation Problem.
Electron. Notes Discret. Math., 2018

2017
On Finding Subpaths With High Demand.
Proceedings of the Operations Research Proceedings 2017, 2017

2016
An Extended Network Interdiction Problem for Optimal Toll Control.
Electron. Notes Discret. Math., 2016

Designing Inspector Rosters with Optimal Strategies.
Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016


  Loading...