default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Skutella
Person information
- affiliation: TU Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i27]Thomas Bosman, Martijn van Ee, Ekin Ergen, Csanád Imreh, Alberto Marchetti-Spaccamela
, Martin Skutella, Leen Stougie:
Total Completion Time Scheduling Under Scenarios. CoRR abs/2402.19259 (2024)- [i26]Vincent Froese, Moritz Grillo, Martin Skutella:
Complexity of Deciding Injectivity and Surjectivity of ReLU Neural Networks. CoRR abs/2405.19805 (2024) - 2023
- [j67]Christoph Hertrich, Martin Skutella:
Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size. INFORMS J. Comput. 35(5): 1079-1097 (2023) - [j66]Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella:
On the robustness of potential-based flow networks. Math. Program. 197(1): 337-374 (2023) - [j65]Martin Skutella:
A note on the quickest minimum cost transshipment problem. Oper. Res. Lett. 51(3): 255-258 (2023) - [j64]Christoph Hertrich, Amitabh Basu, Marco Di Summa, Martin Skutella:
Towards Lower Bounds on the Depth of ReLU Neural Networks. SIAM J. Discret. Math. 37(2): 997-1029 (2023) - [c76]Thomas Bosman, Martijn van Ee, Ekin Ergen, Csanád Imreh, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie:
Total Completion Time Scheduling Under Scenarios. WAOA 2023: 104-118 - [i25]Martin Skutella:
An Introduction to Transshipments Over Time. CoRR abs/2312.04991 (2023) - 2022
- [j63]Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella:
Packing under convex quadratic constraints. Math. Program. 192(1): 361-386 (2022) - [j62]Sarah Morell, Martin Skutella:
Single source unsplittable flows with arc-wise lower and upper bounds. Math. Program. 192(1): 477-496 (2022) - [c75]Miriam Schlöter, Martin Skutella, Khai Van Tran:
A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method. SODA 2022: 90-102 - [c74]Max Klimm, Guillaume Sagnol, Martin Skutella, Khai Van Tran:
Competitive Strategies for Symmetric Rendezvous on the Line. SODA 2022: 329-347 - [i24]Martin Skutella:
A Note on the Quickest Minimum Cost Transshipment Problem. CoRR abs/2209.05558 (2022) - 2021
- [j61]Joseph Cheriyan, R. Ravi, Martin Skutella:
A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs. Oper. Res. Lett. 49(6): 842-843 (2021) - [c73]Christoph Hertrich, Martin Skutella:
Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size. AAAI 2021: 7685-7693 - [c72]Christoph Hertrich, Amitabh Basu, Marco Di Summa, Martin Skutella:
Towards Lower Bounds on the Depth of ReLU Neural Networks. NeurIPS 2021: 3336-3348 - [i23]Joseph Cheriyan, R. Ravi, Martin Skutella:
A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs. CoRR abs/2104.06210 (2021) - [i22]Christoph Hertrich, Amitabh Basu, Marco Di Summa, Martin Skutella:
Towards Lower Bounds on the Depth of ReLU Neural Networks. CoRR abs/2105.14835 (2021) - [i21]Miriam Schlöter, Martin Skutella, Khai Van Tran:
A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method. CoRR abs/2108.06239 (2021) - 2020
- [c71]Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella:
Packing Under Convex Quadratic Constraints. IPCO 2020: 266-279 - [c70]Sarah Morell, Martin Skutella:
Single Source Unsplittable Flows with Arc-Wise Lower and Upper Bounds. IPCO 2020: 294-306 - [c69]Alberto Marchetti-Spaccamela, Nicole Megow, Jens Schlöter, Martin Skutella, Leen Stougie:
On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems. IPDPS 2020: 1061-1070 - [i20]Christoph Hertrich, Martin Skutella:
Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size. CoRR abs/2005.14105 (2020)
2010 – 2019
- 2019
- [j60]Ágnes Cseh, Martin Skutella:
Paths to stable allocations. Int. J. Game Theory 48(3): 835-862 (2019) - [j59]Martin Groß, Marc E. Pfetsch, Lars Schewe, Martin Schmidt, Martin Skutella:
Algorithmic results for potential-based flows: Easy and hard cases. Networks 73(3): 306-324 (2019) - [j58]Yann Disser, Martin Skutella:
The Simplex Algorithm Is NP-Mighty. ACM Trans. Algorithms 15(1): 5:1-5:19 (2019) - 2018
- [j57]Jannik Matuschke, Martin Skutella, José A. Soto:
Robust Randomized Matchings. Math. Oper. Res. 43(2): 675-692 (2018) - [j56]Quentin Louveaux, Martin Skutella:
Preface. Math. Program. 172(1-2): 1-2 (2018) - [j55]Laura Sanità, Martin Skutella:
WAOA 2015 Special Issue on TOCS. Theory Comput. Syst. 62(2): 247-248 (2018) - [j54]Martin Groß, Marc E. Pfetsch, Martin Skutella:
On the complexity of instationary gas flows. Oper. Res. Lett. 46(3): 286-290 (2018) - [c68]Frank Neumann, Sergey Polyakovskiy, Martin Skutella, Leen Stougie, Junhua Wu:
A Fully Polynomial Time Approximation Scheme for Packing While Traveling. ALGOCLOUD 2018: 59-72 - [c67]Leon Sering, Martin Skutella:
Multi-Source Multi-Sink Nash Flows over Time. ATMOS 2018: 12:1-12:20 - [c66]Sven Jäger, Martin Skutella:
Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling. STACS 2018: 43:1-43:14 - [i19]Sven Jäger, Martin Skutella:
Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling. CoRR abs/1801.01105 (2018) - [i18]Leon Sering, Martin Skutella:
Multi-Source Multi-Sink Nash Flows Over Time. CoRR abs/1807.01098 (2018) - 2017
- [j53]Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella:
Protection of flows under targeted attacks. Oper. Res. Lett. 45(1): 53-59 (2017) - [j52]Nicole Megow, Julie Meißner, Martin Skutella:
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty. SIAM J. Comput. 46(4): 1217-1240 (2017) - [c65]Miriam Schlöter, Martin Skutella:
Fast and Memory-Efficient Algorithms for Evacuation Problems. SODA 2017: 821-840 - [i17]Frank Neumann, Sergey Polyakovskiy, Martin Skutella, Leen Stougie, Junhua Wu:
A Fully Polynomial Time Approximation Scheme for Packing While Traveling. CoRR abs/1702.05217 (2017) - [i16]Jannik Matuschke, Martin Skutella, José A. Soto:
Robust randomized matchings. CoRR abs/1705.06631 (2017) - [i15]Martin Groß, Marc E. Pfetsch, Martin Skutella:
On the Complexity of Instationary Gas Flows. CoRR abs/1708.08748 (2017) - 2016
- [j51]Martin Skutella, Maxim Sviridenko, Marc Uetz:
Unrelated Machine Scheduling with Stochastic Processing Times. Math. Oper. Res. 41(3): 851-864 (2016) - [j50]Martin Skutella, José Verschae:
Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures. Math. Oper. Res. 41(3): 991-1021 (2016) - [j49]Martin Skutella:
A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective. Oper. Res. Lett. 44(5): 676-679 (2016) - [j48]Nicole Megow, Martin Skutella, José Verschae, Andreas Wiese:
The Power of Recourse for Online MST and TSP. SIAM J. Comput. 45(3): 859-880 (2016) - [j47]Martin Skutella:
A Note on the Ring Loading Problem. SIAM J. Discret. Math. 30(1): 327-342 (2016) - [c64]Ralf Borndörfer, Sebastian Schenker, Martin Skutella, Timo Strunk:
PolySCIP. ICMS 2016: 259-264 - [e5]Quentin Louveaux, Martin Skutella:
Integer Programming and Combinatorial Optimization - 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings. Lecture Notes in Computer Science 9682, Springer 2016, ISBN 978-3-319-33460-8 [contents] - [i14]Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella:
Protection of flows under targeted attacks. CoRR abs/1601.03603 (2016) - [i13]Martin Skutella:
A 2.542-Approximation for Precedence Constrained Single Machine Scheduling with Release Dates and Total Weighted Completion Time Objective. CoRR abs/1603.04690 (2016) - 2015
- [j46]Ashwin Arulselvan, Olaf Maurer, Martin Skutella:
An incremental algorithm for the uncapacitated facility location problem. Networks 65(4): 306-311 (2015) - [j45]Ashwin Arulselvan, Martin Groß, Martin Skutella:
Graph orientation and flows over time. Networks 66(3): 196-209 (2015) - [j44]Martin Groß, Martin Skutella:
A tight bound on the speed-up through storage for quickest multi-commodity flows. Oper. Res. Lett. 43(1): 93-95 (2015) - [c63]Friedrich Eisenbrand, Shay Moran, Rom Pinchasi, Martin Skutella:
Node-Balancing by Edge-Increments. ESA 2015: 450-458 - [c62]Nicole Megow, Julie Meißner, Martin Skutella:
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty. ESA 2015: 878-890 - [c61]Martin Skutella:
A note on the ring loading problem. SODA 2015: 37-46 - [c60]Yann Disser, Martin Skutella:
The Simplex Algorithm is NP-mighty. SODA 2015: 858-872 - [c59]Jannik Matuschke, Martin Skutella, José A. Soto:
Robust randomized matchings. SODA 2015: 1904-1915 - [p4]Martin Skutella:
Convex Quadratic Programming in Scheduling. Gems of Combinatorial Optimization and Graph Algorithms 2015: 125-132 - [e4]Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner:
Gems of Combinatorial Optimization and Graph Algorithms. Springer 2015, ISBN 978-3-319-24970-4 [contents] - [e3]Laura Sanità, Martin Skutella:
Approximation and Online Algorithms - 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers. Lecture Notes in Computer Science 9499, Springer 2015, ISBN 978-3-319-28683-9 [contents] - [i12]Friedrich Eisenbrand, Shay Moran, Rom Pinchasi, Martin Skutella:
Node-balancing by edge-increments. CoRR abs/1504.06919 (2015) - [i11]José R. Correa, Tobias Harks, Kai Nagel, Britta Peis, Martin Skutella:
Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 15412). Dagstuhl Reports 5(10): 19-34 (2015) - 2014
- [j43]Melanie Schmidt, Martin Skutella:
Earliest arrival flows in networks with multiple sinks. Discret. Appl. Math. 164: 320-327 (2014) - [c58]Ashwin Arulselvan, Martin Groß, Martin Skutella:
Graph Orientation and Flows over Time. ISAAC 2014: 741-752 - [c57]Ágnes Cseh, Martin Skutella:
Paths to Stable Allocations. SAGT 2014: 61-73 - [c56]Martin Skutella, Maxim Sviridenko, Marc Uetz:
Stochastic Scheduling on Unrelated Machines. STACS 2014: 639-650 - [i10]Martin Skutella:
A note on the ring loading problem. CoRR abs/1405.0789 (2014) - [i9]Martin Groß, Martin Skutella:
A tight bound on the speed-up through storage for quickest multi-commodity flows. CoRR abs/1406.4799 (2014) - [i8]Ashwin Arulselvan, Martin Groß, Martin Skutella:
Graph Orientation and Flows Over Time. CoRR abs/1409.3081 (2014) - 2013
- [j42]Ágnes Cseh, Jannik Matuschke, Martin Skutella:
Stable Flows over Time. Algorithms 6(3): 532-545 (2013) - [c55]Chantal Landry, René Henrion, Dietmar Hömberg, Martin Skutella, Wolfgang Welz:
Task assignment, sequencing and path-planning in robotic welding cells. MMAR 2013: 252-257 - [c54]Martin Skutella:
Algorithms and Linear Programming Relaxations for Scheduling Unrelated Parallel Machines. SEA 2013: 1-3 - [i7]Yann Disser, Martin Skutella:
In defense of the Simplex Algorithm's worst-case behavior. CoRR abs/1311.5935 (2013) - 2012
- [j41]José R. Correa, Martin Skutella, José Verschae:
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders. Math. Oper. Res. 37(2): 379-398 (2012) - [j40]Michael Hintermüller, Martin Skutella:
Special issue of the ISMP 2012 in Berlin. Math. Program. 134(1): 1-3 (2012) - [j39]Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie:
Universal Sequencing on an Unreliable Machine. SIAM J. Comput. 41(3): 565-586 (2012) - [c53]Sandro Bosio, Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis, Martin Skutella:
Flows over Time with Negative Transit Times and Arc Release Dates. CTW 2012: 30-33 - [c52]Martin Groß, Martin Skutella:
Maximum Multicommodity Flows over Time without Intermediate Storage. ESA 2012: 539-550 - [c51]Nicole Megow, Martin Skutella, José Verschae, Andreas Wiese:
The Power of Recourse for Online MST and TSP. ICALP (1) 2012: 689-700 - 2011
- [j38]Frank Neumann, Joachim Reichel, Martin Skutella:
Computing Minimum Cuts by Randomized Search Heuristics. Algorithmica 59(3): 323-342 (2011) - [j37]Friedrich Eisenbrand, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese:
Real-time Avionics Optimization. it Inf. Technol. 53(6): 274-279 (2011) - [j36]Ronald Koch, Ebrahim Nasrabadi, Martin Skutella:
Continuous and discrete flows over time - A general model based on measure theory. Math. Methods Oper. Res. 73(3): 301-337 (2011) - [j35]Ronald Koch, Martin Skutella:
Nash Equilibria and the Price of Anarchy for Flows over Time. Theory Comput. Syst. 49(1): 71-97 (2011) - [j34]Martin Skutella, David P. Williamson:
A note on the generalized min-sum set cover problem. Oper. Res. Lett. 39(6): 433-436 (2011) - [j33]Christos Kaklamanis, Martin Skutella:
Preface. Theor. Comput. Sci. 412(7): 561-562 (2011) - [c50]Martin Groß, Martin Skutella:
Generalized Maximum Flows over Time. WAOA 2011: 247-260 - [p3]Katharina Skutella, Martin Skutella:
Minimum Spanning Trees - Sometimes Greed Pays Off. Algorithms Unplugged 2011: 325-331 - [i6]Martin Skutella, David P. Williamson:
A note on the generalized min-sum set cover problem. CoRR abs/1107.2033 (2011) - 2010
- [j32]Joachim Reichel, Martin Skutella:
Evolutionary Algorithms and Matroid Optimization Problems. Algorithmica 57(1): 187-206 (2010) - [j31]Melanie Schmidt, Martin Skutella:
Earliest Arrival Flows in Networks with Multiple Sinks. Electron. Notes Discret. Math. 36: 607-614 (2010) - [j30]Martin Skutella, Alexia Weber:
On the dominant of the s-t-cut polytope: Vertices, facets, and adjacency. Math. Program. 124(1-2): 441-454 (2010) - [j29]Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondrej Pangrác, Heiko Schilling, Martin Skutella:
Length-bounded cuts and flows. ACM Trans. Algorithms 7(1): 4:1-4:27 (2010) - [c49]Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S. Mattikalli, Martin Niemeier, Arnold W. Nordsieck, Martin Skutella, José Verschae, Andreas Wiese:
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods. ESA (1) 2010: 11-22 - [c48]Martin Skutella, José Verschae:
A Robust PTAS for Machine Covering and Packing. ESA (1) 2010: 36-47 - [c47]Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese:
Scheduling Periodic Tasks in a Hard Real-Time Environment. ICALP (1) 2010: 299-311 - [c46]Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie:
Universal Sequencing on a Single Machine. IPCO 2010: 230-243 - [c45]Britta Peis, Martin Skutella, Andreas Wiese:
Packet Routing on the Grid. LATIN 2010: 120-130 - [c44]Daniel Dressler, Gunnar Flötteröd, Gregor Lämmel, Kai Nagel, Martin Skutella:
Optimal Evacuation Solutions for Large-Scale Scenarios. OR 2010: 239-244 - [c43]Martin Skutella, Wolfgang Welz:
Route Planning for Robot Systems. OR 2010: 307-312 - [c42]Daniel Dressler, Martin Skutella:
An FPTAS for Flows over Time with Aggregate Arc Capacities. WAOA 2010: 106-117 - [i5]Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese:
Scheduling periodic tasks in a hard real-time environment. Scheduling 2010
2000 – 2009
- 2009
- [j28]Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu:
Multiline Addressing by Network Flow. Algorithmica 53(4): 583-596 (2009) - [j27]Maren Martens, Martin Skutella:
Flows with unit path capacities and related packing and covering problems. J. Comb. Optim. 18(3): 272-293 (2009) - [j26]Peter Sanders, Naveen Sivadasan, Martin Skutella:
Online Scheduling with Bounded Migration. Math. Oper. Res. 34(2): 481-498 (2009) - [j25]Nadine Baumann, Martin Skutella:
Earliest Arrival Flows with Multiple Sources. Math. Oper. Res. 34(2): 499-512 (2009) - [j24]Fernanda Salazar, Martin Skutella:
Single-source k-splittable min-cost flows. Oper. Res. Lett. 37(2): 71-74 (2009) - [j23]Luca Becchetti, Alberto Marchetti-Spaccamela, Andrea Vitaletti, Peter Korteweg, Martin Skutella, Leen Stougie:
Latency-constrained aggregation in sensor networks. ACM Trans. Algorithms 6(1): 13:1-13:20 (2009) - [c41]José R. Correa, Martin Skutella, José Verschae:
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders. APPROX-RANDOM 2009: 84-97 - [c40]Ronald Koch, Britta Peis, Martin Skutella, Andreas Wiese:
Real-Time Message Routing and Scheduling. APPROX-RANDOM 2009: 217-230 - [c39]Ekkehard Köhler, Rolf H. Möhring, Martin Skutella:
Traffic Networks and Flows over Time. Algorithmics of Large and Complex Networks 2009: 166-196 - [c38]Joachim Reichel, Martin Skutella:
On the size of weights in randomized search heuristics. FOGA 2009: 21-28 - [c37]Ronald Koch, Martin Skutella:
Nash Equilibria and the Price of Anarchy for Flows over Time. SAGT 2009: 323-334 - [c36]Britta Peis, Martin Skutella, Andreas Wiese:
Packet Routing: Complexity and Algorithms. WAOA 2009: 217-228 - [e2]Evripidis Bampis, Martin Skutella:
Approximation and Online Algorithms, 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers. Lecture Notes in Computer Science 5426, Springer 2009, ISBN 978-3-540-93979-5 [contents] - [i4]Martin Skutella, José Verschae:
A Robust PTAS for the Parallel Machine Covering Problem. Models and Algorithms for Optimization in Logistics 2009 - 2008
- [j22]Ronald Koch, Martin Skutella, Ines Spenke:
Maximum k -Splittable s , t -Flows. Theory Comput. Syst. 43(1): 56-66 (2008) - [j21]Fabrizio Grandoni, Volker Kaibel, Gianpaolo Oriolo, Martin Skutella:
A short proof of the VPN Tree Routing Conjecture on ring networks. Oper. Res. Lett. 36(3): 361-365 (2008) - [c35]Martin Skutella:
An Introduction to Network Flows over Time. Bonn Workshop of Combinatorial Optimization 2008: 451-482 - [c34]Maren Martens, Martin Skutella:
Flows with Unit Path Capacities and Related Packing and Covering Problems. COCOA 2008: 180-189 - [c33]Frank Neumann, Joachim Reichel, Martin Skutella:
Computing minimum cuts by randomized search heuristics. GECCO 2008: 779-786 - [p2]Katharina Skutella, Martin Skutella:
Minimale aufspannende Bäume (Wenn das Naheliegende das Beste ist... ). Taschenbuch der Algorithmen 2008: 353-360 - [e1]Christos Kaklamanis, Martin Skutella:
Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers. Lecture Notes in Computer Science 4927, Springer 2008, ISBN 978-3-540-77917-9 [contents] - 2007
- [j20]Alexander Hall, Katharina Langkau, Martin Skutella:
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. Algorithmica 47(3): 299-321 (2007) - [j19]Lisa Fleischer, Martin Skutella:
Quickest Flows Over Time. SIAM J. Comput. 36(6): 1600-1630 (2007) - [j18]Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella:
New Approaches for Virtual Private Network Design. SIAM J. Comput. 37(3): 706-721 (2007) - [j17]Alexander Hall, Steffen Hippler, Martin Skutella:
Multicommodity flows over time: Efficient algorithms and complexity. Theor. Comput. Sci. 379(3): 387-404 (2007) - [c32]Maren Martens, Fernanda Salazar, Martin Skutella:
Convex Combinations of Single Source Unsplittable Flows. ESA 2007: 395-406 - [c31]Joachim Reichel, Martin Skutella:
Evolutionary algorithms and matroid optimization problems. GECCO 2007: 947-954 - 2006
- [j16]Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella:
The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots. Algorithmica 46(2): 193-221 (2006) - [j15]Maren Martens, Martin Skutella:
Flows on few paths: Algorithms and lower bounds. Networks 48(2): 68-76 (2006) - [c30]Luca Becchetti, Peter Korteweg, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie, Andrea Vitaletti:
Latency Constrained Aggregation in Sensor Networks. ESA 2006: 88-99 - [c29]Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu:
Multiline Addressing by Network Flow. ESA 2006: 744-755 - [c28]Nadine Baumann, Martin Skutella:
Solving Evacuation Problems Efficiently--Earliest Arrival Flows with Multiple Sources. FOCS 2006: 399-410 - [c27]Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, Martin Skutella:
Length-Bounded Cuts and Flows. ICALP (1) 2006: 679-690 - [p1]Martin Skutella:
List Scheduling in Order of α-Points on a Single Machine. Efficient Approximation and Online Algorithms 2006: 250-291 - 2005
- [j14]Georg Baier, Ekkehard Köhler, Martin Skutella:
The k-Splittable Flow Problem. Algorithmica 42(3-4): 231-248 (2005) - [j13]Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella:
Approximating k-hop minimum-spanning trees. Oper. Res. Lett. 33(2): 115-120 (2005) - [j12]Martin Skutella, Marc Uetz:
Stochastic Machine Scheduling with Precedence Constraints. SIAM J. Comput. 34(4): 788-802 (2005) - [j11]Ekkehard Köhler, Martin Skutella:
Flows over Time with Load-Dependent Transit Times. SIAM J. Optim. 15(4): 1185-1202 (2005) - [c26]Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella:
New Approaches for Virtual Private Network Design. ICALP 2005: 1151-1162 - [c25]Maren Martens, Martin Skutella:
Length-Bounded and Dynamic k-Splittable Flows. OR 2005: 297-302 - [c24]Ronald Koch, Martin Skutella, Ines Spenke:
Approximation and Complexity of k-Splittable Flows. WAOA 2005: 244-257 - [i3]Nadine Baumann, Martin Skutella:
Computing earliest arrival flows with multiple sources. Algorithmic Aspects of Large and Complex Networks 2005 - [i2]Peter Sanders, Naveen Sivadasan, Martin Skutella:
Online Scheduling with Bounded Migration. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [j10]Michel X. Goemans, Martin Skutella:
Cooperative facility location games. J. Algorithms 50(2): 194-214 (2004) - [j9]Rolf H. Möhring, Martin Skutella, Frederik Stork:
Scheduling with AND/OR Precedence Constraints. SIAM J. Comput. 33(2): 393-415 (2004) - [c23]Maren Martens, Martin Skutella:
Flows on Few Paths: Algorithms and Lower Bounds. ESA 2004: 520-531 - [c22]Peter Sanders, Naveen Sivadasan, Martin Skutella:
Online Scheduling with Bounded Migration. ICALP 2004: 1111-1122 - [i1]Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella:
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots. CoRR cs.DS/0402045 (2004) - 2003
- [j8]Sándor P. Fekete, Martin Skutella, Gerhard J. Woeginger:
The complexity of economic equilibria for house allocation markets. Inf. Process. Lett. 88(5): 219-223 (2003) - [j7]Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger:
Preemptive scheduling with rejection. Math. Program. 94(2-3): 361-374 (2003) - [c21]Alexander Hall, Steffen Hippler, Martin Skutella:
Multicommodity Flows over Time: Efficient Algorithms and Complexity. ICALP 2003: 397-409 - [c20]Alexander Hall, Katharina Langkau, Martin Skutella:
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. RANDOM-APPROX 2003: 71-82 - [c19]Lisa Fleischer, Martin Skutella:
Minimum cost flows over time without intermediate storage. SODA 2003: 66-75 - 2002
- [j6]Martin Skutella:
Approximating the single source unsplittable min-cost flow problem. Math. Program. 91(3): 493-514 (2002) - [j5]Michel X. Goemans, Maurice Queyranne, Andreas S. Schulz, Martin Skutella, Yaoguang Wang:
Single Machine Scheduling with Release Dates. SIAM J. Discret. Math. 15(2): 165-192 (2002) - [j4]Andreas S. Schulz, Martin Skutella:
Scheduling Unrelated Machines by Randomized Rounding. SIAM J. Discret. Math. 15(4): 450-469 (2002) - [c18]Georg Baier, Ekkehard Köhler, Martin Skutella:
On the k-Splittable Flow Problem. ESA 2002: 101-113 - [c17]Ekkehard Köhler, Katharina Langkau, Martin Skutella:
Time-Expanded Graphs for Flow-Dependent Transit Times. ESA 2002: 599-611 - [c16]Lisa Fleischer, Martin Skutella:
The Quickest Multicommodity Flow Problem. IPCO 2002: 36-53 - [c15]Ekkehard Köhler, Martin Skutella:
Flows over time with load-dependent transit times. SODA 2002: 174-183 - [c14]Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella:
The freeze-tag problem: how to wake up a swarm of robots. SODA 2002: 568-577 - 2001
- [j3]Martin Skutella:
Convex quadratic and semidefinite programming relaxations in scheduling. J. ACM 48(2): 206-242 (2001) - [c13]Martin Skutella, Marc Uetz:
Scheduling precedence-constrained jobs with stochastic processing times on parallel machines. SODA 2001: 589-590 - 2000
- [j2]Martin Skutella, Gerhard J. Woeginger:
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines. Math. Oper. Res. 25(1): 63-75 (2000) - [c12]Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger:
Preemptive Scheduling with Rejection. ESA 2000: 268-277 - [c11]Martin Skutella:
Approximating the single source unsplittable min-cost flow problem. FOCS 2000: 136-145 - [c10]Michel X. Goemans, Martin Skutella:
Cooperative facility location games. SODA 2000: 76-85 - [c9]Rolf H. Möhring, Martin Skutella, Frederik Stork:
Forcing relations for AND/OR precedence constraints. SODA 2000: 235-236
1990 – 1999
- 1999
- [c8]Martin Skutella:
Convex Quadratic Programming Relaxations for Network Scheduling Problems. ESA 1999: 127-138 - [c7]Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko:
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. FOCS 1999: 32-44 - [c6]Martin Skutella, Gerhard J. Woeginger:
A PTAS for Minimizing the Weighted Sum of Job Completion Times on Parallel Machines. STOC 1999: 400-407 - 1998
- [j1]Martin Skutella:
Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem. Math. Oper. Res. 23(4): 909-929 (1998) - [c5]Martin Skutella:
Semidefinite Relaxations for Parallel Machine Scheduling. FOCS 1998: 472-481 - 1997
- [c4]Clemens Gröpl, Martin Skutella:
Parallel Repetition of MIP(2, 1) Systems. Lectures on Proof Verification and Approximation Algorithms 1997: 161-178 - [c3]Andreas S. Schulz, Martin Skutella:
Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria. ESA 1997: 416-429 - [c2]Andreas S. Schulz, Martin Skutella:
Random-Based Scheduling: New Approximations and LP Lower Bounds. RANDOM 1997: 119-133 - [c1]Martin Skutella:
Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem. SODA 1997: 501-508
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
