activity
20162024
most citedProving hamiltonian properties in connected 4-regular graphs: an ILP-based approach

1 citations · 2 across the 4 of their papers we have counts for

collaborators

5 papers

stat.AP2024

Data-Driven Strategies for Detecting and Sampling Misrepresented Subgroups

G. Lancia, F. Mecatti, E. Riccomagno

Economic policy research frequently examines population well-being, with a particular focus on the relationships between unequal living conditions, low educational attainment, and…

cs.DS2023★ 1 cited

Orbits, schemes and dynamic programming procedures for the TSP 4-OPT neighborhood

Giuseppe Lancia, Marcello Dalpasso

We discuss the way to group all 25 possible 4-OPT moves into 7 orbits of equivalent moves. We then describe two implementations, one for a algorithm by de Berg's et al. an…

math.CO2021★ 1 cited

Proving hamiltonian properties in connected 4-regular graphs: an ILP-based approach

Giuseppe Lancia, Eleonora Pippia, Franca Rinaldi

In this paper we study some open questions related to the smallest order of a 4-regular graph which has a connectivity property but does not…

cs.DS2020

Symmetric Linear Programming Formulations for Minimum Cut with Applications to TSP

Robert D. Carr, Jennifer Iglesias, Giuseppe Lanciac +1

We introduce multiple symmetric LP relaxations for minimum cut problems. The relaxations give optimal and approximate solutions when the input is a Hamiltonian cycle. We show that…

cs.CC2016

Separating Sets of Strings by Finding Matching Patterns is Almost Always Hard

Giuseppe Lancia, Luke Mathieson, Pablo Moscato

We study the complexity of the problem of searching for a set of patterns that separate two given sets of strings. This problem has applications in a wide variety of areas, most no…