Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Alimonti, Paola"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Linear time analysis of properties of conflict-free and general Petri nets
Paola Alimonti
,
Esteban Feuerstein
,
Luigi Laura
,
Umberto Nanni
Theoretical Computer Science
412
(4-5), 2011, pp. 320-338
Some APX-completeness results for cubic graphs
Paola Alimonti
,
Viggo Kann
Theoretical Computer Science
237
(1-2), 2000, pp. 123-134
Improved approximations of independent dominating set in bounded degree graphs
Paola Alimonti
,
Tiziana Calamoneri
Lecture Notes in Computer Science
1197
, 1997, pp. 2-16
Hardness of approximating problems on cubic graphs
Paola Alimonti
,
Viggo Kann
Lecture Notes in Computer Science
1203
, 1997, pp. 288-298
Hardness of approximating problems on cubic graphs
Paola Alimonti
,
Viggo Kann
Lecture Notes in Computer Science
1203
, 1997, pp. 288-298
Non-oblivious local search for MAX 2-CCSP with application to MAX DICUT
Paola Alimonti
Lecture Notes in Computer Science
1335
, 1997, pp. 2-14
Finding the extrema of a distributed multiset
Paola Alimonti
,
Paola Flocchini
,
Nicola Santoro
Journal Parallel Distributed Computing
37
(2), 1996, pp. 123-133
New local search approximation techniques for maximum generalized satisfiability problems
Paola Alimonti
Information Processing Letters
57
(3), 1996, pp. 151-158
Non-oblivious local search for graph and hypergraph coloring problems
Paola Alimonti
Lecture Notes in Computer Science
1017
, 1995, pp. 167-180
New local search approximation techniques for maximum generalized satisfiability problems
Paola Alimonti
Lecture Notes in Computer Science
778
, 1994, pp. 40-53
Petri nets, hypergraphs and conflicts (preliminary version)
Paola Alimonti
,
Esteban Feuerstein
Lecture Notes in Computer Science
657
, 1993, pp. 293-309
Average case analysis of fully dynamic connectivity for directed graphs
Paola Alimonti
,
Stefano Leonardi
,
Alberto Marchetti-Spaccamela
,
Xavier Messeguer
Lecture Notes in Computer Science
790
, 1993, pp. 87-98
Linear time algorithms for liveness and boundedness in conflict-free Petri nets
Paola Alimonti
,
Esteban Feuerstein
,
Umberto Nanni
Lecture Notes in Computer Science
583
, 1992, pp. 1-14
Linear time algorithms for liveness and boundedness in conflict-free Petri nets
Paola Alimonti
,
Esteban Feuerstein
,
Umberto Nanni
Technical Report (TR-92-008), 1992, February