Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Krzysztof Fleszar 0001
@article{DBLP:journals/jgaa/ChaplickFLRVW23,
author = {Steven Chaplick and
Krzysztof Fleszar and
Fabian Lipp and
Alexander Ravsky and
Oleg Verbitsky and
Alexander Wolff},
title = {The Complexity of Drawing Graphs on Few Lines and Few Planes},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {6},
pages = {459--488},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00630},
doi = {10.7155/JGAA.00630},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ChaplickFLRVW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Dross0WZ23,
author = {Fran{\c{c}}ois Dross and
Krzysztof Fleszar and
Karol Wegrzycki and
Anna Zych{-}Pawlewicz},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation
and Bicolored Noncrossing Euclidean Travelling Salesman Tours},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {1433--1463},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch52},
doi = {10.1137/1.9781611977554.CH52},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Dross0WZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/EvansFKSSW22,
author = {William S. Evans and
Krzysztof Fleszar and
Philipp Kindermann and
Noushin Saeedi and
Chan{-}Su Shin and
Alexander Wolff},
title = {Minimum rectilinear polygons for given angle sequences},
journal = {Comput. Geom.},
volume = {100},
pages = {101820},
year = {2022},
url = {https://doi.org/10.1016/j.comgeo.2021.101820},
doi = {10.1016/J.COMGEO.2021.101820},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/EvansFKSSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-08904,
author = {Fran{\c{c}}ois Dross and
Krzysztof Fleszar and
Karol Wegrzycki and
Anna Zych{-}Pawlewicz},
title = {Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation
and Bicolored Noncrossing Euclidean Travelling Salesman Tours},
journal = {CoRR},
volume = {abs/2209.08904},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.08904},
doi = {10.48550/ARXIV.2209.08904},
eprinttype = {arXiv},
eprint = {2209.08904},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-08904.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/ChaplickFLRVW20,
author = {Steven Chaplick and
Krzysztof Fleszar and
Fabian Lipp and
Alexander Ravsky and
Oleg Verbitsky and
Alexander Wolff},
title = {Drawing graphs on few lines and few planes},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {433--475},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a17},
doi = {10.20382/JOCG.V11I1A17},
timestamp = {Thu, 13 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/ChaplickFLRVW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AntoniadisFHS20,
author = {Antonios Antoniadis and
Krzysztof Fleszar and
Ruben Hoeksma and
Kevin Schewior},
title = {A {PTAS} for Euclidean {TSP} with Hyperplane Neighborhoods},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {3},
pages = {38:1--38:16},
year = {2020},
url = {https://doi.org/10.1145/3383466},
doi = {10.1145/3383466},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/AntoniadisFHS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Antoniadis0HS19,
author = {Antonios Antoniadis and
Krzysztof Fleszar and
Ruben Hoeksma and
Kevin Schewior},
editor = {Timothy M. Chan},
title = {A {PTAS} for Euclidean {TSP} with Hyperplane Neighborhoods},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1089--1105},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.67},
doi = {10.1137/1.9781611975482.67},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/Antoniadis0HS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Fleszar18,
author = {Krzysztof Fleszar},
title = {Network-Design Problems in Graphs and on the Plane},
school = {Julius Maximilians University W{\"{u}}rzburg, Germany},
year = {2018},
url = {https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/15490},
urn = {urn:nbn:de:bvb:20-opus-154904},
isbn = {978-3-95826-076-4},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/dnb/Fleszar18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DasFKSVW18,
author = {Aparna Das and
Krzysztof Fleszar and
Stephen G. Kobourov and
Joachim Spoerhase and
Sankar Veeramoni and
Alexander Wolff},
title = {Approximating the Generalized Minimum Manhattan Network Problem},
journal = {Algorithmica},
volume = {80},
number = {4},
pages = {1170--1190},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0298-0},
doi = {10.1007/S00453-017-0298-0},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DasFKSVW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FleszarMS18,
author = {Krzysztof Fleszar and
Matthias Mnich and
Joachim Spoerhase},
title = {New algorithms for maximum disjoint paths based on tree-likeness},
journal = {Math. Program.},
volume = {171},
number = {1-2},
pages = {433--461},
year = {2018},
url = {https://doi.org/10.1007/s10107-017-1199-3},
doi = {10.1007/S10107-017-1199-3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/FleszarMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChanD0SW18,
author = {Timothy M. Chan and
Thomas C. van Dijk and
Krzysztof Fleszar and
Joachim Spoerhase and
Alexander Wolff},
editor = {Wen{-}Lian Hsu and
Der{-}Tsai Lee and
Chung{-}Shou Liao},
title = {Stabbing Rectangles by Line Segments - How Decomposition Reduces the
Shallow-Cell Complexity},
booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC}
2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan},
series = {LIPIcs},
volume = {123},
pages = {61:1--61:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.61},
doi = {10.4230/LIPICS.ISAAC.2018.61},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/ChanD0SW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-03953,
author = {Antonios Antoniadis and
Krzysztof Fleszar and
Ruben Hoeksma and
Kevin Schewior},
title = {A {PTAS} for Euclidean {TSP} with Hyperplane Neighborhoods},
journal = {CoRR},
volume = {abs/1804.03953},
year = {2018},
url = {http://arxiv.org/abs/1804.03953},
eprinttype = {arXiv},
eprint = {1804.03953},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-03953.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-02851,
author = {Timothy M. Chan and
Thomas C. van Dijk and
Krzysztof Fleszar and
Joachim Spoerhase and
Alexander Wolff},
title = {Stabbing Rectangles by Line Segments - How Decomposition Reduces the
Shallow-Cell Complexity},
journal = {CoRR},
volume = {abs/1806.02851},
year = {2018},
url = {http://arxiv.org/abs/1806.02851},
eprinttype = {arXiv},
eprint = {1806.02851},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-02851.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ChaplickFLRVW17,
author = {Steven Chaplick and
Krzysztof Fleszar and
Fabian Lipp and
Alexander Ravsky and
Oleg Verbitsky and
Alexander Wolff},
editor = {Faith Ellen and
Antonina Kolokolova and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {The Complexity of Drawing Graphs on Few Lines and Few Planes},
booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS}
2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10389},
pages = {265--276},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62127-2\_23},
doi = {10.1007/978-3-319-62127-2\_23},
timestamp = {Thu, 13 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/ChaplickFLRVW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FleszarMS16,
author = {Krzysztof Fleszar and
Matthias Mnich and
Joachim Spoerhase},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {42:1--42:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.42},
doi = {10.4230/LIPICS.ESA.2016.42},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/FleszarMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/ChaplickFLRVW16,
author = {Steven Chaplick and
Krzysztof Fleszar and
Fabian Lipp and
Alexander Ravsky and
Oleg Verbitsky and
Alexander Wolff},
editor = {Yifan Hu and
Martin N{\"{o}}llenburg},
title = {Drawing Graphs on Few Lines and Few Planes},
booktitle = {Graph Drawing and Network Visualization - 24th International Symposium,
{GD} 2016, Athens, Greece, September 19-21, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9801},
pages = {166--180},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-50106-2\_14},
doi = {10.1007/978-3-319-50106-2\_14},
timestamp = {Sat, 17 Dec 2022 21:30:20 +0100},
biburl = {https://dblp.org/rec/conf/gd/ChaplickFLRVW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FleszarMS16,
author = {Krzysztof Fleszar and
Matthias Mnich and
Joachim Spoerhase},
title = {New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness},
journal = {CoRR},
volume = {abs/1603.01740},
year = {2016},
url = {http://arxiv.org/abs/1603.01740},
eprinttype = {arXiv},
eprint = {1603.01740},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FleszarMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EvansFKSSW16,
author = {William S. Evans and
Krzysztof Fleszar and
Philipp Kindermann and
Noushin Saeedi and
Chan{-}Su Shin and
Alexander Wolff},
title = {Minimum Rectilinear Polygons for Given Angle Sequences},
journal = {CoRR},
volume = {abs/1606.06940},
year = {2016},
url = {http://arxiv.org/abs/1606.06940},
eprinttype = {arXiv},
eprint = {1606.06940},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EvansFKSSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChaplickFLRVW16,
author = {Steven Chaplick and
Krzysztof Fleszar and
Fabian Lipp and
Alexander Ravsky and
Oleg Verbitsky and
Alexander Wolff},
title = {Drawing Graphs on Few Lines and Few Planes},
journal = {CoRR},
volume = {abs/1607.01196},
year = {2016},
url = {http://arxiv.org/abs/1607.01196},
eprinttype = {arXiv},
eprint = {1607.01196},
timestamp = {Thu, 13 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChaplickFLRVW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChaplickFLRVW16a,
author = {Steven Chaplick and
Krzysztof Fleszar and
Fabian Lipp and
Alexander Ravsky and
Oleg Verbitsky and
Alexander Wolff},
title = {The Complexity of Drawing Graphs on Few Lines and Few Planes},
journal = {CoRR},
volume = {abs/1607.06444},
year = {2016},
url = {http://arxiv.org/abs/1607.06444},
eprinttype = {arXiv},
eprint = {1607.06444},
timestamp = {Thu, 13 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChaplickFLRVW16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BeregFKPSW15,
author = {Sergey Bereg and
Krzysztof Fleszar and
Philipp Kindermann and
Sergey Pupyrev and
Joachim Spoerhase and
Alexander Wolff},
editor = {Khaled M. Elbassioni and
Kazuhisa Makino},
title = {Colored Non-crossing Euclidean Steiner Forest},
booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC}
2015, Nagoya, Japan, December 9-11, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9472},
pages = {429--441},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48971-0\_37},
doi = {10.1007/978-3-662-48971-0\_37},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BeregFKPSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jcdcg/EvansFKSSW15,
author = {William S. Evans and
Krzysztof Fleszar and
Philipp Kindermann and
Noushin Saeedi and
Chan{-}Su Shin and
Alexander Wolff},
editor = {Jin Akiyama and
Hiro Ito and
Toshinori Sakai and
Yushi Uno},
title = {Minimum Rectilinear Polygons for Given Angle Sequences},
booktitle = {Discrete and Computational Geometry and Graphs - 18th Japan Conference,
{JCDCGG} 2015, Kyoto, Japan, September 14-16, 2015, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9943},
pages = {105--119},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-48532-4\_10},
doi = {10.1007/978-3-319-48532-4\_10},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/jcdcg/EvansFKSSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ByrkaFRS15,
author = {Jaroslaw Byrka and
Krzysztof Fleszar and
Bartosz Rybicki and
Joachim Spoerhase},
editor = {Piotr Indyk},
title = {Bi-Factor Approximation Algorithms for Hard Capacitated \emph{k}-Median
Problems},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {722--736},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.49},
doi = {10.1137/1.9781611973730.49},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/ByrkaFRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BeregFKPSW15,
author = {Sergey Bereg and
Krzysztof Fleszar and
Philipp Kindermann and
Sergey Pupyrev and
Joachim Spoerhase and
Alexander Wolff},
title = {Colored Non-Crossing Euclidean Steiner Forest},
journal = {CoRR},
volume = {abs/1509.05681},
year = {2015},
url = {http://arxiv.org/abs/1509.05681},
eprinttype = {arXiv},
eprint = {1509.05681},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BeregFKPSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gis/DijkFHS13,
author = {Thomas C. van Dijk and
Krzysztof Fleszar and
Jan{-}Henrik Haunert and
Joachim Spoerhase},
editor = {Holger Fritze},
title = {Road segment selection with strokes and stability},
booktitle = {MapInteract 2013, Proceedings of the 1st {ACM} {SIGSPATIAL} International
Workshop on MapInteraction, November 5th, 2013, Orlando, Florida,
{USA}},
pages = {72--77},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2534931.2534936},
doi = {10.1145/2534931.2534936},
timestamp = {Sat, 24 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gis/DijkFHS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DasFKSVW13,
author = {Aparna Das and
Krzysztof Fleszar and
Stephen G. Kobourov and
Joachim Spoerhase and
Sankar Veeramoni and
Alexander Wolff},
editor = {Leizhen Cai and
Siu{-}Wing Cheng and
Tak Wah Lam},
title = {Approximating the Generalized Minimum Manhattan Network Problem},
booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC}
2013, Hong Kong, China, December 16-18, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8283},
pages = {722--732},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45030-3\_67},
doi = {10.1007/978-3-642-45030-3\_67},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/DasFKSVW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ByrkaFRS13,
author = {Jaroslaw Byrka and
Krzysztof Fleszar and
Bartosz Rybicki and
Joachim Spoerhase},
title = {A Constant-Factor Approximation Algorithm for Uniform Hard Capacitated
{\textdollar}k{\textdollar}-Median},
journal = {CoRR},
volume = {abs/1312.6550},
year = {2013},
url = {http://arxiv.org/abs/1312.6550},
eprinttype = {arXiv},
eprint = {1312.6550},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ByrkaFRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/FleszarGLRW12,
author = {Krzysztof Fleszar and
Christian Gla{\ss}er and
Fabian Lipp and
Christian Reitwie{\ss}ner and
Maximilian Witek},
editor = {David Fern{\'{a}}ndez{-}Baca},
title = {Structural Complexity of Multiobjective {NP} Search Problems},
booktitle = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
Arequipa, Peru, April 16-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7256},
pages = {338--349},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29344-3\_29},
doi = {10.1007/978-3-642-29344-3\_29},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/FleszarGLRW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-6481,
author = {Aparna Das and
Krzysztof Fleszar and
Stephen G. Kobourov and
Joachim Spoerhase and
Sankar Veeramoni and
Alexander Wolff},
title = {Polylogarithmic Approximation for Generalized Minimum Manhattan Networks},
journal = {CoRR},
volume = {abs/1203.6481},
year = {2012},
url = {http://arxiv.org/abs/1203.6481},
eprinttype = {arXiv},
eprint = {1203.6481},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1203-6481.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FleszarGLRW11,
author = {Krzysztof Fleszar and
Christian Gla{\ss}er and
Fabian Lipp and
Christian Reitwie{\ss}ner and
Maximilian Witek},
title = {The Complexity of Solving Multiobjective Optimization Problems and
its Relation to Multivalued Functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-053}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/053},
eprinttype = {ECCC},
eprint = {TR11-053},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FleszarGLRW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 01:33 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:
