default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlberto Del Lungo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j31]Alberto Del Lungo, Claudio Marini, Elisa Mori:
A polynomial-time algorithm for finding zero-sums. Discret. Math. 309(9): 2658-2662 (2009)- 2008
- [j30]Sara Brunetti
, Alberto Del Lungo, Peter Gritzmann, Sven de Vries:
On the reconstruction of binary and permutation matrices under (binary) tomographic constraints. Theor. Comput. Sci. 406(1-2): 63-71 (2008) - 2005
- [j29]Alberto Del Lungo, Guy Louchard, Claudio Marini, Franco Montagna:
The Guessing Secrets problem: a probabilistic approach. J. Algorithms 55(2): 142-176 (2005) - 2004
- [j28]Sara Brunetti, Alberto Del Lungo:
On the polynomial 1[n]qnkq. Adv. Appl. Math. 33(3): 487-491 (2004) - [j27]Alberto Del Lungo, Enrica Duchi, Andrea Frosini, Simone Rinaldi:
On the Generation and Enumeration of some Classes of Convex Polyominoes. Electron. J. Comb. 11(1) (2004) - [j26]Alberto Del Lungo, Maurice Nivat, Renzo Pinzani, Simone Rinaldi:
A bijection for the total area of parallelogram polyominoes. Discret. Appl. Math. 144(3): 291-302 (2004) - 2003
- [j25]Alberto Del Lungo, Vito Di Gesù, Attila Kuba:
9th International Workshop on Combinatorial Image Analysis: Volume 12 Palermo (Italy), May 14-16, 2003. Electron. Notes Discret. Math. 12: 1-2 (2003) - [j24]Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi:
Text sparsification via local maxima. Theor. Comput. Sci. 304(1-3): 341-364 (2003) - [c12]Alberto Del Lungo, Enrica Duchi, Andrea Frosini, Simone Rinaldi:
Enumeration of convex polyominoes using the ECO method. DMCS 2003: 103-116 - [c11]Alberto Del Lungo, Andrea Frosini, Simone Rinaldi:
ECO Method and the Exhaustive Generation of Convex Polyominoes. DMTCS 2003: 129-140 - 2002
- [j23]Sara Brunetti, Alberto Del Lungo, Francesco Del Ristoro:
A cycle lemma for permutation inversions. Discret. Math. 257(1): 1-13 (2002) - [j22]Alberto Del Lungo:
Reconstructing permutation matrices from diagonal sums. Theor. Comput. Sci. 281(1-2): 235-249 (2002) - [c10]Emese Balogh, Attila Kuba, Alberto Del Lungo, Maurice Nivat:
Reconstruction of Binary Matrices from Absorbed Projections. DGCI 2002: 392-403 - [c9]Alberto Del Lungo, Andrea Frosini, Maurice Nivat, Laurent Vuillon:
Discrete Tomography: Reconstruction under Periodicity Constraints. ICALP 2002: 38-56 - 2001
- [j21]Elena Barcucci, Alberto Del Lungo, Andrea Frosini, Simone Rinaldi:
A Technology for Reverse-Engineering a Combinatorial Problem from a Rational Generating Function. Adv. Appl. Math. 26(2): 129-153 (2001) - [j20]Sara Brunetti, Alberto Del Lungo, Francesco Del Ristoro:
An Equipartition Property for the Distribution of Multiset Permutation Inversions. Adv. Appl. Math. 27(1): 41-50 (2001) - [j19]Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
Some permutations with forbidden subsequences and their inversion number. Discret. Math. 234(1-3): 1-15 (2001) - [j18]Elena Barcucci, Sara Brunetti, Alberto Del Lungo, Maurice Nivat:
Reconstruction of lattice sets from their horizontal, vertical and diagonal X-rays. Discret. Math. 241(1-3): 65-78 (2001) - [c8]Alberto Del Lungo, Massimo Mirolli, Renzo Pinzani, Simone Rinaldi:
A Bijection for Directed-Convex Polyominoes. DM-CCG 2001: 133-144 - 2000
- [j17]Alain Daurat, Alberto Del Lungo, Maurice Nivat:
Medians of Discrete Sets according to a Linear Distance. Discret. Comput. Geom. 23(4): 465-484 (2000) - [j16]Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
From Motzkin to Catalan permutations. Discret. Math. 217(1-3): 33-49 (2000) - [j15]Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
Permutations avoiding an increasing number of length-increasing forbidden subsequences. Discret. Math. Theor. Comput. Sci. 4(1): 31-44 (2000) - [j14]Alberto Del Lungo, Francesco Del Ristoro, Jean-Guy Penaud:
Left ternary trees and non-separable rooted planar maps. Theor. Comput. Sci. 233(1-2): 201-215 (2000) - [c7]Elena Barcucci, Sara Brunetti, Alberto Del Lungo, Maurice Nivat:
Reconstruction of Discrete Sets from Three or More X-Rays. CIAC 2000: 199-210 - [c6]Sara Brunetti, Alain Daurat, Alberto Del Lungo:
An Algorithm for Reconstructing Special Lattice Sets from Their Approximate X-Rays. DGCI 2000: 113-125 - [c5]Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi:
Text Sparsification via Local Maxima. FSTTCS 2000: 290-301
1990 – 1999
- 1999
- [j13]Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
Directed animals, forests and permutations. Discret. Math. 204(1-3): 41-71 (1999) - [j12]Elena Barcucci, Alberto Del Lungo, Elisa Pergola:
Random Generation of Trees and Other Combinatorial Objects. Theor. Comput. Sci. 218(2): 219-232 (1999) - [c4]Alessandro Bellini, Alberto Del Lungo, Fabio Gori, Roberto Grossi, Marco Guarducci:
A Fast H.261 Software Codec for High Quality Videoconferencing on PCs. ICMCS, Vol. 2 1999: 1007-1008 - 1998
- [j11]Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
A methodology for plane tree enumeration. Discret. Math. 180(1-3): 45-64 (1998) - [j10]Elena Barcucci, Alberto Del Lungo, Jean-Marc Fedou, Renzo Pinzani:
Steep polyominoes, q-Motzkin numbers and q-Bessel functions. Discret. Math. 189(1-3): 21-42 (1998) - [j9]Elena Barcucci, Sara Brunetti, Alberto Del Lungo, Francesco Del Ristoro:
A combinatorial interpretation of the recurrence fn+1 = 6fn - fn-1. Discret. Math. 190(1-3): 235-240 (1998) - [j8]Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani:
Medians of polyominoes: A property for reconstruction. Int. J. Imaging Syst. Technol. 9(2-3): 69-77 (1998) - [j7]Alberto Del Lungo, Maurice Nivat, Renzo Pinzani, L. Sorri:
The Medians of Discrete Sets. Inf. Process. Lett. 65(6): 293-299 (1998) - 1997
- [j6]Elena Barcucci, Alberto Del Lungo, S. Fezzi, Renzo Pinzani:
Nondecreasing Dyck paths and q-Fibonacci numbers. Discret. Math. 170(1-3): 211-217 (1997) - [c3]Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani, A. Zurli:
Reconstructing Digital Sets from X-Rays. ICIAP (1) 1997: 166-173 - 1996
- [j5]Alberto Del Lungo, Maurice Nivat, Renzo Pinzani:
The number of convex polyominoes reconstructible from their orthogonal projections. Discret. Math. 157(1-3): 65-78 (1996) - [j4]Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani:
Reconstructing Convex Polyominoes from Horizontal and Vertical Projections. Theor. Comput. Sci. 155(2): 321-347 (1996) - [j3]Elena Barcucci, Alberto Del Lungo, Renzo Pinzani:
"Deco" Polyominoes, Permutations and Random Generation. Theor. Comput. Sci. 159(1): 29-42 (1996) - [j2]Elena Barcucci, Alberto Del Lungo, Renzo Pinzani, Renzo Sprugnoli:
Polyominoes Defined by Their Vertical and Horizontal Projections. Theor. Comput. Sci. 159(1): 129-136 (1996) - [c2]Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani:
Reconstruction convex polyominoes from horizontal and vertical projections II. DGCI 1996: 295-306 - 1995
- [c1]Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
A Construction for Enumerating k-coloured Motzkin Paths. COCOON 1995: 254-263 - 1994
- [j1]Alberto Del Lungo:
Polyominoes Defined by Two Vectors. Theor. Comput. Sci. 127(1): 187-198 (1994)
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-05-08 21:04 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:
