Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Mark Scharbrodt
@phdthesis{DBLP:phd/de/Scharbrodt07, author = {Mark Scharbrodt}, title = {Produktionsplanung in der Prozessindustrie: Modelle, effiziente Algorithmen und Umsetzung (Production Planning in the Process Industrie: Models, efficient Algorithms and Implementation)}, school = {Technical University of Munich, Germany}, year = {2007}, url = {https://mediatum.ub.tum.de/601676}, urn = {urn:nbn:de:bvb:91-diss2000122116615}, timestamp = {Fri, 20 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/de/Scharbrodt07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/ScharbrodtSS06, author = {Mark Scharbrodt and Thomas Schickinger and Angelika Steger}, title = {A new average case analysis for completion time scheduling}, journal = {J. {ACM}}, volume = {53}, number = {1}, pages = {121--146}, year = {2006}, url = {https://doi.org/10.1145/1120582.1120585}, doi = {10.1145/1120582.1120585}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/ScharbrodtSS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ScharbrodtSS02, author = {Mark Scharbrodt and Thomas Schickinger and Angelika Steger}, editor = {John H. Reif}, title = {A new average case analysis for completion time scheduling}, booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing, May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada}, pages = {170--178}, publisher = {{ACM}}, year = {2002}, url = {https://doi.org/10.1145/509907.509936}, doi = {10.1145/509907.509936}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ScharbrodtSS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ScharbrodtSW99, author = {Mark Scharbrodt and Angelika Steger and Horst Weisser}, editor = {Robert Endre Tarjan and Tandy J. Warnow}, title = {Approximability of Scheduling with Fixed Jobs}, booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland, {USA}}, pages = {961--962}, publisher = {{ACM/SIAM}}, year = {1999}, url = {http://dl.acm.org/citation.cfm?id=314500.314947}, timestamp = {Thu, 05 Jul 2018 07:29:57 +0200}, biburl = {https://dblp.org/rec/conf/soda/ScharbrodtSW99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/JungerMOS98, author = {Michael J{\"{u}}nger and Petra Mutzel and Thomas Odenthal and Mark Scharbrodt}, title = {The thickness of a minor-excluded class of graphs}, journal = {Discret. Math.}, volume = {182}, number = {1-3}, pages = {169--176}, year = {1998}, url = {https://doi.org/10.1016/S0012-365X(97)00146-5}, doi = {10.1016/S0012-365X(97)00146-5}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/JungerMOS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/MutzelOS98, author = {Petra Mutzel and Thomas Odenthal and Mark Scharbrodt}, title = {The Thickness of Graphs: {A} Survey}, journal = {Graphs Comb.}, volume = {14}, number = {1}, pages = {59--73}, year = {1998}, url = {https://doi.org/10.1007/PL00007219}, doi = {10.1007/PL00007219}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/gc/MutzelOS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.