default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Vangelis Th. Paschos
@article{DBLP:journals/dam/DenatHMP24,
author = {Tom Denat and
Ararat Harutyunyan and
Nikolaos Melissinos and
Vangelis Th. Paschos},
title = {Average-case complexity of a branch-and-bound algorithm for Min Dominating
Set},
journal = {Discret. Appl. Math.},
volume = {345},
pages = {4--8},
year = {2024},
url = {https://doi.org/10.1016/j.dam.2023.11.021},
doi = {10.1016/J.DAM.2023.11.021},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DenatHMP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KatsikarelisLP23,
author = {Ioannis Katsikarelis and
Michael Lampis and
Vangelis Th. Paschos},
title = {Improved (In-)Approximability Bounds for d-Scattered Set},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {3},
pages = {219--238},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00621},
doi = {10.7155/JGAA.00621},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/KatsikarelisLP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KatsikarelisLP22,
author = {Ioannis Katsikarelis and
Michael Lampis and
Vangelis Th. Paschos},
title = {Structurally parameterized d-scattered set},
journal = {Discret. Appl. Math.},
volume = {308},
pages = {168--186},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2020.03.052},
doi = {10.1016/J.DAM.2020.03.052},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KatsikarelisLP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EscoffierGP22,
author = {Bruno Escoffier and
Laurent Gourv{\`{e}}s and
Vangelis Th. Paschos},
title = {In memory of J{\'{e}}r{\^{o}}me Monnot},
journal = {Theor. Comput. Sci.},
volume = {921},
pages = {1--3},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.01.045},
doi = {10.1016/J.TCS.2022.01.045},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/EscoffierGP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DubloisLP22,
author = {Louis Dublois and
Michael Lampis and
Vangelis Th. Paschos},
title = {Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential
approximation},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {271--291},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.013},
doi = {10.1016/J.TCS.2022.05.013},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DubloisLP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/DubloisLP21,
author = {Louis Dublois and
Michael Lampis and
Vangelis Th. Paschos},
title = {New Algorithms for Mixed Dominating Set},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {23},
number = {1},
year = {2021},
url = {https://doi.org/10.46298/dmtcs.6824},
doi = {10.46298/DMTCS.6824},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/DubloisLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DubloisLP21,
author = {Louis Dublois and
Michael Lampis and
Vangelis Th. Paschos},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential
Approximation},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {202--215},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_14},
doi = {10.1007/978-3-030-75242-2\_14},
timestamp = {Thu, 06 May 2021 09:40:55 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DubloisLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/BoriaGPM21,
author = {Nicolas Boria and
Laurent Gourv{\`{e}}s and
Vangelis Th. Paschos and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Alessandra Carbone and
Mohammed El{-}Kebir},
title = {The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet},
booktitle = {21st International Workshop on Algorithms in Bioinformatics, {WABI}
2021, August 2-4, 2021, Virtual Conference},
series = {LIPIcs},
volume = {201},
pages = {5:1--5:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.WABI.2021.5},
doi = {10.4230/LIPICS.WABI.2021.5},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/wabi/BoriaGPM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-07550,
author = {Louis Dublois and
Michael Lampis and
Vangelis Th. Paschos},
title = {Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential
Approximation},
journal = {CoRR},
volume = {abs/2101.07550},
year = {2021},
url = {https://arxiv.org/abs/2101.07550},
eprinttype = {arXiv},
eprint = {2101.07550},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-07550.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/DubloisLP20,
author = {Louis Dublois and
Michael Lampis and
Vangelis Th. Paschos},
editor = {Yixin Cao and
Marcin Pilipczuk},
title = {New Algorithms for Mixed Dominating Set},
booktitle = {15th International Symposium on Parameterized and Exact Computation,
{IPEC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {180},
pages = {9:1--9:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2020.9},
doi = {10.4230/LIPICS.IPEC.2020.9},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/DubloisLP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KatsikarelisLP19,
author = {Ioannis Katsikarelis and
Michael Lampis and
Vangelis Th. Paschos},
title = {Structural parameters, tight bounds, and approximation for (k, r)-center},
journal = {Discret. Appl. Math.},
volume = {264},
pages = {90--117},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.11.002},
doi = {10.1016/J.DAM.2018.11.002},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KatsikarelisLP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FotakisPP19,
author = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Preface to Special Issue on Algorithms and Complexity},
journal = {Theor. Comput. Sci.},
volume = {754},
pages = {1--2},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.11.011},
doi = {10.1016/J.TCS.2018.11.011},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FotakisPP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/KatsikarelisLP19,
author = {Ioannis Katsikarelis and
Michael Lampis and
Vangelis Th. Paschos},
editor = {Evripidis Bampis and
Nicole Megow},
title = {Improved (In-)Approximability Bounds for d-Scattered Set},
booktitle = {Approximation and Online Algorithms - 17th International Workshop,
{WAOA} 2019, Munich, Germany, September 12-13, 2019, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11926},
pages = {202--216},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-39479-0\_14},
doi = {10.1007/978-3-030-39479-0\_14},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/KatsikarelisLP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-01874,
author = {Tom Denat and
Ararat Harutyunyan and
Vangelis Th. Paschos},
title = {Average-case complexity of a branch-and-bound algorithm for min dominating
set},
journal = {CoRR},
volume = {abs/1902.01874},
year = {2019},
url = {http://arxiv.org/abs/1902.01874},
eprinttype = {arXiv},
eprint = {1902.01874},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-01874.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-08435,
author = {Vangelis Th. Paschos},
title = {A polynomial time approximation schema for maximum k-vertex cover
in bipartite graphs},
journal = {CoRR},
volume = {abs/1909.08435},
year = {2019},
url = {http://arxiv.org/abs/1909.08435},
eprinttype = {arXiv},
eprint = {1909.08435},
timestamp = {Tue, 24 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-08435.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-05589,
author = {Ioannis Katsikarelis and
Michael Lampis and
Vangelis Th. Paschos},
title = {Improved (In-)Approximability Bounds for d-Scattered Set},
journal = {CoRR},
volume = {abs/1910.05589},
year = {2019},
url = {http://arxiv.org/abs/1910.05589},
eprinttype = {arXiv},
eprint = {1910.05589},
timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-05589.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-08964,
author = {Louis Dublois and
Michael Lampis and
Vangelis Th. Paschos},
title = {New Algorithms for Mixed Dominating Set},
journal = {CoRR},
volume = {abs/1911.08964},
year = {2019},
url = {http://arxiv.org/abs/1911.08964},
eprinttype = {arXiv},
eprint = {1911.08964},
timestamp = {Tue, 03 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-08964.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/BonnetP18,
author = {{\'{E}}douard Bonnet and
Vangelis Th. Paschos},
title = {Sparsification and subexponential approximation},
journal = {Acta Informatica},
volume = {55},
number = {1},
pages = {1--15},
year = {2018},
url = {https://doi.org/10.1007/s00236-016-0281-2},
doi = {10.1007/S00236-016-0281-2},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/BonnetP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/Paschos18,
author = {Vangelis Th. Paschos},
title = {When polynomial approximation meets exact computation},
journal = {Ann. Oper. Res.},
volume = {271},
number = {1},
pages = {87--103},
year = {2018},
url = {https://doi.org/10.1007/s10479-018-2986-9},
doi = {10.1007/S10479-018-2986-9},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/Paschos18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BoriaMP18,
author = {Nicolas Boria and
C{\'{e}}cile Murat and
Vangelis Th. Paschos},
title = {The probabilistic minimum dominating set problem},
journal = {Discret. Appl. Math.},
volume = {234},
pages = {93--113},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2016.10.016},
doi = {10.1016/J.DAM.2016.10.016},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BoriaMP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/BonnetEPS18,
author = {{\'{E}}douard Bonnet and
Bruno Escoffier and
Vangelis Th. Paschos and
Georgios Stamoulis},
title = {Purely combinatorial approximation algorithms for maximum k-vertex
cover in bipartite graphs},
journal = {Discret. Optim.},
volume = {27},
pages = {26--56},
year = {2018},
url = {https://doi.org/10.1016/j.disopt.2017.09.001},
doi = {10.1016/J.DISOPT.2017.09.001},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/BonnetEPS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BonnetLP18,
author = {{\'{E}}douard Bonnet and
Michael Lampis and
Vangelis Th. Paschos},
title = {Time-approximation trade-offs for inapproximable problems},
journal = {J. Comput. Syst. Sci.},
volume = {92},
pages = {171--180},
year = {2018},
url = {https://doi.org/10.1016/j.jcss.2017.09.009},
doi = {10.1016/J.JCSS.2017.09.009},
timestamp = {Tue, 28 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BonnetLP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/Paschos18,
author = {Vangelis Th. Paschos},
title = {Combinatorial approximation of maximum \emph{k}-vertex cover in bipartite
graphs within ratio 0.7},
journal = {{RAIRO} Oper. Res.},
volume = {52},
number = {1},
pages = {305--314},
year = {2018},
url = {https://doi.org/10.1051/ro/2017085},
doi = {10.1051/RO/2017085},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/Paschos18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BazganBCFJKLLMP18,
author = {Cristina Bazgan and
Ljiljana Brankovic and
Katrin Casel and
Henning Fernau and
Klaus Jansen and
Kim{-}Manuel Klein and
Michael Lampis and
Mathieu Liedloff and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {The many facets of upper domination},
journal = {Theor. Comput. Sci.},
volume = {717},
pages = {2--25},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.05.042},
doi = {10.1016/J.TCS.2017.05.042},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BazganBCFJKLLMP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BampisELP18,
author = {Evripidis Bampis and
Bruno Escoffier and
Michael Lampis and
Vangelis Th. Paschos},
editor = {David Eppstein},
title = {Multistage Matchings},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {7:1--7:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.7},
doi = {10.4230/LIPICS.SWAT.2018.7},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BampisELP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KatsikarelisLP18,
author = {Ioannis Katsikarelis and
Michael Lampis and
Vangelis Th. Paschos},
editor = {Andreas Brandst{\"{a}}dt and
Ekkehard K{\"{o}}hler and
Klaus Meer},
title = {Structurally Parameterized d-Scattered Set},
booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International
Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11159},
pages = {292--305},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00256-5\_24},
doi = {10.1007/978-3-030-00256-5\_24},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/KatsikarelisLP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/tf/18/AusielloP18,
author = {Giorgio Ausiello and
Vangelis Th. Paschos},
editor = {Teofilo F. Gonzalez},
title = {Reductions That Preserve Approximability},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics, Second Edition,
Volume 1: Methologies and Traditional Applications},
pages = {243--258},
publisher = {Chapman and Hall/CRC},
year = {2018},
url = {https://doi.org/10.1201/9781351236423-14},
doi = {10.1201/9781351236423-14},
timestamp = {Mon, 28 Oct 2019 16:49:19 +0100},
biburl = {https://dblp.org/rec/books/tf/18/AusielloP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/tf/18/AusielloP18a,
author = {Giorgio Ausiello and
Vangelis Th. Paschos},
editor = {Teofilo F. Gonzalez},
title = {Differential Ratio Approximation},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics, Second Edition,
Volume 1: Methologies and Traditional Applications},
pages = {259--274},
publisher = {Chapman and Hall/CRC},
year = {2018},
url = {https://doi.org/10.1201/9781351236423-15},
doi = {10.1201/9781351236423-15},
timestamp = {Fri, 25 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/tf/18/AusielloP18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BourgeoisGLMP17,
author = {Nicolas Bourgeois and
Aristotelis Giannakos and
Giorgio Lucarelli and
Ioannis Milis and
Vangelis Th. Paschos},
title = {Exact and superpolynomial approximation algorithms for the densest
k-subgraph problem},
journal = {Eur. J. Oper. Res.},
volume = {262},
number = {3},
pages = {894--903},
year = {2017},
url = {https://doi.org/10.1016/j.ejor.2017.04.034},
doi = {10.1016/J.EJOR.2017.04.034},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BourgeoisGLMP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/BonnetP17,
author = {{\'{E}}douard Bonnet and
Vangelis Th. Paschos},
title = {Dual parameterization and parameterized approximability of subset
graph problems},
journal = {{RAIRO} Oper. Res.},
volume = {51},
number = {1},
pages = {261--266},
year = {2017},
url = {https://doi.org/10.1051/ro/2016018},
doi = {10.1051/RO/2016018},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/BonnetP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KatsikarelisLP17,
author = {Ioannis Katsikarelis and
Michael Lampis and
Vangelis Th. Paschos},
editor = {Yoshio Okamoto and
Takeshi Tokuyama},
title = {Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center},
booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC}
2017, December 9-12, 2017, Phuket, Thailand},
series = {LIPIcs},
volume = {92},
pages = {50:1--50:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.50},
doi = {10.4230/LIPICS.ISAAC.2017.50},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/isaac/KatsikarelisLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/2017,
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5},
doi = {10.1007/978-3-319-57586-5},
isbn = {978-3-319-57585-8},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/2017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KatsikarelisLP17,
author = {Ioannis Katsikarelis and
Michael Lampis and
Vangelis Th. Paschos},
title = {Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center},
journal = {CoRR},
volume = {abs/1704.08868},
year = {2017},
url = {http://arxiv.org/abs/1704.08868},
eprinttype = {arXiv},
eprint = {1704.08868},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KatsikarelisLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-02180,
author = {Ioannis Katsikarelis and
Michael Lampis and
Vangelis Th. Paschos},
title = {Structurally Parameterized {\textdollar}d{\textdollar}-Scattered Set},
journal = {CoRR},
volume = {abs/1709.02180},
year = {2017},
url = {http://arxiv.org/abs/1709.02180},
eprinttype = {arXiv},
eprint = {1709.02180},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-02180.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/BonnetPS16,
author = {{\'{E}}douard Bonnet and
Vangelis Th. Paschos and
Florian Sikora},
title = {Parameterized exact and approximation algorithms for maximum \emph{k}-set
cover and related satisfiability problems},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {50},
number = {3},
pages = {227--240},
year = {2016},
url = {https://doi.org/10.1051/ita/2016022},
doi = {10.1051/ITA/2016022},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/BonnetPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/EscoffierPT16,
author = {Bruno Escoffier and
Vangelis Th. Paschos and
Emeric Tourniaire},
title = {Super-polynomial approximation branching algorithms},
journal = {{RAIRO} Oper. Res.},
volume = {50},
number = {4-5},
pages = {979--994},
year = {2016},
url = {https://doi.org/10.1051/ro/2015060},
doi = {10.1051/RO/2015060},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/EscoffierPT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/BazganBCFJKLLMP16,
author = {Cristina Bazgan and
Ljiljana Brankovic and
Katrin Casel and
Henning Fernau and
Klaus Jansen and
Kim{-}Manuel Klein and
Michael Lampis and
Mathieu Liedloff and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Riccardo Dondi and
Guillaume Fertin and
Giancarlo Mauri},
title = {Algorithmic Aspects of Upper Domination: {A} Parameterised Perspective},
booktitle = {Algorithmic Aspects in Information and Management - 11th International
Conference, {AAIM} 2016, Bergamo, Italy, July 18-20, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9778},
pages = {113--124},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-41168-2\_10},
doi = {10.1007/978-3-319-41168-2\_10},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aaim/BazganBCFJKLLMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BazganBCFJKLLMP16,
author = {Cristina Bazgan and
Ljiljana Brankovic and
Katrin Casel and
Henning Fernau and
Klaus Jansen and
Kim{-}Manuel Klein and
Michael Lampis and
Mathieu Liedloff and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Veli M{\"{a}}kinen and
Simon J. Puglisi and
Leena Salmela},
title = {Upper Domination: Complexity and Approximation},
booktitle = {Combinatorial Algorithms - 27th International Workshop, {IWOCA} 2016,
Helsinki, Finland, August 17-19, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9843},
pages = {241--252},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-44543-4\_19},
doi = {10.1007/978-3-319-44543-4\_19},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwoca/BazganBCFJKLLMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BonnetEPS16,
author = {{\'{E}}douard Bonnet and
Bruno Escoffier and
Vangelis Th. Paschos and
Georgios Stamoulis},
editor = {Evangelos Kranakis and
Gonzalo Navarro and
Edgar Ch{\'{a}}vez},
title = {A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex
Cover in Bipartite Graphs},
booktitle = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium,
Ensenada, Mexico, April 11-15, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9644},
pages = {235--248},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49529-2\_18},
doi = {10.1007/978-3-662-49529-2\_18},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/latin/BonnetEPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BonnetLP16,
author = {{\'{E}}douard Bonnet and
Michael Lampis and
Vangelis Th. Paschos},
editor = {Nicolas Ollinger and
Heribert Vollmer},
title = {Time-Approximation Trade-offs for Inapproximable Problems},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
2016, February 17-20, 2016, Orl{\'{e}}ans, France},
series = {LIPIcs},
volume = {47},
pages = {22:1--22:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.STACS.2016.22},
doi = {10.4230/LIPICS.STACS.2016.22},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BonnetLP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FotakisLP16,
author = {Dimitris Fotakis and
Michael Lampis and
Vangelis Th. Paschos},
editor = {Nicolas Ollinger and
Heribert Vollmer},
title = {Sub-exponential Approximation Schemes for CSPs: From Dense to Almost
Sparse},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
2016, February 17-20, 2016, Orl{\'{e}}ans, France},
series = {LIPIcs},
volume = {47},
pages = {37:1--37:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.STACS.2016.37},
doi = {10.4230/LIPICS.STACS.2016.37},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/FotakisLP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/Paschos15,
author = {Vangelis Th. Paschos},
title = {When polynomial approximation meets exact computation},
journal = {4OR},
volume = {13},
number = {3},
pages = {227--245},
year = {2015},
url = {https://doi.org/10.1007/s10288-015-0294-7},
doi = {10.1007/S10288-015-0294-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/4or/Paschos15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonnetE0P15,
author = {Edouard Bonnet and
Bruno Escoffier and
Eun Jung Kim and
Vangelis Th. Paschos},
title = {On Subexponential and FPT-Time Inapproximability},
journal = {Algorithmica},
volume = {71},
number = {3},
pages = {541--565},
year = {2015},
url = {https://doi.org/10.1007/s00453-014-9889-1},
doi = {10.1007/S00453-014-9889-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BonnetE0P15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonnetEPT15,
author = {Edouard Bonnet and
Bruno Escoffier and
Vangelis Th. Paschos and
Emeric Tourniaire},
title = {Multi-parameter Analysis for Local Graph Partitioning Problems: Using
Greediness for Parameterization},
journal = {Algorithmica},
volume = {71},
number = {3},
pages = {566--580},
year = {2015},
url = {https://doi.org/10.1007/s00453-014-9920-6},
doi = {10.1007/S00453-014-9920-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BonnetEPT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BoriaCP15,
author = {Nicolas Boria and
Federico Della Croce and
Vangelis Th. Paschos},
title = {On the max min vertex cover problem},
journal = {Discret. Appl. Math.},
volume = {196},
pages = {62--71},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2014.06.001},
doi = {10.1016/J.DAM.2014.06.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BoriaCP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/EscoffierMPX15,
author = {Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Mingyu Xiao},
title = {New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability
of Edge Dominating Set},
journal = {Theory Comput. Syst.},
volume = {56},
number = {2},
pages = {330--346},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9549-5},
doi = {10.1007/S00224-014-9549-5},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/EscoffierMPX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/2015,
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8},
doi = {10.1007/978-3-319-18173-8},
isbn = {978-3-319-18172-1},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/2015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BonnetLP15,
author = {Edouard Bonnet and
Michael Lampis and
Vangelis Th. Paschos},
title = {Time-Approximation Trade-offs for Inapproximable Problems},
journal = {CoRR},
volume = {abs/1502.05828},
year = {2015},
url = {http://arxiv.org/abs/1502.05828},
eprinttype = {arXiv},
eprint = {1502.05828},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonnetLP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Paschos15,
author = {Vangelis Th. Paschos},
title = {Combinatorial approximation of maximum k-vertex cover in bipartite
graphs within ratio{\textasciitilde}0.7},
journal = {CoRR},
volume = {abs/1502.07930},
year = {2015},
url = {http://arxiv.org/abs/1502.07930},
eprinttype = {arXiv},
eprint = {1502.07930},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Paschos15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BourgeoisCDP15,
author = {Nicolas Bourgeois and
R. Catellier and
Tom Denat and
Vangelis Th. Paschos},
title = {Average-case complexity of a branch-and-bound algorithm for maximum
independent set, under the {\textdollar}{\textbackslash}mathcal\{G\}(n,
p){\textdollar} random model},
journal = {CoRR},
volume = {abs/1505.04969},
year = {2015},
url = {http://arxiv.org/abs/1505.04969},
eprinttype = {arXiv},
eprint = {1505.04969},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BourgeoisCDP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BazganBCFJLLMP15,
author = {Cristina Bazgan and
Ljiljana Brankovic and
Katrin Casel and
Henning Fernau and
Klaus Jansen and
Michael Lampis and
Mathieu Liedloff and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {Algorithmic Aspects of Upper Domination},
journal = {CoRR},
volume = {abs/1506.07260},
year = {2015},
url = {http://arxiv.org/abs/1506.07260},
eprinttype = {arXiv},
eprint = {1506.07260},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BazganBCFJLLMP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FotakisLP15,
author = {Dimitris Fotakis and
Michael Lampis and
Vangelis Th. Paschos},
title = {Sub-exponential Approximation Schemes for CSPs: from Dense to Almost
Sparse},
journal = {CoRR},
volume = {abs/1507.04391},
year = {2015},
url = {http://arxiv.org/abs/1507.04391},
eprinttype = {arXiv},
eprint = {1507.04391},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/FotakisLP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CroceP14,
author = {Federico Della Croce and
Vangelis Th. Paschos},
title = {Efficient algorithms for the max k-vertex cover problem},
journal = {J. Comb. Optim.},
volume = {28},
number = {3},
pages = {674--691},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9575-7},
doi = {10.1007/S10878-012-9575-7},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CroceP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BonnetP14,
author = {Edouard Bonnet and
Vangelis Th. Paschos},
title = {Parameterized (in)approximability of subset problems},
journal = {Oper. Res. Lett.},
volume = {42},
number = {3},
pages = {222--225},
year = {2014},
url = {https://doi.org/10.1016/j.orl.2014.03.005},
doi = {10.1016/J.ORL.2014.03.005},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BonnetP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MarkakisMP14,
author = {Vangelis Markakis and
Ioannis Milis and
Vangelis Th. Paschos},
title = {Special Issue: "Combinatorial Optimization: Theory of Algorithms
and Complexity"},
journal = {Theor. Comput. Sci.},
volume = {540},
pages = {1},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.05.015},
doi = {10.1016/J.TCS.2014.05.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MarkakisMP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EscoffierPT14,
author = {Bruno Escoffier and
Vangelis Th. Paschos and
Emeric Tourniaire},
title = {Approximating {MAX} {SAT} by moderately exponential and parameterized
algorithms},
journal = {Theor. Comput. Sci.},
volume = {560},
pages = {147--157},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.10.039},
doi = {10.1016/J.TCS.2014.10.039},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EscoffierPT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iscopt/2014,
editor = {Pierre Fouilhoux and
Luis Eduardo Neves Gouveia and
Ali Ridha Mahjoub and
Vangelis Th. Paschos},
title = {Combinatorial Optimization - Third International Symposium, {ISCO}
2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8596},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-09174-7},
doi = {10.1007/978-3-319-09174-7},
isbn = {978-3-319-09173-0},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/2014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BonnetP14,
author = {Edouard Bonnet and
Vangelis Th. Paschos},
title = {Sparsification and subexponential approximation},
journal = {CoRR},
volume = {abs/1402.2843},
year = {2014},
url = {http://arxiv.org/abs/1402.2843},
eprinttype = {arXiv},
eprint = {1402.2843},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonnetP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BonnetEPS14,
author = {Edouard Bonnet and
Bruno Escoffier and
Vangelis Th. Paschos and
Georgios Stamoulis},
title = {On the approximation of maximum {\textdollar}k{\textdollar}-vertex
cover in bipartite graphs},
journal = {CoRR},
volume = {abs/1409.6952},
year = {2014},
url = {http://arxiv.org/abs/1409.6952},
eprinttype = {arXiv},
eprint = {1409.6952},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonnetEPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BourgeoisCEP13,
author = {Nicolas Bourgeois and
Federico Della Croce and
Bruno Escoffier and
Vangelis Th. Paschos},
title = {Fast algorithms for min independent dominating set},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {558--572},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.01.003},
doi = {10.1016/J.DAM.2012.01.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BourgeoisCEP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/KacemP13,
author = {Imed Kacem and
Vangelis Th. Paschos},
title = {Weighted completion time minimization on a single-machine with a fixed
non-availability interval: Differential approximability},
journal = {Discret. Optim.},
volume = {10},
number = {1},
pages = {61--68},
year = {2013},
url = {https://doi.org/10.1016/j.disopt.2012.11.002},
doi = {10.1016/J.DISOPT.2012.11.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/KacemP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/BoriaMP13,
author = {Nicolas Boria and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {Reoptimization under Vertex Insertion: Max P\({}_{\mbox{K}}\)-Free
Subgraph and Max Planar Subgraph},
journal = {Discret. Math. Algorithms Appl.},
volume = {5},
number = {2},
year = {2013},
url = {https://doi.org/10.1142/S1793830913600045},
doi = {10.1142/S1793830913600045},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/BoriaMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BoriaBEP13,
author = {Nicolas Boria and
Nicolas Bourgeois and
Bruno Escoffier and
Vangelis Th. Paschos},
title = {Exponential approximation schemata for some network design problems},
journal = {J. Discrete Algorithms},
volume = {22},
pages = {43--52},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.06.011},
doi = {10.1016/J.JDA.2013.06.011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BoriaBEP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Paschos13,
author = {Vangelis Th. Paschos},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {511},
pages = {1},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.10.018},
doi = {10.1016/J.TCS.2013.10.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Paschos13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoriaMP13,
author = {Nicolas Boria and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {Reoptimization of maximum weight induced hereditary subgraph problems},
journal = {Theor. Comput. Sci.},
volume = {514},
pages = {61--74},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.10.037},
doi = {10.1016/J.TCS.2012.10.037},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BoriaMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BoriaMP13,
author = {Nicolas Boria and
C{\'{e}}cile Murat and
Vangelis Th. Paschos},
editor = {Andrei A. Bulatov and
Arseny M. Shur},
title = {The Probabilistic Min Dominating Set Problem},
booktitle = {Computer Science - Theory and Applications - 8th International Computer
Science Symposium in Russia, {CSR} 2013, Ekaterinburg, Russia, June
25-29, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7913},
pages = {298--309},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38536-0\_26},
doi = {10.1007/978-3-642-38536-0\_26},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/BoriaMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BonnetE0P13,
author = {Edouard Bonnet and
Bruno Escoffier and
Eun Jung Kim and
Vangelis Th. Paschos},
editor = {Gregory Z. Gutin and
Stefan Szeider},
title = {On Subexponential and FPT-Time Inapproximability},
booktitle = {Parameterized and Exact Computation - 8th International Symposium,
{IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8246},
pages = {54--65},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03898-8\_6},
doi = {10.1007/978-3-319-03898-8\_6},
timestamp = {Sun, 04 Aug 2024 19:43:27 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BonnetE0P13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BonnetEPT13,
author = {Edouard Bonnet and
Bruno Escoffier and
Vangelis Th. Paschos and
Emeric Tourniaire},
editor = {Gregory Z. Gutin and
Stefan Szeider},
title = {Multi-parameter Complexity Analysis for Constrained Size Graph Problems:
Using Greediness for Parameterization},
booktitle = {Parameterized and Exact Computation - 8th International Symposium,
{IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8246},
pages = {66--77},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03898-8\_7},
doi = {10.1007/978-3-319-03898-8\_7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BonnetEPT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/BourgeoisGLMP13,
author = {Nicolas Bourgeois and
Aristotelis Giannakos and
Giorgio Lucarelli and
Ioannis Milis and
Vangelis Th. Paschos},
editor = {Subir Kumar Ghosh and
Takeshi Tokuyama},
title = {Exact and Approximation Algorithms for Densest \emph{k}-Subgraph},
booktitle = {{WALCOM:} Algorithms and Computation, 7th International Workshop,
{WALCOM} 2013, Kharagpur, India, February 14-16, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7748},
pages = {114--125},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-36065-7\_12},
doi = {10.1007/978-3-642-36065-7\_12},
timestamp = {Sat, 30 Sep 2023 09:58:46 +0200},
biburl = {https://dblp.org/rec/conf/walcom/BourgeoisGLMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BoriaCP13,
author = {Nicolas Boria and
Federico Della Croce and
Vangelis Th. Paschos},
editor = {Christos Kaklamanis and
Kirk Pruhs},
title = {On the max min vertex cover Problem},
booktitle = {Approximation and Online Algorithms - 11th International Workshop,
{WAOA} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8447},
pages = {37--48},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-08001-7\_4},
doi = {10.1007/978-3-319-08001-7\_4},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BoriaCP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BonnetEPT13,
author = {Edouard Bonnet and
Bruno Escoffier and
Vangelis Th. Paschos and
Emeric Tourniaire},
title = {Multi-parameter complexity analysis for constrained size graph problems:
using greediness for parameterization},
journal = {CoRR},
volume = {abs/1306.2217},
year = {2013},
url = {http://arxiv.org/abs/1306.2217},
eprinttype = {arXiv},
eprint = {1306.2217},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonnetEPT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BonnetPS13,
author = {Edouard Bonnet and
Vangelis Th. Paschos and
Florian Sikora},
title = {Multiparameterizations for max {\textdollar}k{\textdollar}-set cover
and related satisfiability problems},
journal = {CoRR},
volume = {abs/1309.4718},
year = {2013},
url = {http://arxiv.org/abs/1309.4718},
eprinttype = {arXiv},
eprint = {1309.4718},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonnetPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BourgeoisDDP13,
author = {Nicolas Bourgeois and
Konrad K. Dabrowski and
Marc Demange and
Vangelis Th. Paschos},
title = {Playing with Parameters: Cross-parameterization in Graphs},
journal = {CoRR},
volume = {abs/1309.6144},
year = {2013},
url = {http://arxiv.org/abs/1309.6144},
eprinttype = {arXiv},
eprint = {1309.6144},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BourgeoisDDP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BonnetP13a,
author = {Edouard Bonnet and
Vangelis Th. Paschos},
title = {Parameterized (in)approximability of subset problems},
journal = {CoRR},
volume = {abs/1310.5576},
year = {2013},
url = {http://arxiv.org/abs/1310.5576},
eprinttype = {arXiv},
eprint = {1310.5576},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonnetP13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BourgeoisEPR12,
author = {Nicolas Bourgeois and
Bruno Escoffier and
Vangelis Th. Paschos and
Johan M. M. van Rooij},
title = {Fast Algorithms for max independent set},
journal = {Algorithmica},
volume = {62},
number = {1-2},
pages = {382--415},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9460-7},
doi = {10.1007/S00453-010-9460-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BourgeoisEPR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AusielloBGLP12,
author = {Giorgio Ausiello and
Nicolas Boria and
Aristotelis Giannakos and
Giorgio Lucarelli and
Vangelis Th. Paschos},
title = {Online maximum k-coverage},
journal = {Discret. Appl. Math.},
volume = {160},
number = {13-14},
pages = {1901--1913},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2012.04.005},
doi = {10.1016/J.DAM.2012.04.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AusielloBGLP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BourgeoisGLMPP12,
author = {Nicolas Bourgeois and
Aristotelis Giannakos and
Giorgio Lucarelli and
Ioannis Milis and
Vangelis Th. Paschos and
O. Potti{\'{e}}},
title = {The max quasi-independent set problem},
journal = {J. Comb. Optim.},
volume = {23},
number = {1},
pages = {94--117},
year = {2012},
url = {https://doi.org/10.1007/s10878-010-9343-5},
doi = {10.1007/S10878-010-9343-5},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BourgeoisGLMPP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jmma/BoriaMP12,
author = {Nicolas Boria and
C{\'{e}}cile Murat and
Vangelis Th. Paschos},
title = {On the probabilistic min spanning tree Problem},
journal = {J. Math. Model. Algorithms},
volume = {11},
number = {1},
pages = {45--76},
year = {2012},
url = {https://doi.org/10.1007/s10852-011-9165-1},
doi = {10.1007/S10852-011-9165-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jmma/BoriaMP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BourgeoisCEP12,
author = {Nicolas Bourgeois and
Federico Della Croce and
Bruno Escoffier and
Vangelis Th. Paschos},
title = {Algorithms for dominating clique problems},
journal = {Theor. Comput. Sci.},
volume = {459},
pages = {77--88},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.07.016},
doi = {10.1016/J.TCS.2012.07.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BourgeoisCEP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/CroceP12,
author = {Federico Della Croce and
Vangelis Th. Paschos},
editor = {Jos C. M. Baeten and
Thomas Ball and
Frank S. de Boer},
title = {Efficient Algorithms for the max k -vertex cover Problem},
booktitle = {Theoretical Computer Science - 7th {IFIP} {TC} 1/WG 2.2 International
Conference, {TCS} 2012, Amsterdam, The Netherlands, September 26-28,
2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7604},
pages = {295--309},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33475-7\_21},
doi = {10.1007/978-3-642-33475-7\_21},
timestamp = {Tue, 09 Jul 2024 07:54:49 +0200},
biburl = {https://dblp.org/rec/conf/ifipTCS/CroceP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/EscoffierMPX12,
author = {Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Mingyu Xiao},
editor = {Dimitrios M. Thilikos and
Gerhard J. Woeginger},
title = {New Results on Polynomial Inapproximability and Fixed Parameter Approximability
of edge dominating set},
booktitle = {Parameterized and Exact Computation - 7th International Symposium,
{IPEC} 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7535},
pages = {25--36},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33293-7\_5},
doi = {10.1007/978-3-642-33293-7\_5},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/EscoffierMPX12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BoriaMP12,
author = {Nicolas Boria and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {David Fern{\'{a}}ndez{-}Baca},
title = {Reoptimization of Some Maximum Weight Induced Hereditary Subgraph
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 = {73--84},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29344-3\_7},
doi = {10.1007/978-3-642-29344-3\_7},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/BoriaMP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/EscoffierPT12,
author = {Bruno Escoffier and
Vangelis Th. Paschos and
Emeric Tourniaire},
editor = {Manindra Agrawal and
S. Barry Cooper and
Angsheng Li},
title = {Approximating {MAX} {SAT} by Moderately Exponential and Parameterized
Algorithms},
booktitle = {Theory and Applications of Models of Computation - 9th Annual Conference,
{TAMC} 2012, Beijing, China, May 16-21, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7287},
pages = {202--213},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29952-0\_23},
doi = {10.1007/978-3-642-29952-0\_23},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/EscoffierPT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/BoriaMP12,
author = {Nicolas Boria and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Md. Saidur Rahman and
Shin{-}Ichi Nakano},
title = {Reoptimization of the Maximum Weighted {P} k -Free Subgraph Problem
under Vertex Insertion},
booktitle = {{WALCOM:} Algorithms and Computation - 6th International Workshop,
{WALCOM} 2012, Dhaka, Bangladesh, February 15-17, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7157},
pages = {76--87},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-28076-4\_10},
doi = {10.1007/978-3-642-28076-4\_10},
timestamp = {Tue, 21 Mar 2023 20:55:51 +0100},
biburl = {https://dblp.org/rec/conf/walcom/BoriaMP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iscopt/2012,
editor = {Ali Ridha Mahjoub and
Vangelis Markakis and
Ioannis Milis and
Vangelis Th. Paschos},
title = {Combinatorial Optimization - Second International Symposium, {ISCO}
2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7422},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32147-4},
doi = {10.1007/978-3-642-32147-4},
isbn = {978-3-642-32146-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/2012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-6656,
author = {Bruno Escoffier and
Eun Jung Kim and
Vangelis Th. Paschos},
title = {Subexponential and FPT-time Inapproximability of Independent Set and
Related Problems},
journal = {CoRR},
volume = {abs/1211.6656},
year = {2012},
url = {http://arxiv.org/abs/1211.6656},
eprinttype = {arXiv},
eprint = {1211.6656},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-6656.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BourgeoisEP11,
author = {Nicolas Bourgeois and
Bruno Escoffier and
Vangelis Th. Paschos},
title = {Approximation of max independent set, min vertex cover and related
problems by moderately exponential algorithms},
journal = {Discret. Appl. Math.},
volume = {159},
number = {17},
pages = {1954--1970},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2011.07.009},
doi = {10.1016/J.DAM.2011.07.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BourgeoisEP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/BoriaP11,
author = {Nicolas Boria and
Vangelis Th. Paschos},
title = {A survey on combinatorial optimization in dynamic environments},
journal = {{RAIRO} Oper. Res.},
volume = {45},
number = {3},
pages = {241--294},
year = {2011},
url = {https://doi.org/10.1051/ro/2011114},
doi = {10.1051/RO/2011114},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/BoriaP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/AusielloBGLP11,
author = {Giorgio Ausiello and
Nicolas Boria and
Aristotelis Giannakos and
Giorgio Lucarelli and
Vangelis Th. Paschos},
editor = {Olaf Owe and
Martin Steffen and
Jan Arne Telle},
title = {Online Maximum k-Coverage},
booktitle = {Fundamentals of Computation Theory - 18th International Symposium,
{FCT} 2011, Oslo, Norway, August 22-25, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6914},
pages = {181--192},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22953-4\_16},
doi = {10.1007/978-3-642-22953-4\_16},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/AusielloBGLP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aor/CrocePC10,
author = {Federico Della Croce and
Vangelis Th. Paschos and
Roberto Wolfler Calvo},
title = {Approximating the metric 2-Peripatetic Salesman Problem},
journal = {Algorithmic Oper. Res.},
volume = {5},
number = {1},
pages = {13--20},
year = {2010},
url = {http://journals.hil.unb.ca/index.php/AOR/article/view/11496},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aor/CrocePC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aor/MuratP10,
author = {C{\'{e}}cile Murat and
Vangelis Th. Paschos},
title = {Probabilistic optimization in graph-problems},
journal = {Algorithmic Oper. Res.},
volume = {5},
number = {1},
pages = {49--64},
year = {2010},
url = {http://journals.hil.unb.ca/index.php/AOR/article/view/11267},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aor/MuratP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csr/EscoffierP10,
author = {Bruno Escoffier and
Vangelis Th. Paschos},
title = {A survey on the structure of approximation classes},
journal = {Comput. Sci. Rev.},
volume = {4},
number = {1},
pages = {19--40},
year = {2010},
url = {https://doi.org/10.1016/j.cosrev.2009.11.001},
doi = {10.1016/J.COSREV.2009.11.001},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/csr/EscoffierP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LucarelliMP10,
author = {Giorgio Lucarelli and
Ioannis Milis and
Vangelis Th. Paschos},
title = {On the max-weight edge coloring problem},
journal = {J. Comb. Optim.},
volume = {20},
number = {4},
pages = {429--442},
year = {2010},
url = {https://doi.org/10.1007/s10878-009-9223-z},
doi = {10.1007/S10878-009-9223-Z},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LucarelliMP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BoriaP10,
author = {Nicolas Boria and
Vangelis Th. Paschos},
title = {Fast reoptimization for the minimum spanning tree problem},
journal = {J. Discrete Algorithms},
volume = {8},
number = {3},
pages = {296--310},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.07.002},
doi = {10.1016/J.JDA.2009.07.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BoriaP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/PaschosTZ10,
author = {Vangelis Th. Paschos and
Orestis Telelis and
Vassilis Zissimopoulos},
title = {Probabilistic models for the Steiner Tree problem},
journal = {Networks},
volume = {56},
number = {1},
pages = {39--49},
year = {2010},
url = {https://doi.org/10.1002/net.20346},
doi = {10.1002/NET.20346},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/PaschosTZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BourgeoisLMP10,
author = {Nicolas Bourgeois and
Giorgio Lucarelli and
Ioannis Milis and
Vangelis Th. Paschos},
title = {Approximating the max-edge-coloring problem},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {34-36},
pages = {3055--3067},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2010.04.031},
doi = {10.1016/J.TCS.2010.04.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BourgeoisLMP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BourgeoisGLMPP10,
author = {Nicolas Bourgeois and
Aristotelis Giannakos and
Giorgio Lucarelli and
Ioannis Milis and
Vangelis Th. Paschos and
O. Potti{\'{e}}},
editor = {Farid M. Ablayev and
Ernst W. Mayr},
title = {The max quasi-independent set Problem},
booktitle = {Computer Science - Theory and Applications, 5th International Computer
Science Symposium in Russia, {CSR} 2010, Kazan, Russia, June 16-20,
2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6072},
pages = {60--71},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13182-0\_6},
doi = {10.1007/978-3-642-13182-0\_6},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/BourgeoisGLMPP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/imcsit/BoriaMP10,
author = {Nicolas Boria and
C{\'{e}}cile Murat and
Vangelis Th. Paschos},
title = {On the Probabilistic min spanning tree problem},
booktitle = {Proceedings of the International Multiconference on Computer Science
and Information Technology, {IMCSIT} 2010, Wisla, Poland, 18-20 October
2010},
pages = {893--900},
publisher = {{IEEE}},
year = {2010},
url = {https://doi.org/10.1109/IMCSIT.2010.5679920},
doi = {10.1109/IMCSIT.2010.5679920},
timestamp = {Tue, 08 Dec 2020 16:06:06 +0100},
biburl = {https://dblp.org/rec/conf/imcsit/BoriaMP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/BourgeoisEP10,
author = {Nicolas Bourgeois and
Bruno Escoffier and
Vangelis Th. Paschos},
editor = {Boaz Patt{-}Shamir and
T{\'{\i}}naz Ekim},
title = {Fast Algorithms for min independent dominating set},
booktitle = {Structural Information and Communication Complexity, 17th International
Colloquium, {SIROCCO} 2010, Sirince, Turkey, June 7-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6058},
pages = {247--261},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13284-1\_20},
doi = {10.1007/978-3-642-13284-1\_20},
timestamp = {Fri, 17 Apr 2020 13:19:16 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/BourgeoisEP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BourgeoisEPR10,
author = {Nicolas Bourgeois and
Bruno Escoffier and
Vangelis Th. Paschos and
Johan M. M. van Rooij},
editor = {Haim Kaplan},
title = {A Bottom-Up Method and Fast Algorithms for max independent set},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {62--73},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_7},
doi = {10.1007/978-3-642-13731-0\_7},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/BourgeoisEPR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/BourgeoisEPR10,
author = {Nicolas Bourgeois and
Bruno Escoffier and
Vangelis Th. Paschos and
Johan M. M. van Rooij},
editor = {Jan Kratochv{\'{\i}}l and
Angsheng Li and
Jir{\'{\i}} Fiala and
Petr Kolman},
title = {Maximum Independent Set in Graphs of Average Degree at Most Three
in \emph{O}(1.08537\({}^{\mbox{\emph{n}}}\))\{{\textbackslash}mathcal
O\}(1.08537{\^{}}n)},
booktitle = {Theory and Applications of Models of Computation, 7th Annual Conference,
{TAMC} 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6108},
pages = {373--384},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13562-0\_34},
doi = {10.1007/978-3-642-13562-0\_34},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/BourgeoisEPR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aor/AusielloBGP09,
author = {Giorgio Ausiello and
Nicolas Bourgeois and
Telis Giannakos and
Vangelis Th. Paschos},
title = {Greedy Algorithms For On-Line Set-Covering},
journal = {Algorithmic Oper. Res.},
volume = {4},
number = {1},
pages = {36--48},
year = {2009},
url = {http://journals.hil.unb.ca/index.php/AOR/article/view/5928},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aor/AusielloBGP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aor/EscoffierMP09,
author = {Bruno Escoffier and
Martin Milanic and
Vangelis Th. Paschos},
title = {Simple and Fast Reoptimizations for the Steiner Tree Problem},
journal = {Algorithmic Oper. Res.},
volume = {4},
number = {2},
pages = {86--94},
year = {2009},
url = {http://journals.hil.unb.ca/index.php/AOR/article/view/5653},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aor/EscoffierMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WerraDEMP09,
author = {Dominique de Werra and
Marc Demange and
Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {Weighted coloring on planar, bipartite and split graphs: Complexity
and approximation},
journal = {Discret. Appl. Math.},
volume = {157},
number = {4},
pages = {819--832},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.06.013},
doi = {10.1016/J.DAM.2008.06.013},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/WerraDEMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BaburinCGGP09,
author = {Alexey Baburin and
Federico Della Croce and
Edward Gimadi and
Y. V. Glazkov and
Vangelis Th. Paschos},
title = {Approximation algorithms for the 2-peripatetic salesman problem with
edge weights 1 and 2},
journal = {Discret. Appl. Math.},
volume = {157},
number = {9},
pages = {1988--1992},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.06.025},
doi = {10.1016/J.DAM.2008.06.025},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BaburinCGGP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BourgeoisEP09,
author = {Nicolas Bourgeois and
Bruno Escoffier and
Vangelis Th. Paschos},
title = {Approximation of min coloring by moderately exponential algorithms},
journal = {Inf. Process. Lett.},
volume = {109},
number = {16},
pages = {950--954},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.05.002},
doi = {10.1016/J.IPL.2009.05.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BourgeoisEP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BourgeoisCEMP09,
author = {Nicolas Bourgeois and
Federico Della Croce and
Bruno Escoffier and
C{\'{e}}cile Murat and
Vangelis Th. Paschos},
title = {Probabilistic graph-coloring in bipartite and split graphs},
journal = {J. Comb. Optim.},
volume = {17},
number = {3},
pages = {274--311},
year = {2009},
url = {https://doi.org/10.1007/s10878-007-9112-2},
doi = {10.1007/S10878-007-9112-2},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BourgeoisCEMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AusielloEMP09,
author = {Giorgio Ausiello and
Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {Reoptimization of minimum and maximum traveling salesman's tours},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {453--463},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.12.001},
doi = {10.1016/J.JDA.2008.12.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AusielloEMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BourgeoisEP09,
author = {Nicolas Bourgeois and
Bruno Escoffier and
Vangelis Th. Paschos},
title = {Efficient approximation of min set cover by moderately exponential
algorithms},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2184--2195},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.007},
doi = {10.1016/J.TCS.2009.02.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BourgeoisEP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BourgeoisCEP09,
author = {Nicolas Bourgeois and
Federico Della Croce and
Bruno Escoffier and
Vangelis Th. Paschos},
editor = {Yingfei Dong and
Ding{-}Zhu Du and
Oscar H. Ibarra},
title = {Exact Algorithms for Dominating Clique Problems},
booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC}
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5878},
pages = {4--13},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10631-6\_3},
doi = {10.1007/978-3-642-10631-6\_3},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BourgeoisCEP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BourgeoisLMP09,
author = {Nicolas Bourgeois and
Giorgio Lucarelli and
Ioannis Milis and
Vangelis Th. Paschos},
editor = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l and
Mirka Miller},
title = {Approximating the Max Edge-Coloring Problem},
booktitle = {Combinatorial Algorithms, 20th International Workshop, {IWOCA} 2009,
Hradec nad Moravic{\'{\i}}, Czech Republic, June 28-July 2, 2009,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {5874},
pages = {83--94},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10217-2\_11},
doi = {10.1007/978-3-642-10217-2\_11},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/BourgeoisLMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BourgeoisEP09,
author = {Nicolas Bourgeois and
Bruno Escoffier and
Vangelis Th. Paschos},
editor = {Frank K. H. A. Dehne and
Marina L. Gavrilova and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Csaba D. T{\'{o}}th},
title = {Efficient Approximation of Combinatorial Problems by Moderately Exponential
Algorithms},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {507--518},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_44},
doi = {10.1007/978-3-642-03367-4\_44},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BourgeoisEP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0901-1563,
author = {Nicolas Bourgeois and
Bruno Escoffier and
Vangelis Th. Paschos and
Johan M. M. van Rooij},
title = {Fast Algorithms for Max Independent Set in Graphs of Small Average
Degree},
journal = {CoRR},
volume = {abs/0901.1563},
year = {2009},
url = {http://arxiv.org/abs/0901.1563},
eprinttype = {arXiv},
eprint = {0901.1563},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0901-1563.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0901-4002,
author = {Giorgio Lucarelli and
Ioannis Milis and
Vangelis Th. Paschos},
title = {Max Edge Coloring of Trees},
journal = {CoRR},
volume = {abs/0901.4002},
year = {2009},
url = {http://arxiv.org/abs/0901.4002},
eprinttype = {arXiv},
eprint = {0901.4002},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0901-4002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0905-1993,
author = {Nicolas Bourgeois and
Bruno Escoffier and
Vangelis Th. Paschos},
title = {Fast algorithms for min independent dominating set},
journal = {CoRR},
volume = {abs/0905.1993},
year = {2009},
url = {http://arxiv.org/abs/0905.1993},
eprinttype = {arXiv},
eprint = {0905.1993},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0905-1993.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0022356,
author = {Vangelis Th. Paschos},
title = {Combinatorial Optimization and Theoretical Computer Science - Interfaces
and Perspectives: 30th Anniversary of the {LAMSADE}},
publisher = {Wiley},
year = {2008},
isbn = {978-1-8482-1021-9},
timestamp = {Tue, 15 Mar 2011 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/daglib/0022356.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/or/CroceP08,
author = {Federico Della Croce and
Vangelis Th. Paschos},
title = {Exploiting dominance conditions for computing non trivial worst-case
complexity for bounded combinatorial optimization problems},
journal = {Oper. Res.},
volume = {8},
number = {3},
pages = {235--256},
year = {2008},
url = {https://doi.org/10.1007/s12351-008-0020-8},
doi = {10.1007/S12351-008-0020-8},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/or/CroceP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/MuratP08,
author = {C{\'{e}}cile Murat and
Vangelis Th. Paschos},
editor = {Boting Yang and
Ding{-}Zhu Du and
Cao An Wang},
title = {Vertex-Uncertainty in Graph-Problems},
booktitle = {Combinatorial Optimization and Applications, Second International
Conference, {COCOA} 2008, St. John's, NL, Canada, August 21-24, 2008.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5165},
pages = {139--148},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85097-7\_13},
doi = {10.1007/978-3-540-85097-7\_13},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/MuratP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BourgeoisEP08,
author = {Nicolas Bourgeois and
Bruno Escoffier and
Vangelis Th. Paschos},
editor = {Martin Grohe and
Rolf Niedermeier},
title = {An O*(1.0977\({}^{\mbox{n}}\)) Exact Algorithm for max independent
set in Sparse Graphs},
booktitle = {Parameterized and Exact Computation, Third International Workshop,
{IWPEC} 2008, Victoria, Canada, May 14-16, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5018},
pages = {55--65},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79723-4\_7},
doi = {10.1007/978-3-540-79723-4\_7},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BourgeoisEP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/LucarelliMP08,
author = {Giorgio Lucarelli and
Ioannis Milis and
Vangelis Th. Paschos},
editor = {Evripidis Bampis and
Martin Skutella},
title = {On the Maximum Edge Coloring Problem},
booktitle = {Approximation and Online Algorithms, 6th International Workshop, {WAOA}
2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5426},
pages = {279--292},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-93980-1\_22},
doi = {10.1007/978-3-540-93980-1\_22},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/LucarelliMP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/EscoffierP07,
author = {Bruno Escoffier and
Vangelis Th. Paschos},
title = {Differential approximation of min sat},
journal = {Eur. J. Oper. Res.},
volume = {181},
number = {2},
pages = {620--633},
year = {2007},
url = {https://doi.org/10.1016/j.ejor.2005.04.057},
doi = {10.1016/J.EJOR.2005.04.057},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/EscoffierP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/CroceEP07,
author = {Federico Della Croce and
Bruno Escoffier and
Vangelis Th. Paschos},
title = {Improved worst-case complexity for the {MIN} 3-SET {COVERING} problem},
journal = {Oper. Res. Lett.},
volume = {35},
number = {2},
pages = {205--210},
year = {2007},
url = {https://doi.org/10.1016/j.orl.2006.02.004},
doi = {10.1016/J.ORL.2006.02.004},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/CroceEP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/CroceKP07,
author = {Federico Della Croce and
Marcin Jakub Kaminski and
Vangelis Th. Paschos},
title = {An exact algorithm for {MAX-CUT} in sparse graphs},
journal = {Oper. Res. Lett.},
volume = {35},
number = {3},
pages = {403--408},
year = {2007},
url = {https://doi.org/10.1016/j.orl.2006.04.001},
doi = {10.1016/J.ORL.2006.04.001},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/CroceKP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/DemangeWMP07,
author = {Marc Demange and
Dominique de Werra and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {Time slot scheduling of compatible jobs},
journal = {J. Sched.},
volume = {10},
number = {2},
pages = {111--127},
year = {2007},
url = {https://doi.org/10.1007/s10951-006-0003-7},
doi = {10.1007/S10951-006-0003-7},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/DemangeWMP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/PaschosTZ07,
author = {Vangelis Th. Paschos and
Orestis Telelis and
Vassilis Zissimopoulos},
editor = {Andreas W. M. Dress and
Yinfeng Xu and
Binhai Zhu},
title = {Steiner Forests on Stochastic Metric Graphs},
booktitle = {Combinatorial Optimization and Applications, First International Conference,
{COCOA} 2007, Xi'an, China, August 14-16, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4616},
pages = {112--123},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73556-4\_14},
doi = {10.1007/978-3-540-73556-4\_14},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/PaschosTZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/GiannakosGMP07,
author = {Aristotelis Giannakos and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Xiaotie Deng and
Fan Chung Graham},
title = {On the Performance of Congestion Games for Optimum Satisfiability
Problems},
booktitle = {Internet and Network Economics, Third International Workshop, {WINE}
2007, San Diego, CA, USA, December 12-14, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4858},
pages = {220--231},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77105-0\_22},
doi = {10.1007/978-3-540-77105-0\_22},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/wine/GiannakosGMP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/AusielloP07,
author = {Giorgio Ausiello and
Vangelis Th. Paschos},
editor = {Teofilo F. Gonzalez},
title = {Reductions That Preserve Approximability},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics},
publisher = {Chapman and Hall/CRC},
year = {2007},
url = {https://doi.org/10.1201/9781420010749.ch15},
doi = {10.1201/9781420010749.CH15},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/crc/AusielloP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/AusielloP07a,
author = {Giorgio Ausiello and
Vangelis Th. Paschos},
editor = {Teofilo F. Gonzalez},
title = {Differential Ratio Approximation},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics},
publisher = {Chapman and Hall/CRC},
year = {2007},
url = {https://doi.org/10.1201/9781420010749.ch16},
doi = {10.1201/9781420010749.CH16},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/crc/AusielloP07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MuratP06,
author = {C{\'{e}}cile Murat and
Vangelis Th. Paschos},
title = {On the probabilistic minimum coloring and minimum \emph{k}-coloring},
journal = {Discret. Appl. Math.},
volume = {154},
number = {3},
pages = {564--586},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2005.06.007},
doi = {10.1016/J.DAM.2005.06.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MuratP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/GlazkovBGCP06,
author = {Yury Glazkov and
Alexey Baburin and
Edward Gimadi and
Federico Della Croce and
Vangelis Th. Paschos},
title = {Approximation algorithms for 2-Peripathetic Salesman Problem with
edge weights 1 and 2},
journal = {Electron. Notes Discret. Math.},
volume = {27},
pages = {35--36},
year = {2006},
url = {https://doi.org/10.1016/j.endm.2006.08.043},
doi = {10.1016/J.ENDM.2006.08.043},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/GlazkovBGCP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Paschos06,
author = {Vangelis Th. Paschos},
title = {Jon Lee, {A} First Course in Combinatorial Optimization, Cambridge
Texts in Applied Mathematics},
journal = {Eur. J. Oper. Res.},
volume = {168},
number = {3},
pages = {1042--1044},
year = {2006},
url = {https://doi.org/10.1016/j.ejor.2005.01.003},
doi = {10.1016/J.EJOR.2005.01.003},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/Paschos06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/AusielloP06,
author = {Giorgio Ausiello and
Vangelis Th. Paschos},
title = {Reductions, completeness and the hardness of approximability},
journal = {Eur. J. Oper. Res.},
volume = {172},
number = {3},
pages = {719--739},
year = {2006},
url = {https://doi.org/10.1016/j.ejor.2005.06.006},
doi = {10.1016/J.EJOR.2005.06.006},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/AusielloP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EscoffierMP06,
author = {Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {Weighted Coloring: further complexity and approximability results},
journal = {Inf. Process. Lett.},
volume = {97},
number = {3},
pages = {98--103},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2005.09.013},
doi = {10.1016/J.IPL.2005.09.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EscoffierMP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/EscoffierP06,
author = {Bruno Escoffier and
Vangelis Th. Paschos},
title = {On-line models and algorithms for max independent set},
journal = {{RAIRO} Oper. Res.},
volume = {40},
number = {2},
pages = {129--142},
year = {2006},
url = {https://doi.org/10.1051/ro:2006014},
doi = {10.1051/RO:2006014},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/EscoffierP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EscoffierP06,
author = {Bruno Escoffier and
Vangelis Th. Paschos},
title = {Completeness in approximation classes beyond {APX}},
journal = {Theor. Comput. Sci.},
volume = {359},
number = {1-3},
pages = {369--377},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.05.023},
doi = {10.1016/J.TCS.2006.05.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EscoffierP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/AusielloGP06,
author = {Giorgio Ausiello and
Aristotelis Giannakos and
Vangelis Th. Paschos},
editor = {Joachim Gudmundsson and
C. Barry Jay},
title = {Greedy algorithms for on-line set-covering and related problems},
booktitle = {Theory of Computing 2006, Proceedings of the Twelfth Computing: The
Australasian Theory Symposium {(CATS2006).} Hobart, Tasmania, Australia,
16-19 January 2006, Proceedings},
series = {{CRPIT}},
volume = {51},
pages = {145--151},
publisher = {Australian Computer Society},
year = {2006},
url = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV51Ausiello.html},
timestamp = {Mon, 08 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cats/AusielloGP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AusielloEMP06,
author = {Giorgio Ausiello and
Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Lars Arge and
Rusins Freivalds},
title = {Reoptimization of Minimum and Maximum Traveling Salesman's Tours},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {196--207},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_20},
doi = {10.1007/11785293\_20},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/AusielloEMP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WerraDMP05,
author = {Dominique de Werra and
Marc Demange and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {A hypocoloring model for batch scheduling},
journal = {Discret. Appl. Math.},
volume = {146},
number = {1},
pages = {3--26},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2004.06.016},
doi = {10.1016/J.DAM.2004.06.016},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/WerraDMP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/DemangeP05,
author = {Marc Demange and
Vangelis Th. Paschos},
title = {Polynomial approximation algorithms with performance guarantees: An
introduction-by-example},
journal = {Eur. J. Oper. Res.},
volume = {165},
number = {3},
pages = {555--568},
year = {2005},
url = {https://doi.org/10.1016/j.ejor.2004.03.021},
doi = {10.1016/J.EJOR.2004.03.021},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/DemangeP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcm/EscoffierP05,
author = {Bruno Escoffier and
Vangelis Th. Paschos},
title = {Proving completeness by logic},
journal = {Int. J. Comput. Math.},
volume = {82},
number = {2},
pages = {151--161},
year = {2005},
url = {https://doi.org/10.1080/00207160412331296625},
doi = {10.1080/00207160412331296625},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcm/EscoffierP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/AusielloBDP05,
author = {Giorgio Ausiello and
Cristina Bazgan and
Marc Demange and
Vangelis Th. Paschos},
title = {Completeness in differential approximation classes},
journal = {Int. J. Found. Comput. Sci.},
volume = {16},
number = {6},
pages = {1267--1295},
year = {2005},
url = {https://doi.org/10.1142/S0129054105003807},
doi = {10.1142/S0129054105003807},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/AusielloBDP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/itor/DemangePP05,
author = {Marc Demange and
Xavier Paradon and
Vangelis Th. Paschos},
title = {On-line maximum-order induced hereditary subgraph problems},
journal = {Int. Trans. Oper. Res.},
volume = {12},
number = {2},
pages = {185--201},
year = {2005},
url = {https://doi.org/10.1111/j.1475-3995.2005.00497.x},
doi = {10.1111/J.1475-3995.2005.00497.X},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/itor/DemangePP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DemangeP05,
author = {Marc Demange and
Vangelis Th. Paschos},
title = {Improved Approximations for Weighted and Unweighted Graph Problems},
journal = {Theory Comput. Syst.},
volume = {38},
number = {6},
pages = {763--787},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1162-6},
doi = {10.1007/S00224-004-1162-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DemangeP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DemangeP05,
author = {Marc Demange and
Vangelis Th. Paschos},
title = {On-line vertex-covering},
journal = {Theor. Comput. Sci.},
volume = {332},
number = {1-3},
pages = {83--108},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2004.08.015},
doi = {10.1016/J.TCS.2004.08.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DemangeP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BazganMPS05,
author = {Cristina Bazgan and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Fabrice Serri{\`{e}}re},
title = {On the differential approximation of {MIN} {SET} {COVER}},
journal = {Theor. Comput. Sci.},
volume = {332},
number = {1-3},
pages = {497--513},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2004.12.022},
doi = {10.1016/J.TCS.2004.12.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BazganMPS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BazganEP05,
author = {Cristina Bazgan and
Bruno Escoffier and
Vangelis Th. Paschos},
title = {Completeness in standard and differential approximation classes: Poly-(D)APX-
and (D)PTAS-completeness},
journal = {Theor. Comput. Sci.},
volume = {339},
number = {2-3},
pages = {272--292},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.03.007},
doi = {10.1016/J.TCS.2005.03.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BazganEP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccsa/EscoffierP05,
author = {Bruno Escoffier and
Vangelis Th. Paschos},
editor = {Osvaldo Gervasi and
Marina L. Gavrilova and
Vipin Kumar and
Antonio Lagan{\`{a}} and
Heow Pueh Lee and
Youngsong Mun and
David Taniar and
Chih Jeng Kenneth Tan},
title = {Differential Approximation of min sat, max sat and Related Problems},
booktitle = {Computational Science and Its Applications - {ICCSA} 2005, International
Conference, Singapore, May 9-12, 2005, Proceedings, Part {IV}},
series = {Lecture Notes in Computer Science},
volume = {3483},
pages = {192--201},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11424925\_22},
doi = {10.1007/11424925\_22},
timestamp = {Thu, 28 Apr 2022 16:17:38 +0200},
biburl = {https://dblp.org/rec/conf/iccsa/EscoffierP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccsa/CroceEMP05,
author = {Federico Della Croce and
Bruno Escoffier and
C{\'{e}}cile Murat and
Vangelis Th. Paschos},
editor = {Osvaldo Gervasi and
Marina L. Gavrilova and
Vipin Kumar and
Antonio Lagan{\`{a}} and
Heow Pueh Lee and
Youngsong Mun and
David Taniar and
Chih Jeng Kenneth Tan},
title = {Probabilistic Coloring of Bipartite and Split Graphs},
booktitle = {Computational Science and Its Applications - {ICCSA} 2005, International
Conference, Singapore, May 9-12, 2005, Proceedings, Part {IV}},
series = {Lecture Notes in Computer Science},
volume = {3483},
pages = {202--211},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11424925\_23},
doi = {10.1007/11424925\_23},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iccsa/CroceEMP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/EscoffierMP05,
author = {Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Mario Coppo and
Elena Lodi and
G. Michele Pinna},
title = {Weighted Coloring: Further Complexity and Approximability Results},
booktitle = {Theoretical Computer Science, 9th Italian Conference, {ICTCS} 2005,
Siena, Italy, October 12-14, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3701},
pages = {205--214},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11560586\_17},
doi = {10.1007/11560586\_17},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/ictcs/EscoffierMP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/CroceP05,
author = {Federico Della Croce and
Vangelis Th. Paschos},
editor = {Xiaotie Deng and
Ding{-}Zhu Du},
title = {Computing Optimal Solutions for the min 3-set covering Problem},
booktitle = {Algorithms and Computation, 16th International Symposium, {ISAAC}
2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3827},
pages = {685--692},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11602613\_69},
doi = {10.1007/11602613\_69},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/CroceP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/BazganMPS05,
author = {Cristina Bazgan and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Fabrice Serri{\`{e}}re},
editor = {Peter Vojt{\'{a}}s and
M{\'{a}}ria Bielikov{\'{a}} and
Bernadette Charron{-}Bost and
Ondrej S{\'{y}}kora},
title = {Greedy Differential Approximations for Min Set Cover},
booktitle = {{SOFSEM} 2005: Theory and Practice of Computer Science, 31st Conference
on Current Trends in Theory and Practice of Computer Science, Liptovsk{\'{y}}
J{\'{a}}n, Slovakia, January 22-28, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3381},
pages = {62--71},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-30577-4\_9},
doi = {10.1007/978-3-540-30577-4\_9},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/BazganMPS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/HifiPZ04,
author = {Mhand Hifi and
Vangelis Th. Paschos and
Vassilis Zissimopoulos},
title = {A simulated annealing approach for the circular cutting problem},
journal = {Eur. J. Oper. Res.},
volume = {159},
number = {2},
pages = {430--448},
year = {2004},
url = {https://doi.org/10.1016/S0377-2217(03)00417-X},
doi = {10.1016/S0377-2217(03)00417-X},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/HifiPZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcm/EkimP04,
author = {T{\'{\i}}naz Ekim and
Vangelis Th. Paschos},
title = {Approximation preserving reductions for set covering, vertex covering
and independent set hierarchies under differential approximation},
journal = {Int. J. Comput. Math.},
volume = {81},
number = {5},
pages = {569--582},
year = {2004},
url = {https://doi.org/10.1080/00207160410001688592},
doi = {10.1080/00207160410001688592},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijcm/EkimP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AusielloDLP04,
author = {Giorgio Ausiello and
Marc Demange and
Luigi Laura and
Vangelis Th. Paschos},
title = {Algorithms for the On-Line Quota Traveling Salesman Problem},
journal = {Inf. Process. Lett.},
volume = {92},
number = {2},
pages = {89--94},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.06.013},
doi = {10.1016/J.IPL.2004.06.013},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AusielloDLP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/MonnotPT04,
author = {J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Sophie Toulouse},
title = {Local approximations for maximum partial subgraph problem},
journal = {Oper. Res. Lett.},
volume = {32},
number = {3},
pages = {217--224},
year = {2004},
url = {https://doi.org/10.1016/j.orl.2003.08.004},
doi = {10.1016/J.ORL.2003.08.004},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/MonnotPT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/CroceGP04,
author = {Federico Della Croce and
Andrea Grosso and
Vangelis Th. Paschos},
title = {Lower Bounds on the Approximation Ratios of Leading Heuristics for
the Single-Machine Total Tardiness Problem},
journal = {J. Sched.},
volume = {7},
number = {1},
pages = {85--91},
year = {2004},
url = {https://doi.org/10.1023/B:JOSH.0000013056.09936.fd},
doi = {10.1023/B:JOSH.0000013056.09936.FD},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/CroceGP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/AusielloDLP04,
author = {Giorgio Ausiello and
Marc Demange and
Luigi Laura and
Vangelis Th. Paschos},
editor = {Kyung{-}Yong Chwa and
J. Ian Munro},
title = {Algorithms for the On-Line Quota Traveling Salesman Problem},
booktitle = {Computing and Combinatorics, 10th Annual International Conference,
{COCOON} 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3106},
pages = {290--299},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27798-9\_32},
doi = {10.1007/978-3-540-27798-9\_32},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/AusielloDLP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BazganEP04,
author = {Cristina Bazgan and
Bruno Escoffier and
Vangelis Th. Paschos},
editor = {Rudolf Fleischer and
Gerhard Trippen},
title = {Poly-APX- and PTAS-Completeness in Standard and Differential Approximation},
booktitle = {Algorithms and Computation, 15th International Symposium, {ISAAC}
2004, Hong Kong, China, December 20-22, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3341},
pages = {124--136},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30551-4\_13},
doi = {10.1007/978-3-540-30551-4\_13},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BazganEP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/MonnotPWDE04,
author = {J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Dominique de Werra and
Marc Demange and
Bruno Escoffier},
editor = {Rudolf Fleischer and
Gerhard Trippen},
title = {Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity
and Improved Approximation},
booktitle = {Algorithms and Computation, 15th International Symposium, {ISAAC}
2004, Hong Kong, China, December 20-22, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3341},
pages = {896--907},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30551-4\_76},
doi = {10.1007/978-3-540-30551-4\_76},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/MonnotPWDE04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/WerraDMP04,
author = {Dominique de Werra and
Marc Demange and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Juraj Hromkovic and
Manfred Nagl and
Bernhard Westfechtel},
title = {The Hypocoloring Problem: Complexity and Approximability Results when
the Chromatic Number Is Small},
booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG
2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {3353},
pages = {377--388},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30559-0\_32},
doi = {10.1007/978-3-540-30559-0\_32},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/WerraDMP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/appml/DemangeMP03,
author = {Marc Demange and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {Differential approximation results for the Steiner tree problem},
journal = {Appl. Math. Lett.},
volume = {16},
number = {5},
pages = {733--739},
year = {2003},
url = {https://doi.org/10.1016/S0893-9659(03)00075-2},
doi = {10.1016/S0893-9659(03)00075-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/appml/DemangeMP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/Paschos03,
author = {Vangelis Th. Paschos},
title = {Polynomial Approximation and Graph-Coloring},
journal = {Computing},
volume = {70},
number = {1},
pages = {41--86},
year = {2003},
url = {https://doi.org/10.1007/s00607-002-1468-7},
doi = {10.1007/S00607-002-1468-7},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/Paschos03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/MonnotPT03,
author = {J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Sophie Toulouse},
title = {Differential approximation results for the traveling salesman problem
with distances 1 and 2},
journal = {Eur. J. Oper. Res.},
volume = {145},
number = {3},
pages = {557--568},
year = {2003},
url = {https://doi.org/10.1016/S0377-2217(02)00222-9},
doi = {10.1016/S0377-2217(02)00222-9},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/MonnotPT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BazganP03,
author = {Cristina Bazgan and
Vangelis Th. Paschos},
title = {Differential approximation for optimal satisfiability and related
problems},
journal = {Eur. J. Oper. Res.},
volume = {147},
number = {2},
pages = {397--404},
year = {2003},
url = {https://doi.org/10.1016/S0377-2217(02)00299-0},
doi = {10.1016/S0377-2217(02)00299-0},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BazganP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/MonnotPT03,
author = {J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Sophie Toulouse},
title = {Approximation algorithms for the traveling salesman problem},
journal = {Math. Methods Oper. Res.},
volume = {56},
number = {3},
pages = {387--405},
year = {2003},
url = {https://doi.org/10.1007/s001860200239},
doi = {10.1007/S001860200239},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/MonnotPT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tsi/MonnotPT03,
author = {J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Sophie Toulouse},
title = {Optima locaux garantis pour l'approximation diff{\'{e}}rentielle},
journal = {Tech. Sci. Informatiques},
volume = {22},
number = {3},
pages = {257--288},
year = {2003},
url = {https://doi.org/10.3166/tsi.22.257-288},
doi = {10.3166/TSI.22.257-288},
timestamp = {Wed, 24 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tsi/MonnotPT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AusielloBDP03,
author = {Giorgio Ausiello and
Cristina Bazgan and
Marc Demange and
Vangelis Th. Paschos},
editor = {Branislav Rovan and
Peter Vojt{\'{a}}s},
title = {Completeness in Differential Approximation Classes},
booktitle = {Mathematical Foundations of Computer Science 2003, 28th International
Symposium, {MFCS} 2003, Bratislava, Slovakia, August 25-29, 2003,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2747},
pages = {179--188},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45138-9\_12},
doi = {10.1007/978-3-540-45138-9\_12},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/AusielloBDP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/MuratP03,
author = {C{\'{e}}cile Murat and
Vangelis Th. Paschos},
editor = {Hans L. Bodlaender},
title = {The Probabilistic Minimum Coloring Problem},
booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop,
{WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2880},
pages = {346--357},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39890-5\_30},
doi = {10.1007/978-3-540-39890-5\_30},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/MuratP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/DemangeP02,
author = {Marc Demange and
Vangelis Th. Paschos},
title = {Autour de nouvelles notions pour l'analyse des algorithmes d'approximation
: formalisme unifi{\'{e}} et classes d'approximation},
journal = {{RAIRO} Oper. Res.},
volume = {36},
number = {3},
pages = {237--277},
year = {2002},
url = {https://doi.org/10.1051/ro:2003005},
doi = {10.1051/RO:2003005},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/DemangeP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/DemangeP02a,
author = {Marc Demange and
Vangelis Th. Paschos},
title = {Autour de nouvelles notions pour l'analyse des algorithmes d'approximation
: de la structure de {NPO} {\`{a}} la structure des instances},
journal = {{RAIRO} Oper. Res.},
volume = {36},
number = {4},
pages = {311--350},
year = {2002},
url = {https://doi.org/10.1051/ro:2003009},
doi = {10.1051/RO:2003009},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/DemangeP02a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MuratP02,
author = {C{\'{e}}cile Murat and
Vangelis Th. Paschos},
title = {A priori optimization for the probabilistic maximum independent set
problem},
journal = {Theor. Comput. Sci.},
volume = {270},
number = {1-2},
pages = {561--590},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00005-6},
doi = {10.1016/S0304-3975(01)00005-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MuratP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DemangeP02,
author = {Marc Demange and
Vangelis Th. Paschos},
editor = {Ludek Kucera},
title = {Algorithms and Models for the On-Line Vertex-Covering},
booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop,
{WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {2573},
pages = {102--113},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36379-3\_10},
doi = {10.1007/3-540-36379-3\_10},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/DemangeP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DemangeWMP02,
author = {Marc Demange and
Dominique de Werra and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Ludek Kucera},
title = {Weighted Node Coloring: When Stable Sets Are Expensive},
booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop,
{WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {2573},
pages = {114--125},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36379-3\_11},
doi = {10.1007/3-540-36379-3\_11},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/DemangeWMP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/or/Paschos01,
author = {Vangelis Th. Paschos},
title = {On-line independent set by coloring vertices},
journal = {Oper. Res.},
volume = {1},
number = {3},
pages = {213--224},
year = {2001},
url = {https://doi.org/10.1007/BF02936352},
doi = {10.1007/BF02936352},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/or/Paschos01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/MonnotPT01,
author = {J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Sophie Toulouse},
editor = {Rusins Freivalds},
title = {Differential Approximation Results for the Traveling Salesman Problem
with Distances 1 and 2},
booktitle = {Fundamentals of Computation Theory, 13th International Symposium,
{FCT} 2001, Riga, Latvia, August 22-24, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2138},
pages = {275--286},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44669-9\_27},
doi = {10.1007/3-540-44669-9\_27},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/MonnotPT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/coap/AlfandariP00,
author = {Laurent Alfandari and
Vangelis Th. Paschos},
title = {Master-Slave Strategy and Polynomial Approximation},
journal = {Comput. Optim. Appl.},
volume = {16},
number = {3},
pages = {231--245},
year = {2000},
url = {https://doi.org/10.1023/A:1008764212265},
doi = {10.1023/A:1008764212265},
timestamp = {Tue, 14 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/coap/AlfandariP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/DemangePP00,
author = {Marc Demange and
Xavier Paradon and
Vangelis Th. Paschos},
editor = {V{\'{a}}clav Hlav{\'{a}}c and
Keith G. Jeffery and
Jir{\'{\i}} Wiedermann},
title = {On-Line Maximum-Order Induces Hereditary Subgraph Problems},
booktitle = {{SOFSEM} 2000: Theory and Practice of Informatics, 27th Conference
on Current Trends in Theory and Practice of Informatics, Milovy, Czech
Republic, November 25 - December 2, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1963},
pages = {327--335},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44411-4\_21},
doi = {10.1007/3-540-44411-4\_21},
timestamp = {Sat, 30 Sep 2023 09:57:10 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/DemangePP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MuratP99,
author = {C{\'{e}}cile Murat and
Vangelis Th. Paschos},
title = {The probabilistic longest path problem},
journal = {Networks},
volume = {33},
number = {3},
pages = {207--219},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0037(199905)33:3\&\#60;207::AID-NET7\&\#62;3.0.CO;2-7},
doi = {10.1002/(SICI)1097-0037(199905)33:3\&\#60;207::AID-NET7\&\#62;3.0.CO;2-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MuratP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/CrocePT99,
author = {Federico Della Croce and
Vangelis Th. Paschos and
Alexis Tsouki{\`{a}}s},
title = {An improved general procedure for lexicographic bottleneck problems},
journal = {Oper. Res. Lett.},
volume = {24},
number = {4},
pages = {187--194},
year = {1999},
url = {https://doi.org/10.1016/S0167-6377(99)00013-9},
doi = {10.1016/S0167-6377(99)00013-9},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/CrocePT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/DemangeP99,
author = {Marc Demange and
Vangelis Th. Paschos},
title = {Asymptotic differential approximation ratio: Definitions, motivations
and application to some combinatorial problems},
journal = {{RAIRO} Oper. Res.},
volume = {33},
number = {4},
pages = {481--507},
year = {1999},
url = {https://doi.org/10.1051/ro:1999121},
doi = {10.1051/RO:1999121},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/DemangeP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/VegaPS98,
author = {Wenceslas Fernandez de la Vega and
Vangelis Th. Paschos and
Andreas Stafylopatis},
title = {Average-Case Complexity for the Execution of Recursive Definitions
on Relational Databases},
journal = {Acta Informatica},
volume = {35},
number = {3},
pages = {211--243},
year = {1998},
url = {https://doi.org/10.1007/s002360050119},
doi = {10.1007/S002360050119},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/VegaPS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DemangeGP98,
author = {Marc Demange and
Pascal Grisoni and
Vangelis Th. Paschos},
title = {Differential Approximation Algorithms for Some Combinatorial Optimization
Problems},
journal = {Theor. Comput. Sci.},
volume = {209},
number = {1-2},
pages = {107--122},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00099-6},
doi = {10.1016/S0304-3975(97)00099-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DemangeGP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/GabrelMMP97,
author = {Virginie Gabrel and
Alain Moulet and
C{\'{e}}cile Murat and
Vangelis Th. Paschos},
title = {A new single model and derived algorithms for the satellite shot planning
problem using graph theory concepts},
journal = {Ann. Oper. Res.},
volume = {69},
pages = {115--134},
year = {1997},
url = {https://doi.org/10.1023/A\%3A1018920709696},
doi = {10.1023/A\%3A1018920709696},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/GabrelMMP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/coap/DemangeP97,
author = {Marc Demange and
Vangelis Th. Paschos},
title = {The Approximability Behaviour of Some Combinatorial Problems with
Respect to the Approximability of a Class of Maximum Independent Set
Problems},
journal = {Comput. Optim. Appl.},
volume = {7},
number = {3},
pages = {307--324},
year = {1997},
url = {https://doi.org/10.1023/A:1008660812834},
doi = {10.1023/A:1008660812834},
timestamp = {Tue, 14 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/coap/DemangeP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csur/Paschos97,
author = {Vangelis Th. Paschos},
title = {A Survey of Approximately Optimal Solutions to Some Covering and Packing
Problems},
journal = {{ACM} Comput. Surv.},
volume = {29},
number = {2},
pages = {171--209},
year = {1997},
url = {https://doi.org/10.1145/254180.254190},
doi = {10.1145/254180.254190},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/csur/Paschos97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DemangeP96,
author = {Marc Demange and
Vangelis Th. Paschos},
title = {On an Approximation Measure Founded on the Links Between Optimization
and Polynomial Approximation Theory},
journal = {Theor. Comput. Sci.},
volume = {158},
number = {1{\&}2},
pages = {117--141},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00060-7},
doi = {10.1016/0304-3975(95)00060-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DemangeP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BlotVPS95,
author = {Jo{\"{e}}l Blot and
Wenceslas Fernandez de la Vega and
Vangelis Th. Paschos and
Rachid Saad},
title = {Average Case Analysis of Greedy Algorithms for Optimisation Problems
on Set Systems},
journal = {Theor. Comput. Sci.},
volume = {147},
number = {1{\&}2},
pages = {267--298},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)00242-O},
doi = {10.1016/0304-3975(95)00242-O},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BlotVPS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cococ/DemangeP95,
author = {Marc Demange and
Vangelis Th. Paschos},
editor = {Michel Deza and
Reinhardt Euler and
Yannis Manoussakis},
title = {Constructive - Non-constructive Approximation and Maximum Independent
Set Problem},
booktitle = {Combinatorics and Computer Science, 8th Franco-Japanese and 4th Franco-Chinese
Conference, Brest, France, July 3-5, 1995, Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {1120},
pages = {194--207},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-61576-8\_83},
doi = {10.1007/3-540-61576-8\_83},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/cococ/DemangeP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DemangeGP94,
author = {Marc Demange and
Pascal Grisoni and
Vangelis Th. Paschos},
title = {Approximation Results for the Minimum Graph Coloring Problem},
journal = {Inf. Process. Lett.},
volume = {50},
number = {1},
pages = {19--23},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90039-6},
doi = {10.1016/0020-0190(94)90039-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DemangeGP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/PaschosS92,
author = {Vangelis Th. Paschos and
Andreas Stafylopatis},
title = {Evaluation of the Execution Cost of Recursive Definitions},
journal = {Comput. J.},
volume = {35},
number = {Additional-Papers},
pages = {A429--A437},
year = {1992},
timestamp = {Tue, 11 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/PaschosS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Paschos92,
author = {Vangelis Th. Paschos},
title = {A (Delta/2)-Approximation Algorithm for the Maximum Independent Set
Problem},
journal = {Inf. Process. Lett.},
volume = {44},
number = {1},
pages = {11--13},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90248-T},
doi = {10.1016/0020-0190(92)90248-T},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Paschos92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/VegaPS92,
author = {Wenceslas Fernandez de la Vega and
Vangelis Th. Paschos and
Rachid Saad},
editor = {Imre Simon},
title = {Average Case Analysis of a Greedy Algorithm for the Minimum Hitting
Set Problem},
booktitle = {{LATIN} '92, 1st Latin American Symposium on Theoretical Informatics,
S{\~{a}}o Paulo, Brazil, April 6-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {583},
pages = {130--138},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/BFb0023824},
doi = {10.1007/BFB0023824},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/VegaPS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/ZissimopoulosPP91,
author = {Vassilis Zissimopoulos and
Vangelis Th. Paschos and
Ferhan Pekergin},
title = {On the Approximation of NP-Complete Problems by Using the Boltzmann
Machine Method: The Cases of Some Covering and Packing Problems},
journal = {{IEEE} Trans. Computers},
volume = {40},
number = {12},
pages = {1413--1418},
year = {1991},
url = {https://doi.org/10.1109/12.106226},
doi = {10.1109/12.106226},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/ZissimopoulosPP91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Paschos91,
author = {Vangelis Th. Paschos},
editor = {Somenath Biswas and
Kesav V. Nori},
title = {A Theorem on the Approximation of Set Cover and Vertex Cover},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
11th Conference, New Delhi, India, December 17-19, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {560},
pages = {278--287},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-54967-6\_75},
doi = {10.1007/3-540-54967-6\_75},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Paschos91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isa/BenkouarMPS91,
author = {A. Benkouar and
Yannis Manoussakis and
Vangelis Th. Paschos and
Rachid Saad},
editor = {Wen{-}Lian Hsu and
Richard C. T. Lee},
title = {On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored
Complete Graphs},
booktitle = {{ISA} '91 Algorithms, 2nd International Symposium on Algorithms, Taipei,
Republic of China, December 16-18, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {557},
pages = {190--198},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-54945-5\_62},
doi = {10.1007/3-540-54945-5\_62},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/isa/BenkouarMPS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfdbs/VegaPS91,
author = {Wenceslas Fernandez de la Vega and
Vangelis Th. Paschos and
A. N. Staylopatis},
editor = {Bernhard Thalheim and
J{\'{a}}nos Demetrovics and
Hans{-}Detlef Gerhardt},
title = {On the Mean Execution Time of Recursive Definitions on Relational
Databases},
booktitle = {{MFDBS} 91, 3rd Symposium on Mathematical Fundamentals of Database
and Knowledge Bases Systems, Rostock, Germany, May 6-9, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {495},
pages = {119--133},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-54009-1\_9},
doi = {10.1007/3-540-54009-1\_9},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/mfdbs/VegaPS91.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.
last updated on 2024-05-02 21:49 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:
