Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Giuseppe Lancia
@article{DBLP:journals/corr/abs-2403-19878,
author = {Giuseppe Lancia and
Paolo Vidoni},
title = {Algorithmic strategies for finding the best {TSP} 2-OPT move in average
sub-quadratic time},
journal = {CoRR},
volume = {abs/2403.19878},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.19878},
doi = {10.48550/ARXIV.2403.19878},
eprinttype = {arXiv},
eprint = {2403.19878},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-19878.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-14424,
author = {Giuseppe Lancia and
Marcello Dalpasso},
title = {Orbits, schemes and dynamic programming procedures for the {TSP} 4-OPT
neighborhood},
journal = {CoRR},
volume = {abs/2303.14424},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.14424},
doi = {10.48550/ARXIV.2303.14424},
eprinttype = {arXiv},
eprint = {2303.14424},
timestamp = {Fri, 14 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-14424.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/LanciaS21,
author = {Giuseppe Lancia and
Paolo Serafini},
title = {Computational Complexity and {ILP} Models for Pattern Problems in
the Logical Analysis of Data},
journal = {Algorithms},
volume = {14},
number = {8},
pages = {235},
year = {2021},
url = {https://doi.org/10.3390/a14080235},
doi = {10.3390/A14080235},
timestamp = {Mon, 25 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/LanciaS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/LanciaD20,
author = {Giuseppe Lancia and
Marcello Dalpasso},
title = {Finding the Best 3-OPT Move in Subcubic Time},
journal = {Algorithms},
volume = {13},
number = {11},
pages = {306},
year = {2020},
url = {https://doi.org/10.3390/a13110306},
doi = {10.3390/A13110306},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/LanciaD20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LanciaV20,
author = {Giuseppe Lancia and
Paolo Vidoni},
title = {Finding the largest triangle in a graph in expected quadratic time},
journal = {Eur. J. Oper. Res.},
volume = {286},
number = {2},
pages = {458--467},
year = {2020},
url = {https://doi.org/10.1016/j.ejor.2020.03.059},
doi = {10.1016/J.EJOR.2020.03.059},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/LanciaV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/motor/LanciaPR20,
author = {Giuseppe Lancia and
Eleonora Pippia and
Franca Rinaldi},
editor = {Alexander V. Kononov and
Michael Yu. Khachay and
Valeriy A. Kalyagin and
Panos M. Pardalos},
title = {Using Integer Programming to Search for Counterexamples: {A} Case
Study},
booktitle = {Mathematical Optimization Theory and Operations Research - 19th International
Conference, {MOTOR} 2020, Novosibirsk, Russia, July 6-10, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12095},
pages = {69--84},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-49988-4\_5},
doi = {10.1007/978-3-030-49988-4\_5},
timestamp = {Tue, 15 Jun 2021 13:49:14 +0200},
biburl = {https://dblp.org/rec/conf/motor/LanciaPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-11912,
author = {Robert D. Carr and
Jennifer Iglesias and
Giuseppe Lancia and
Benjamin Moseley},
title = {Symmetric Linear Programming Formulations for Minimum Cut with Applications
to {TSP}},
journal = {CoRR},
volume = {abs/2005.11912},
year = {2020},
url = {https://arxiv.org/abs/2005.11912},
eprinttype = {arXiv},
eprint = {2005.11912},
timestamp = {Thu, 28 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-11912.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/LanciaD19,
author = {Giuseppe Lancia and
Marcello Dalpasso},
title = {\texttt{FASTSET}: {A} Fast Data Structure for the Representation of
Sets of Integers},
journal = {Algorithms},
volume = {12},
number = {5},
pages = {91},
year = {2019},
url = {https://doi.org/10.3390/a12050091},
doi = {10.3390/A12050091},
timestamp = {Fri, 05 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/LanciaD19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dexaw/LanciaD19,
author = {Giuseppe Lancia and
Marcello Dalpasso},
editor = {Gabriele Anderst{-}Kotsis and
A Min Tjoa and
Ismail Khalil and
Mourad Elloumi and
Atif Mashkoor and
Johannes Sametinger and
Xabier Larrucea and
Anna Fensel and
Jorge Mart{\'{\i}}nez Gil and
Bernhard Moser and
Christin Seifert and
Benno Stein and
Michael Granitzer},
title = {Speeding-Up the Dynamic Programming Procedure for the Edit Distance
of Two Strings},
booktitle = {Database and Expert Systems Applications - {DEXA} 2019 International
Workshops BIOKDD, IWCFS, MLKgraphs and TIR, Linz, Austria, August
26-29, 2019, Proceedings},
series = {Communications in Computer and Information Science},
volume = {1062},
pages = {59--66},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-27684-3\_9},
doi = {10.1007/978-3-030-27684-3\_9},
timestamp = {Mon, 26 Jun 2023 20:42:59 +0200},
biburl = {https://dblp.org/rec/conf/dexaw/LanciaD19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dexaw/DalpassoL18,
author = {Marcello Dalpasso and
Giuseppe Lancia},
editor = {Mourad Elloumi and
Michael Granitzer and
Abdelkader Hameurlain and
Christin Seifert and
Benno Stein and
A Min Tjoa and
Roland R. Wagner},
title = {New Modeling Ideas for the Exact Solution of the Closest String Problem},
booktitle = {Database and Expert Systems Applications - {DEXA} 2018 International
Workshops, BDMICS, BIOKDD, and TIR, Regensburg, Germany, September
3-6, 2018, Proceedings},
series = {Communications in Computer and Information Science},
volume = {903},
pages = {105--114},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-99133-7\_8},
doi = {10.1007/978-3-319-99133-7\_8},
timestamp = {Tue, 29 Dec 2020 18:28:24 +0100},
biburl = {https://dblp.org/rec/conf/dexaw/DalpassoL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LanciaMM17,
author = {Giuseppe Lancia and
Luke Mathieson and
Pablo Moscato},
title = {Separating sets of strings by finding matching patterns is almost
always hard},
journal = {Theor. Comput. Sci.},
volume = {665},
pages = {73--86},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2016.12.018},
doi = {10.1016/J.TCS.2016.12.018},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LanciaMM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/LanciaS16,
author = {Giuseppe Lancia and
Paolo Serafini},
title = {Deriving compact extended formulations via LP-based separation techniques},
journal = {Ann. Oper. Res.},
volume = {240},
number = {1},
pages = {321--350},
year = {2016},
url = {https://doi.org/10.1007/s10479-015-2012-4},
doi = {10.1007/S10479-015-2012-4},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/anor/LanciaS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/Lancia16,
author = {Giuseppe Lancia},
title = {Algorithmic approaches for the single individual haplotyping problem},
journal = {{RAIRO} Oper. Res.},
volume = {50},
number = {2},
pages = {331--340},
year = {2016},
url = {https://doi.org/10.1051/ro/2015037},
doi = {10.1051/RO/2015037},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rairo/Lancia16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwbbio/LanciaS16,
author = {Giuseppe Lancia and
Paolo Serafini},
editor = {Francisco M. Ortu{\~{n}}o Guzman and
Ignacio Rojas},
title = {The Complexity of Some Pattern Problems in the Logical Analysis of
Large Genomic Data Sets},
booktitle = {Bioinformatics and Biomedical Engineering - 4th International Conference,
{IWBBIO} 2016, Granada, Spain, April 20-22, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9656},
pages = {3--12},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-31744-1\_1},
doi = {10.1007/978-3-319-31744-1\_1},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwbbio/LanciaS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Lancia16,
author = {Giuseppe Lancia},
title = {Perfect Phylogeny Haplotyping},
booktitle = {Encyclopedia of Algorithms},
pages = {1553--1557},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_289},
doi = {10.1007/978-1-4939-2864-4\_289},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Lancia16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LanciaMM16,
author = {Giuseppe Lancia and
Luke Mathieson and
Pablo Moscato},
title = {Finding Patterns is Almost Always Hard},
journal = {CoRR},
volume = {abs/1604.03243},
year = {2016},
url = {http://arxiv.org/abs/1604.03243},
eprinttype = {arXiv},
eprint = {1604.03243},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LanciaMM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cejor/DalpassoL15,
author = {Marcello Dalpasso and
Giuseppe Lancia},
title = {Estimating the strength of poker hands by integer linear programming
techniques},
journal = {Central Eur. J. Oper. Res.},
volume = {23},
number = {3},
pages = {625--640},
year = {2015},
url = {https://doi.org/10.1007/s10100-014-0366-3},
doi = {10.1007/S10100-014-0366-3},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cejor/DalpassoL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/LanciaRS15,
author = {Giuseppe Lancia and
Franca Rinaldi and
Paolo Serafini},
title = {Local search inequalities},
journal = {Discret. Optim.},
volume = {16},
pages = {76--89},
year = {2015},
url = {https://doi.org/10.1016/j.disopt.2015.02.003},
doi = {10.1016/J.DISOPT.2015.02.003},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/LanciaRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwbbio/LanciaRS15,
author = {Giuseppe Lancia and
Franca Rinaldi and
Paolo Serafini},
editor = {Francisco M. Ortu{\~{n}}o Guzman and
Ignacio Rojas},
title = {A Unified Integer Programming Model for Genome Rearrangement Problems},
booktitle = {Bioinformatics and Biomedical Engineering - Third International Conference,
{IWBBIO} 2015, Granada, Spain, April 15-17, 2015. Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {9043},
pages = {491--502},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-16483-0\_48},
doi = {10.1007/978-3-319-16483-0\_48},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwbbio/LanciaRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/LanciaS14,
author = {Giuseppe Lancia and
Paolo Serafini},
title = {Deriving compact extended formulations via LP-based separation techniques},
journal = {4OR},
volume = {12},
number = {3},
pages = {201--234},
year = {2014},
url = {https://doi.org/10.1007/s10288-014-0262-7},
doi = {10.1007/S10288-014-0262-7},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/4or/LanciaS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/CarrL14,
author = {Robert D. Carr and
Giuseppe Lancia},
title = {Ramsey theory and integrality gap for the independent set problem},
journal = {Oper. Res. Lett.},
volume = {42},
number = {2},
pages = {137--139},
year = {2014},
url = {https://doi.org/10.1016/j.orl.2014.01.007},
doi = {10.1016/J.ORL.2014.01.007},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/CarrL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/LanciaRS11,
author = {Giuseppe Lancia and
Franca Rinaldi and
Paolo Serafini},
title = {A time-indexed LP-based approach for min-sum job-shop problems},
journal = {Ann. Oper. Res.},
volume = {186},
number = {1},
pages = {175--198},
year = {2011},
url = {https://doi.org/10.1007/s10479-010-0832-9},
doi = {10.1007/S10479-010-0832-9},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/anor/LanciaRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LanciaS11,
author = {Giuseppe Lancia and
Paolo Serafini},
title = {An effective compact formulation of the max cut problem on sparse
graphs},
journal = {Electron. Notes Discret. Math.},
volume = {37},
pages = {111--116},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.05.020},
doi = {10.1016/J.ENDM.2011.05.020},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LanciaS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/TinininiBGL10,
author = {Leonardo Tininini and
Paola Bertolazzi and
Alessandra Godi and
Giuseppe Lancia},
title = {CollHaps: {A} Heuristic Approach to Haplotype Inference by Parsimony},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {7},
number = {3},
pages = {511--523},
year = {2010},
url = {https://doi.org/10.1109/TCBB.2008.130},
doi = {10.1109/TCBB.2008.130},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/TinininiBGL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/LanciaRS10,
author = {Giuseppe Lancia and
Romeo Rizzi and
Russell Schwartz},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {Tiling Binary Matrices in Haplotyping: Complexity, Models and Algorithms},
booktitle = {Proceedings of the Prague Stringology Conference 2010, Prague, Czech
Republic, August 30 - September 1, 2010},
pages = {89--102},
publisher = {Prague Stringology Club, Department of Theoretical Computer Science,
Faculty of Information Technology, Czech Technical University in Prague},
year = {2010},
url = {http://www.stringology.org/event/2010/p08.html},
timestamp = {Wed, 10 Feb 2021 08:42:22 +0100},
biburl = {https://dblp.org/rec/conf/stringology/LanciaRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/LanciaS09,
author = {Giuseppe Lancia and
Paolo Serafini},
title = {A Set-Covering Approach with Column Generation for Parsimony Haplotyping},
journal = {{INFORMS} J. Comput.},
volume = {21},
number = {1},
pages = {151--166},
year = {2009},
url = {https://doi.org/10.1287/ijoc.1080.0285},
doi = {10.1287/IJOC.1080.0285},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/LanciaS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/Lancia08,
author = {Giuseppe Lancia},
title = {Mathematical Programming in Computational Biology: an Annotated Bibliography},
journal = {Algorithms},
volume = {1},
number = {2},
pages = {100--129},
year = {2008},
url = {https://doi.org/10.3390/a1020100},
doi = {10.3390/A1020100},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithms/Lancia08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cma/BertolazziFFL08,
author = {Paola Bertolazzi and
Giovanni Felici and
Paola Festa and
Giuseppe Lancia},
title = {Logic classification and feature selection for biomedical data},
journal = {Comput. Math. Appl.},
volume = {55},
number = {5},
pages = {889--899},
year = {2008},
url = {https://doi.org/10.1016/j.camwa.2006.12.093},
doi = {10.1016/J.CAMWA.2006.12.093},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cma/BertolazziFFL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cma/Lancia08,
author = {Giuseppe Lancia},
title = {The phasing of heterozygous traits: Algorithms and complexity},
journal = {Comput. Math. Appl.},
volume = {55},
number = {5},
pages = {960--969},
year = {2008},
url = {https://doi.org/10.1016/j.camwa.2006.12.089},
doi = {10.1016/J.CAMWA.2006.12.089},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cma/Lancia08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/LanciaRR08,
author = {Giuseppe Lancia and
Franca Rinaldi and
Romeo Rizzi},
title = {Flipping Letters to minimize the Support of a String},
journal = {Int. J. Found. Comput. Sci.},
volume = {19},
number = {1},
pages = {5--17},
year = {2008},
url = {https://doi.org/10.1142/S0129054108005504},
doi = {10.1142/S0129054108005504},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/LanciaRR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/LanciaRR08,
author = {Giuseppe Lancia and
R. Ravi and
Romeo Rizzi},
title = {Haplotyping for Disease Association: {A} Combinatorial Approach},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {5},
number = {2},
pages = {245--251},
year = {2008},
url = {https://doi.org/10.1109/TCBB.2007.70255},
doi = {10.1109/TCBB.2007.70255},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/LanciaRR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Lancia08,
author = {Giuseppe Lancia},
editor = {Ming{-}Yang Kao},
title = {Perfect Phylogeny Haplotyping},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_289},
doi = {10.1007/978-0-387-30162-4\_289},
timestamp = {Thu, 27 Jun 2019 16:25:31 +0200},
biburl = {https://dblp.org/rec/reference/algo/Lancia08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/ApostolicoGGL07,
author = {Alberto Apostolico and
Raffaele Giancarlo and
Concettina Guerra and
Giuseppe Lancia},
title = {Articles selected from posters presented at the Tenth Annual International
Conference on Research in Computational Biology - Preface},
journal = {{BMC} Bioinform.},
volume = {8},
number = {{S-5}},
year = {2007},
url = {https://doi.org/10.1186/1471-2105-8-S5-S1},
doi = {10.1186/1471-2105-8-S5-S1},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bmcbi/ApostolicoGGL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/LanciaR06,
author = {Giuseppe Lancia and
Romeo Rizzi},
title = {The approximability of the String Barcoding problem},
journal = {Algorithms Mol. Biol.},
volume = {1},
year = {2006},
url = {https://doi.org/10.1186/1748-7188-1-12},
doi = {10.1186/1748-7188-1-12},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/almob/LanciaR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LanciaR06,
author = {Giuseppe Lancia and
Romeo Rizzi},
title = {A polynomial case of the parsimony haplotyping problem},
journal = {Oper. Res. Lett.},
volume = {34},
number = {3},
pages = {289--295},
year = {2006},
url = {https://doi.org/10.1016/j.orl.2005.05.007},
doi = {10.1016/J.ORL.2005.05.007},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/LanciaR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/LanciaRR06,
author = {Giuseppe Lancia and
Franca Rinaldi and
Romeo Rizzi},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {Flipping letters to minimize the support of a string},
booktitle = {Proceedings of the Prague Stringology Conference, Prague, Czech Republic,
August 28-30, 2006},
pages = {9--17},
publisher = {Department of Computer Science and Engineering, Faculty of Electrical
Engineering, Czech Technical University},
year = {2006},
url = {http://www.stringology.org/event/2006/p03.html},
timestamp = {Wed, 10 Feb 2021 08:42:24 +0100},
biburl = {https://dblp.org/rec/conf/stringology/LanciaRR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BafnaILR05,
author = {Vineet Bafna and
Sorin Istrail and
Giuseppe Lancia and
Romeo Rizzi},
title = {Polynomial and APX-hard cases of the individual haplotyping problem},
journal = {Theor. Comput. Sci.},
volume = {335},
number = {1},
pages = {109--125},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2004.12.017},
doi = {10.1016/J.TCS.2004.12.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BafnaILR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/DalpassoLR05,
author = {Marcello Dalpasso and
Giuseppe Lancia and
Romeo Rizzi},
editor = {Aoife McLysaght and
Daniel H. Huson},
title = {The String Barcoding Problem is NP-Hard},
booktitle = {Comparative Genomics, {RECOMB} 2005 International Workshop, {RCG}
2005, Dublin, Ireland, September 18-20, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3678},
pages = {88--96},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11554714\_8},
doi = {10.1007/11554714\_8},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/recomb/DalpassoLR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/CarrL04,
author = {Robert D. Carr and
Giuseppe Lancia},
title = {Compact optimization can outperform separation: {A} case study in
structural proteomics},
journal = {4OR},
volume = {2},
number = {3},
pages = {221--233},
year = {2004},
url = {https://doi.org/10.1007/s10288-004-0036-8},
doi = {10.1007/S10288-004-0036-8},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/4or/CarrL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/GreenbergHL04,
author = {Harvey J. Greenberg and
William E. Hart and
Giuseppe Lancia},
title = {Opportunities for Combinatorial Optimization in Computational Biology},
journal = {{INFORMS} J. Comput.},
volume = {16},
number = {3},
pages = {211--231},
year = {2004},
url = {https://doi.org/10.1287/ijoc.1040.0073},
doi = {10.1287/IJOC.1040.0073},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/informs/GreenbergHL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/LanciaPR04,
author = {Giuseppe Lancia and
Maria Cristina Pinotti and
Romeo Rizzi},
title = {Haplotyping Populations by Pure Parsimony: Complexity of Exact and
Approximation Algorithms},
journal = {{INFORMS} J. Comput.},
volume = {16},
number = {4},
pages = {348--359},
year = {2004},
url = {https://doi.org/10.1287/ijoc.1040.0085},
doi = {10.1287/IJOC.1040.0085},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/LanciaPR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/CapraraCILW04,
author = {Alberto Caprara and
Robert D. Carr and
Sorin Istrail and
Giuseppe Lancia and
Brian Walenz},
title = {1001 Optimal {PDB} Structure Alignments: Integer Programming Methods
for Finding the Maximum Contact Map Overlap},
journal = {J. Comput. Biol.},
volume = {11},
number = {1},
pages = {27--52},
year = {2004},
url = {https://doi.org/10.1089/106652704773416876},
doi = {10.1089/106652704773416876},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/CapraraCILW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcst/Lancia04,
author = {Giuseppe Lancia},
title = {Integer Programming Models for Computational Biology Problems},
journal = {J. Comput. Sci. Technol.},
volume = {19},
number = {1},
pages = {60--77},
year = {2004},
url = {https://doi.org/10.1007/BF02944785},
doi = {10.1007/BF02944785},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcst/Lancia04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/BafnaGLY03,
author = {Vineet Bafna and
Dan Gusfield and
Giuseppe Lancia and
Shibu Yooseph},
title = {Haplotyping as Perfect Phylogeny: {A} Direct Approach},
journal = {J. Comput. Biol.},
volume = {10},
number = {3/4},
pages = {323--340},
year = {2003},
url = {https://doi.org/10.1089/10665270360688048},
doi = {10.1089/10665270360688048},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/BafnaGLY03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/msps/LanciaI03,
author = {Giuseppe Lancia and
Sorin Istrail},
editor = {Concettina Guerra and
Sorin Istrail},
title = {Protein Structure Comparison: Algorithms and Applications},
booktitle = {Mathematical Methods for Protein Structure Analysis and Design, Advanced
Lectures},
series = {Lecture Notes in Computer Science},
volume = {2666},
pages = {1--33},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-44827-3\_1},
doi = {10.1007/978-3-540-44827-3\_1},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/msps/LanciaI03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bib/LippertSLI02,
author = {Ross Lippert and
Russell Schwartz and
Giuseppe Lancia and
Sorin Istrail},
title = {Algorithmic strategies for the single nucleotide polymorphism haplotype
assembly problem},
journal = {Briefings Bioinform.},
volume = {3},
number = {1},
pages = {23--31},
year = {2002},
url = {https://doi.org/10.1093/bib/3.1.23},
doi = {10.1093/BIB/3.1.23},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bib/LippertSLI02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FischettiLS02,
author = {Matteo Fischetti and
Giuseppe Lancia and
Paolo Serafini},
title = {Exact algorithms for minimum routing cost trees},
journal = {Networks},
volume = {39},
number = {3},
pages = {161--173},
year = {2002},
url = {https://doi.org/10.1002/net.10022},
doi = {10.1002/NET.10022},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/FischettiLS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/CarrL02,
author = {Robert D. Carr and
Giuseppe Lancia},
title = {Compact vs. exponential-size {LP} relaxations},
journal = {Oper. Res. Lett.},
volume = {30},
number = {1},
pages = {57--65},
year = {2002},
url = {https://doi.org/10.1016/S0167-6377(01)00106-7},
doi = {10.1016/S0167-6377(01)00106-7},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/CarrL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/3dpvt/CapraraL02,
author = {Alberto Caprara and
Giuseppe Lancia},
title = {Optimal and Near - Optimal Solutions for 3D Structure Comparisons},
booktitle = {1st International Symposium on 3D Data Processing Visualization and
Transmission {(3DPVT} 2002), 19-21 June 2002, Padova, Italy},
pages = {737--745},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/TDPVT.2002.1024151},
doi = {10.1109/TDPVT.2002.1024151},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/3dpvt/CapraraL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/CapraraL02,
author = {Alberto Caprara and
Giuseppe Lancia},
editor = {Gene Myers and
Sridhar Hannenhalli and
David Sankoff and
Sorin Istrail and
Pavel A. Pevzner and
Michael S. Waterman},
title = {Structural alignment of large-size proteins via lagrangian relaxation},
booktitle = {Proceedings of the Sixth Annual International Conference on Computational
Biology, {RECOMB} 2002, Washington, DC, USA, April 18-21, 2002},
pages = {100--108},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/565196.565209},
doi = {10.1145/565196.565209},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/recomb/CapraraL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/RizziBIL02,
author = {Romeo Rizzi and
Vineet Bafna and
Sorin Istrail and
Giuseppe Lancia},
editor = {Roderic Guig{\'{o}} and
Dan Gusfield},
title = {Practical Algorithms and Fixed-Parameter Tractability for the Single
Individual {SNP} Haplotyping Problem},
booktitle = {Algorithms in Bioinformatics, Second International Workshop, {WABI}
2002, Rome, Italy, September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2452},
pages = {29--43},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45784-4\_3},
doi = {10.1007/3-540-45784-4\_3},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wabi/RizziBIL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/CapraraLN01,
author = {Alberto Caprara and
Giuseppe Lancia and
See{-}Kiong Ng},
title = {Sorting Permutations by Reversals Through Branch-and-Price},
journal = {{INFORMS} J. Comput.},
volume = {13},
number = {3},
pages = {224--244},
year = {2001},
url = {https://doi.org/10.1287/ijoc.13.3.224.12631},
doi = {10.1287/IJOC.13.3.224.12631},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/CapraraLN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/LanciaBILS01,
author = {Giuseppe Lancia and
Vineet Bafna and
Sorin Istrail and
Ross Lippert and
Russell Schwartz},
editor = {Friedhelm Meyer auf der Heide},
title = {SNPs Problems, Complexity, and Algorithms},
booktitle = {Algorithms - {ESA} 2001, 9th Annual European Symposium, Aarhus, Denmark,
August 28-31, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2161},
pages = {182--193},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44676-1\_15},
doi = {10.1007/3-540-44676-1\_15},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/LanciaBILS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/LanciaCWI01,
author = {Giuseppe Lancia and
Robert D. Carr and
Brian Walenz and
Sorin Istrail},
editor = {Thomas Lengauer},
title = {101 optimal {PDB} structure alignments: a branch-and-cut algorithm
for the maximum contact map overlap problem},
booktitle = {Proceedings of the Fifth Annual International Conference on Computational
Biology, {RECOMB} 2001, Montr{\'{e}}al, Qu{\'{e}}bec, Canada,
April 22-25, 2001},
pages = {193--202},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/369133.369199},
doi = {10.1145/369133.369199},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/LanciaCWI01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Lancia00,
author = {Giuseppe Lancia},
title = {Scheduling jobs with release dates and tails on two unrelated parallel
machines to minimize the makespan},
journal = {Eur. J. Oper. Res.},
volume = {120},
number = {2},
pages = {277--288},
year = {2000},
url = {https://doi.org/10.1016/S0377-2217(99)00156-3},
doi = {10.1016/S0377-2217(99)00156-3},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/Lancia00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CapraraLN00,
author = {Alberto Caprara and
Giuseppe Lancia and
See{-}Kiong Ng},
editor = {David B. Shmoys},
title = {Fast practical solution of sorting by reversals},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {12--21},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338226},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/CapraraLN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoldmanILPW00,
author = {Deborah Goldman and
Sorin Istrail and
Giuseppe Lancia and
Antonio Piccolboni and
Brian Walenz},
editor = {David B. Shmoys},
title = {Algorithmic strategies in combinatorial chemistry},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {275--284},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338263},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GoldmanILPW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/WuLBCRT99,
author = {Bang Ye Wu and
Giuseppe Lancia and
Vineet Bafna and
Kun{-}Mao Chao and
R. Ravi and
Chuan Yi Tang},
title = {A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning
Trees},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {761--778},
year = {1999},
url = {https://doi.org/10.1137/S009753979732253X},
doi = {10.1137/S009753979732253X},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/WuLBCRT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/LanciaR99,
author = {Giuseppe Lancia and
R. Ravi},
editor = {Maxime Crochemore and
Mike Paterson},
title = {{GESTALT:} Genomic Steiner Alignments},
booktitle = {Combinatorial Pattern Matching, 10th Annual Symposium, {CPM} 99, Warwick
University, UK, July 22-24, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1645},
pages = {101--114},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48452-3\_8},
doi = {10.1007/3-540-48452-3\_8},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/LanciaR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LanciaP98,
author = {Giuseppe Lancia and
Mark Perlin},
title = {Genotyping of Pooled Microsatellite Markers by Combinatorial Optimization
Techniques},
journal = {Discret. Appl. Math.},
volume = {88},
number = {1-3},
pages = {291--314},
year = {1998},
url = {https://doi.org/10.1016/S0166-218X(98)80006-1},
doi = {10.1016/S0166-218X(98)80006-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LanciaP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BalasLSV98,
author = {Egon Balas and
Giuseppe Lancia and
Paolo Serafini and
Alkiviadis Vazacopoulos},
title = {Job Shop Scheduling With Deadlines},
journal = {J. Comb. Optim.},
volume = {1},
number = {4},
pages = {329--353},
year = {1998},
url = {https://doi.org/10.1023/A:1009750409895},
doi = {10.1023/A:1009750409895},
timestamp = {Tue, 12 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BalasLSV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/CapraraLN98,
author = {Alberto Caprara and
Giuseppe Lancia and
See{-}Kiong Ng},
editor = {Martin Farach{-}Colton and
Fred S. Roberts and
Martin Vingron and
Michael S. Waterman},
title = {A column-generation based branch-and-bound algorithm for sorting by
reversals},
booktitle = {Mathematical Support for Molecular Biology, Proceedings from the {DIMACS}
Special Year, 1998},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {47},
pages = {213--226},
publisher = {{DIMACS/AMS}},
year = {1998},
url = {https://doi.org/10.1090/dimacs/047/10},
doi = {10.1090/DIMACS/047/10},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/CapraraLN98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/WuLBCRT98,
author = {Bang Ye Wu and
Giuseppe Lancia and
Vineet Bafna and
Kun{-}Mao Chao and
R. Ravi and
Chuan Yi Tang},
editor = {Howard J. Karloff},
title = {A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning
Trees},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {21--32},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.314628},
timestamp = {Thu, 05 Jul 2018 07:29:49 +0200},
biburl = {https://dblp.org/rec/conf/soda/WuLBCRT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Ben-DorLPR97,
author = {Amir Ben{-}Dor and
Giuseppe Lancia and
Jennifer Perone and
R. Ravi},
editor = {Alberto Apostolico and
Jotun Hein},
title = {Banishing Bias from Consensus Sequences},
booktitle = {Combinatorial Pattern Matching, 8th Annual Symposium, {CPM} 97, Aarhus,
Denmark, June 30 - July 2, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1264},
pages = {247--261},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63220-4\_63},
doi = {10.1007/3-540-63220-4\_63},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/Ben-DorLPR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-21 17:20 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:
