default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Thomas Bellitto
@article{DBLP:journals/siamdm/AboulkerBHR24,
author = {Pierre Aboulker and
Thomas Bellitto and
Fr{\'{e}}d{\'{e}}ric Havet and
Cl{\'{e}}ment Rambaud},
title = {On the Minimum Number of Arcs in {\textbackslash}({\textbackslash}boldsymbol\{k\}{\textbackslash})-Dicritical
Oriented Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {38},
number = {2},
pages = {1863--1901},
year = {2024},
url = {https://doi.org/10.1137/23m1553753},
doi = {10.1137/23M1553753},
timestamp = {Tue, 17 Sep 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AboulkerBHR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2407-16491,
author = {Thomas Bellitto and
Johanne Cohen and
Bruno Escoffier and
Minh{-}Hang Nguyen and
Mika{\"{e}}l Rabie},
title = {Canadian Traveller Problems in Temporal Graphs},
journal = {CoRR},
volume = {abs/2407.16491},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2407.16491},
doi = {10.48550/ARXIV.2407.16491},
eprinttype = {arXiv},
eprint = {2407.16491},
timestamp = {Mon, 19 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2407-16491.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BellittoLOPS23,
author = {Thomas Bellitto and
Shaohua Li and
Karolina Okrasa and
Marcin Pilipczuk and
Manuel Sorge},
title = {The Complexity of Routing Problems in Forbidden-Transition Graphs
and Edge-Colored Graphs},
journal = {Algorithmica},
volume = {85},
number = {5},
pages = {1202--1250},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01064-1},
doi = {10.1007/S00453-022-01064-1},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BellittoLOPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BellittoBLP23,
author = {Thomas Bellitto and
Caroline Brosse and
Benjamin L{\'{e}}v{\^{e}}que and
Aline Parreau},
title = {Locating-dominating sets in local tournaments},
journal = {Discret. Appl. Math.},
volume = {337},
pages = {14--24},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.04.010},
doi = {10.1016/J.DAM.2023.04.010},
timestamp = {Tue, 20 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BellittoBLP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/moc/BellittoBKP23,
author = {Thomas Bellitto and
Nicolas Bousquet and
Adam Kabela and
Th{\'{e}}o Pierron},
title = {The smallest 5-chromatic tournament},
journal = {Math. Comput.},
volume = {93},
number = {345},
pages = {443--458},
year = {2023},
url = {https://doi.org/10.1090/mcom/3887},
doi = {10.1090/MCOM/3887},
timestamp = {Wed, 20 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/moc/BellittoBKP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sand/BellittoCE23,
author = {Thomas Bellitto and
Cyril Conchon{-}Kerjan and
Bruno Escoffier},
editor = {David Doty and
Paul G. Spirakis},
title = {Restless Exploration of Periodic Temporal Graphs},
booktitle = {2nd Symposium on Algorithmic Foundations of Dynamic Networks, {SAND}
2023, June 19-21, 2023, Pisa, Italy},
series = {LIPIcs},
volume = {257},
pages = {13:1--13:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.SAND.2023.13},
doi = {10.4230/LIPICS.SAND.2023.13},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/sand/BellittoCE23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-01051,
author = {Pierre Aboulker and
Thomas Bellitto and
Fr{\'{e}}d{\'{e}}ric Havet and
Cl{\'{e}}ment Rambaud},
title = {On the minimum number of arcs in k-dicritical oriented graphs},
journal = {CoRR},
volume = {abs/2207.01051},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.01051},
doi = {10.48550/ARXIV.2207.01051},
eprinttype = {arXiv},
eprint = {2207.01051},
timestamp = {Wed, 06 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-01051.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-10727,
author = {Thomas Bellitto and
Christopher Duffy and
Gary MacGillivray},
title = {Homomorphically Full Oriented Graphs},
journal = {CoRR},
volume = {abs/2208.10727},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.10727},
doi = {10.48550/ARXIV.2208.10727},
eprinttype = {arXiv},
eprint = {2208.10727},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-10727.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-09936,
author = {Thomas Bellitto and
Nicolas Bousquet and
Adam Kabela and
Th{\'{e}}o Pierron},
title = {The smallest 5-chromatic tournament},
journal = {CoRR},
volume = {abs/2210.09936},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.09936},
doi = {10.48550/ARXIV.2210.09936},
eprinttype = {arXiv},
eprint = {2210.09936},
timestamp = {Mon, 24 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-09936.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BellittoPS21,
author = {Thomas Bellitto and
Arnaud P{\^{e}}cher and
Antoine S{\'{e}}dillot},
title = {On the density of sets of the Euclidean plane avoiding distance 1},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {23},
number = {1},
year = {2021},
url = {https://doi.org/10.46298/dmtcs.5153},
doi = {10.46298/DMTCS.5153},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmtcs/BellittoPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BellittoKMWY21,
author = {Thomas Bellitto and
Tereza Klimosov{\'{a}} and
Martin Merker and
Marcin Witkowski and
Yelena Yuditsky},
title = {Counterexamples to Thomassen's Conjecture on Decomposition of Cubic
Graphs},
journal = {Graphs Comb.},
volume = {37},
number = {6},
pages = {2595--2599},
year = {2021},
url = {https://doi.org/10.1007/s00373-021-02380-z},
doi = {10.1007/S00373-021-02380-Z},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BellittoKMWY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Bang-JensenBY21,
author = {J{\o}rgen Bang{-}Jensen and
Thomas Bellitto and
Anders Yeo},
title = {On Supereulerian 2-Edge-Coloured Graphs},
journal = {Graphs Comb.},
volume = {37},
number = {6},
pages = {2601--2620},
year = {2021},
url = {https://doi.org/10.1007/s00373-021-02377-8},
doi = {10.1007/S00373-021-02377-8},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/gc/Bang-JensenBY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Bang-JensenBY21,
author = {J{\o}rgen Bang{-}Jensen and
Thomas Bellitto and
Anders Yeo},
title = {Proper-walk connection number of graphs},
journal = {J. Graph Theory},
volume = {96},
number = {1},
pages = {137--159},
year = {2021},
url = {https://doi.org/10.1002/jgt.22609},
doi = {10.1002/JGT.22609},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/Bang-JensenBY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/JacobBDP21,
author = {Hugo Jacob and
Thomas Bellitto and
Oscar Defrain and
Marcin Pilipczuk},
editor = {Petr A. Golovach and
Meirav Zehavi},
title = {Close Relatives (Of Feedback Vertex Set), Revisited},
booktitle = {16th International Symposium on Parameterized and Exact Computation,
{IPEC} 2021, September 8-10, 2021, Lisbon, Portugal},
series = {LIPIcs},
volume = {214},
pages = {21:1--21:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2021.21},
doi = {10.4230/LIPICS.IPEC.2021.21},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/JacobBDP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-16015,
author = {Hugo Jacob and
Thomas Bellitto and
Oscar Defrain and
Marcin Pilipczuk},
title = {Close relatives (of Feedback Vertex Set), revisited},
journal = {CoRR},
volume = {abs/2106.16015},
year = {2021},
url = {https://arxiv.org/abs/2106.16015},
eprinttype = {arXiv},
eprint = {2106.16015},
timestamp = {Tue, 24 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-16015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-03102,
author = {Thomas Bellitto and
Caroline Brosse and
Benjamin L{\'{e}}v{\^{e}}que and
Aline Parreau},
title = {Locating Dominating Sets in local tournaments},
journal = {CoRR},
volume = {abs/2109.03102},
year = {2021},
url = {https://arxiv.org/abs/2109.03102},
eprinttype = {arXiv},
eprint = {2109.03102},
timestamp = {Mon, 20 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-03102.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/Bang-JensenBSS20,
author = {J{\o}rgen Bang{-}Jensen and
Thomas Bellitto and
Thomas Schweser and
Michael Stiebitz},
title = {Haj{\'{o}}s and Ore Constructions for Digraphs},
journal = {Electron. J. Comb.},
volume = {27},
number = {1},
pages = {1},
year = {2020},
url = {https://doi.org/10.37236/8942},
doi = {10.37236/8942},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/Bang-JensenBSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Bang-JensenBSS20,
author = {J{\o}rgen Bang{-}Jensen and
Thomas Bellitto and
Thomas Schweser and
Michael Stiebitz},
title = {On DP-coloring of digraphs},
journal = {J. Graph Theory},
volume = {95},
number = {1},
pages = {76--98},
year = {2020},
url = {https://doi.org/10.1002/jgt.22535},
doi = {10.1002/JGT.22535},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Bang-JensenBSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bang-JensenBLY20,
author = {J{\o}rgen Bang{-}Jensen and
Thomas Bellitto and
William Lochet and
Anders Yeo},
title = {The directed 2-linkage problem with length constraints},
journal = {Theor. Comput. Sci.},
volume = {814},
pages = {69--73},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.01.012},
doi = {10.1016/J.TCS.2020.01.012},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bang-JensenBLY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BellittoLOPS20,
author = {Thomas Bellitto and
Shaohua Li and
Karolina Okrasa and
Marcin Pilipczuk and
Manuel Sorge},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {The Complexity of Connectivity Problems in Forbidden-Transition Graphs
And Edge-Colored Graphs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {59:1--59:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.59},
doi = {10.4230/LIPICS.ISAAC.2020.59},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BellittoLOPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-12892,
author = {Thomas Bellitto and
Shaohua Li and
Karolina Okrasa and
Marcin Pilipczuk and
Manuel Sorge},
title = {The Complexity of Connectivity Problems in Forbidden-Transition Graphs
and Edge-Colored Graphs},
journal = {CoRR},
volume = {abs/2009.12892},
year = {2020},
url = {https://arxiv.org/abs/2009.12892},
eprinttype = {arXiv},
eprint = {2009.12892},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-12892.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/BachocBMP19,
author = {Christine Bachoc and
Thomas Bellitto and
Philippe Moustrou and
Arnaud P{\^{e}}cher},
title = {On the Density of Sets Avoiding Parallelohedron Distance 1},
journal = {Discret. Comput. Geom.},
volume = {62},
number = {3},
pages = {497--524},
year = {2019},
url = {https://doi.org/10.1007/s00454-019-00113-x},
doi = {10.1007/S00454-019-00113-X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/BachocBMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-00428,
author = {J{\o}rgen Bang{-}Jensen and
Thomas Bellitto and
Anders Yeo},
title = {Connecting edge-colouring},
journal = {CoRR},
volume = {abs/1907.00428},
year = {2019},
url = {http://arxiv.org/abs/1907.00428},
eprinttype = {arXiv},
eprint = {1907.00428},
timestamp = {Mon, 08 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-00428.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-00817,
author = {J{\o}rgen Bang{-}Jensen and
Thomas Bellitto and
William Lochet and
Anders Yeo},
title = {The directed 2-linkage problem with length constraints},
journal = {CoRR},
volume = {abs/1907.00817},
year = {2019},
url = {http://arxiv.org/abs/1907.00817},
eprinttype = {arXiv},
eprint = {1907.00817},
timestamp = {Mon, 08 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-00817.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/hal/Bellitto18,
author = {Thomas Bellitto},
title = {Walks, Transitions and Geometric Distances in Graphs. (Marches, Transitions
et Distances G{\'{e}}om{\'{e}}triques dans les Graphes)},
school = {University of Bordeaux, France},
year = {2018},
url = {https://tel.archives-ouvertes.fr/tel-01926589},
timestamp = {Tue, 21 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/hal/Bellitto18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BardBDMY18,
author = {Stefan Bard and
Thomas Bellitto and
Christopher Duffy and
Gary MacGillivray and
Feiran Yang},
title = {Complexity of locally-injective homomorphisms to tournaments},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {20},
number = {2},
year = {2018},
url = {https://doi.org/10.23638/DMTCS-20-2-4},
doi = {10.23638/DMTCS-20-2-4},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/BardBDMY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bellitto18,
author = {Thomas Bellitto},
title = {Separating codes and traffic monitoring},
journal = {Theor. Comput. Sci.},
volume = {717},
pages = {73--85},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.03.044},
doi = {10.1016/J.TCS.2017.03.044},
timestamp = {Wed, 14 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bellitto18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BellittoB18,
author = {Thomas Bellitto and
Benjamin Bergougnoux},
editor = {Andreas Brandst{\"{a}}dt and
Ekkehard K{\"{o}}hler and
Klaus Meer},
title = {On Minimum Connecting Transition Sets in Graphs},
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 = {40--51},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00256-5\_4},
doi = {10.1007/978-3-030-00256-5\_4},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BellittoB18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-08463,
author = {Thomas Bellitto and
Benjamin Bergougnoux},
title = {On Minimum Connecting Transition Sets in Graphs},
journal = {CoRR},
volume = {abs/1807.08463},
year = {2018},
url = {http://arxiv.org/abs/1807.08463},
eprinttype = {arXiv},
eprint = {1807.08463},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-08463.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-00960,
author = {Thomas Bellitto and
Arnaud P{\^{e}}cher and
Antoine S{\'{e}}dillot},
title = {On the density of sets of the Euclidean plane avoiding distance 1},
journal = {CoRR},
volume = {abs/1810.00960},
year = {2018},
url = {http://arxiv.org/abs/1810.00960},
eprinttype = {arXiv},
eprint = {1810.00960},
timestamp = {Thu, 01 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-00960.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-08825,
author = {Stefan Bard and
Thomas Bellitto and
Christopher Duffy and
Gary MacGillivray and
Feiran Yang},
title = {Complexity of locally-injective homomorphisms to tournaments},
journal = {CoRR},
volume = {abs/1710.08825},
year = {2017},
url = {http://arxiv.org/abs/1710.08825},
eprinttype = {arXiv},
eprint = {1710.08825},
timestamp = {Fri, 13 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-08825.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/Bellitto16,
author = {Thomas Bellitto},
editor = {Riccardo Dondi and
Guillaume Fertin and
Giancarlo Mauri},
title = {Separating Codes and Traffic Monitoring},
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 = {89--100},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-41168-2\_8},
doi = {10.1007/978-3-319-41168-2\_8},
timestamp = {Sun, 02 Oct 2022 15:53:30 +0200},
biburl = {https://dblp.org/rec/conf/aaim/Bellitto16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/peerjpre/BellittoMSK15,
author = {Thomas Bellitto and
Tobias Marschall and
Alexander Sch{\"{o}}nhuth and
Gunnar W. Klau},
title = {Next generation cluster editing},
journal = {PeerJ Prepr.},
volume = {3},
pages = {e1301},
year = {2015},
url = {https://doi.org/10.7287/peerj.preprints.1301v1},
doi = {10.7287/PEERJ.PREPRINTS.1301V1},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/peerjpre/BellittoMSK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BellittoMSK13,
author = {Thomas Bellitto and
Tobias Marschall and
Alexander Sch{\"{o}}nhuth and
Gunnar W. Klau},
title = {Next Generation Cluster Editing},
journal = {CoRR},
volume = {abs/1310.3353},
year = {2013},
url = {http://arxiv.org/abs/1310.3353},
eprinttype = {arXiv},
eprint = {1310.3353},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BellittoMSK13.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-09-18 23:39 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:
