default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiuseppe Lancia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j39]Giuseppe Lancia
, Marcello Dalpasso:
Algorithmic strategies for a fast exploration of the TSP 4-OPT neighborhood. J. Heuristics 30(3-4): 109-144 (2024)- [i4]Giuseppe Lancia, Paolo Vidoni:
Algorithmic strategies for finding the best TSP 2-OPT move in average sub-quadratic time. CoRR abs/2403.19878 (2024) - 2023
- [i3]Giuseppe Lancia, Marcello Dalpasso:
Orbits, schemes and dynamic programming procedures for the TSP 4-OPT neighborhood. CoRR abs/2303.14424 (2023) - 2021
- [j38]Giuseppe Lancia, Paolo Serafini:
Computational Complexity and ILP Models for Pattern Problems in the Logical Analysis of Data. Algorithms 14(8): 235 (2021) - 2020
- [j37]Giuseppe Lancia, Marcello Dalpasso:
Finding the Best 3-OPT Move in Subcubic Time. Algorithms 13(11): 306 (2020) - [j36]Giuseppe Lancia, Paolo Vidoni:
Finding the largest triangle in a graph in expected quadratic time. Eur. J. Oper. Res. 286(2): 458-467 (2020) - [c20]Giuseppe Lancia, Eleonora Pippia, Franca Rinaldi:
Using Integer Programming to Search for Counterexamples: A Case Study. MOTOR 2020: 69-84 - [i2]Robert D. Carr, Jennifer Iglesias, Giuseppe Lancia, Benjamin Moseley:
Symmetric Linear Programming Formulations for Minimum Cut with Applications to TSP. CoRR abs/2005.11912 (2020)
2010 – 2019
- 2019
- [j35]Giuseppe Lancia, Marcello Dalpasso:
FASTSET: A Fast Data Structure for the Representation of Sets of Integers. Algorithms 12(5): 91 (2019) - [c19]Giuseppe Lancia, Marcello Dalpasso:
Speeding-Up the Dynamic Programming Procedure for the Edit Distance of Two Strings. DEXA Workshops 2019: 59-66 - 2018
- [c18]Marcello Dalpasso, Giuseppe Lancia:
New Modeling Ideas for the Exact Solution of the Closest String Problem. DEXA Workshops 2018: 105-114 - 2017
- [j34]Giuseppe Lancia, Luke Mathieson, Pablo Moscato:
Separating sets of strings by finding matching patterns is almost always hard. Theor. Comput. Sci. 665: 73-86 (2017) - 2016
- [j33]Giuseppe Lancia, Paolo Serafini:
Deriving compact extended formulations via LP-based separation techniques. Ann. Oper. Res. 240(1): 321-350 (2016) - [j32]Giuseppe Lancia:
Algorithmic approaches for the single individual haplotyping problem. RAIRO Oper. Res. 50(2): 331-340 (2016) - [c17]Giuseppe Lancia, Paolo Serafini:
The Complexity of Some Pattern Problems in the Logical Analysis of Large Genomic Data Sets. IWBBIO 2016: 3-12 - [r2]Giuseppe Lancia:
Perfect Phylogeny Haplotyping. Encyclopedia of Algorithms 2016: 1553-1557 - [i1]Giuseppe Lancia, Luke Mathieson, Pablo Moscato:
Finding Patterns is Almost Always Hard. CoRR abs/1604.03243 (2016) - 2015
- [j31]Marcello Dalpasso, Giuseppe Lancia:
Estimating the strength of poker hands by integer linear programming techniques. Central Eur. J. Oper. Res. 23(3): 625-640 (2015) - [j30]Giuseppe Lancia, Franca Rinaldi, Paolo Serafini:
Local search inequalities. Discret. Optim. 16: 76-89 (2015) - [c16]Giuseppe Lancia, Franca Rinaldi, Paolo Serafini:
A Unified Integer Programming Model for Genome Rearrangement Problems. IWBBIO (1) 2015: 491-502 - 2014
- [j29]Giuseppe Lancia, Paolo Serafini:
Deriving compact extended formulations via LP-based separation techniques. 4OR 12(3): 201-234 (2014) - [j28]Robert D. Carr, Giuseppe Lancia:
Ramsey theory and integrality gap for the independent set problem. Oper. Res. Lett. 42(2): 137-139 (2014) - 2011
- [j27]Giuseppe Lancia, Franca Rinaldi, Paolo Serafini:
A time-indexed LP-based approach for min-sum job-shop problems. Ann. Oper. Res. 186(1): 175-198 (2011) - [j26]Giuseppe Lancia, Paolo Serafini:
An effective compact formulation of the max cut problem on sparse graphs. Electron. Notes Discret. Math. 37: 111-116 (2011) - 2010
- [j25]Leonardo Tininini, Paola Bertolazzi, Alessandra Godi, Giuseppe Lancia:
CollHaps: A Heuristic Approach to Haplotype Inference by Parsimony. IEEE ACM Trans. Comput. Biol. Bioinform. 7(3): 511-523 (2010) - [c15]Giuseppe Lancia, Romeo Rizzi, Russell Schwartz:
Tiling Binary Matrices in Haplotyping: Complexity, Models and Algorithms. Stringology 2010: 89-102
2000 – 2009
- 2009
- [j24]Giuseppe Lancia, Paolo Serafini:
A Set-Covering Approach with Column Generation for Parsimony Haplotyping. INFORMS J. Comput. 21(1): 151-166 (2009) - 2008
- [j23]Giuseppe Lancia:
Mathematical Programming in Computational Biology: an Annotated Bibliography. Algorithms 1(2): 100-129 (2008) - [j22]Paola Bertolazzi, Giovanni Felici, Paola Festa, Giuseppe Lancia:
Logic classification and feature selection for biomedical data. Comput. Math. Appl. 55(5): 889-899 (2008) - [j21]Giuseppe Lancia:
The phasing of heterozygous traits: Algorithms and complexity. Comput. Math. Appl. 55(5): 960-969 (2008) - [j20]Giuseppe Lancia, Franca Rinaldi, Romeo Rizzi:
Flipping Letters to minimize the Support of a String. Int. J. Found. Comput. Sci. 19(1): 5-17 (2008) - [j19]Giuseppe Lancia, R. Ravi, Romeo Rizzi:
Haplotyping for Disease Association: A Combinatorial Approach. IEEE ACM Trans. Comput. Biol. Bioinform. 5(2): 245-251 (2008) - [r1]Giuseppe Lancia:
Perfect Phylogeny Haplotyping. Encyclopedia of Algorithms 2008 - 2007
- [j18]Alberto Apostolico, Raffaele Giancarlo, Concettina Guerra, Giuseppe Lancia:
Articles selected from posters presented at the Tenth Annual International Conference on Research in Computational Biology - Preface. BMC Bioinform. 8(S-5) (2007) - 2006
- [j17]Giuseppe Lancia, Romeo Rizzi:
The approximability of the String Barcoding problem. Algorithms Mol. Biol. 1 (2006) - [j16]Giuseppe Lancia, Romeo Rizzi:
A polynomial case of the parsimony haplotyping problem. Oper. Res. Lett. 34(3): 289-295 (2006) - [c14]Giuseppe Lancia, Franca Rinaldi, Romeo Rizzi:
Flipping letters to minimize the support of a string. Stringology 2006: 9-17 - 2005
- [j15]Vineet Bafna, Sorin Istrail, Giuseppe Lancia, Romeo Rizzi:
Polynomial and APX-hard cases of the individual haplotyping problem. Theor. Comput. Sci. 335(1): 109-125 (2005) - [c13]Marcello Dalpasso, Giuseppe Lancia, Romeo Rizzi:
The String Barcoding Problem is NP-Hard. Comparative Genomics 2005: 88-96 - 2004
- [j14]Robert D. Carr, Giuseppe Lancia:
Compact optimization can outperform separation: A case study in structural proteomics. 4OR 2(3): 221-233 (2004) - [j13]Harvey J. Greenberg, William E. Hart, Giuseppe Lancia:
Opportunities for Combinatorial Optimization in Computational Biology. INFORMS J. Comput. 16(3): 211-231 (2004) - [j12]Giuseppe Lancia, Maria Cristina Pinotti, Romeo Rizzi:
Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms. INFORMS J. Comput. 16(4): 348-359 (2004) - [j11]Alberto Caprara, Robert D. Carr, Sorin Istrail, Giuseppe Lancia, Brian Walenz:
1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap. J. Comput. Biol. 11(1): 27-52 (2004) - [j10]Giuseppe Lancia:
Integer Programming Models for Computational Biology Problems. J. Comput. Sci. Technol. 19(1): 60-77 (2004) - 2003
- [j9]Vineet Bafna, Dan Gusfield, Giuseppe Lancia, Shibu Yooseph:
Haplotyping as Perfect Phylogeny: A Direct Approach. J. Comput. Biol. 10(3/4): 323-340 (2003) - [c12]Giuseppe Lancia, Sorin Istrail:
Protein Structure Comparison: Algorithms and Applications. Mathematical Methods for Protein Structure Analysis and Design 2003: 1-33 - 2002
- [j8]Ross Lippert, Russell Schwartz, Giuseppe Lancia, Sorin Istrail:
Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem. Briefings Bioinform. 3(1): 23-31 (2002) - [j7]Matteo Fischetti, Giuseppe Lancia, Paolo Serafini:
Exact algorithms for minimum routing cost trees. Networks 39(3): 161-173 (2002) - [j6]Robert D. Carr, Giuseppe Lancia:
Compact vs. exponential-size LP relaxations. Oper. Res. Lett. 30(1): 57-65 (2002) - [c11]Alberto Caprara, Giuseppe Lancia:
Optimal and Near - Optimal Solutions for 3D Structure Comparisons. 3DPVT 2002: 737-745 - [c10]Alberto Caprara, Giuseppe Lancia:
Structural alignment of large-size proteins via lagrangian relaxation. RECOMB 2002: 100-108 - [c9]Romeo Rizzi, Vineet Bafna, Sorin Istrail, Giuseppe Lancia:
Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem. WABI 2002: 29-43 - 2001
- [j5]Alberto Caprara, Giuseppe Lancia, See-Kiong Ng:
Sorting Permutations by Reversals Through Branch-and-Price. INFORMS J. Comput. 13(3): 224-244 (2001) - [c8]Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross Lippert, Russell Schwartz:
SNPs Problems, Complexity, and Algorithms. ESA 2001: 182-193 - [c7]Giuseppe Lancia, Robert D. Carr, Brian Walenz, Sorin Istrail:
101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem. RECOMB 2001: 193-202 - 2000
- [j4]Giuseppe Lancia:
Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan. Eur. J. Oper. Res. 120(2): 277-288 (2000) - [c6]Alberto Caprara, Giuseppe Lancia, See-Kiong Ng:
Fast practical solution of sorting by reversals. SODA 2000: 12-21 - [c5]Deborah Goldman, Sorin Istrail, Giuseppe Lancia, Antonio Piccolboni, Brian Walenz:
Algorithmic strategies in combinatorial chemistry. SODA 2000: 275-284
1990 – 1999
- 1999
- [j3]Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang:
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees. SIAM J. Comput. 29(3): 761-778 (1999) - [c4]Giuseppe Lancia, R. Ravi:
GESTALT: Genomic Steiner Alignments. CPM 1999: 101-114 - 1998
- [j2]Giuseppe Lancia, Mark Perlin:
Genotyping of Pooled Microsatellite Markers by Combinatorial Optimization Techniques. Discret. Appl. Math. 88(1-3): 291-314 (1998) - [j1]Egon Balas, Giuseppe Lancia, Paolo Serafini, Alkiviadis Vazacopoulos:
Job Shop Scheduling With Deadlines. J. Comb. Optim. 1(4): 329-353 (1998) - [c3]Alberto Caprara, Giuseppe Lancia, See-Kiong Ng:
A column-generation based branch-and-bound algorithm for sorting by reversals. Mathematical Support for Molecular Biology 1998: 213-226 - [c2]Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang:
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees. SODA 1998: 21-32 - 1997
- [c1]Amir Ben-Dor, Giuseppe Lancia, Jennifer Perone, R. Ravi:
Banishing Bias from Consensus Sequences. CPM 1997: 247-261
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:12 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:
