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="Shapira, Asaf"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A note on even cycles and quasirandom tournaments
Subrahmanyam Kalyanasundaram
,
Asaf Shapira
Journal of Graph Theory
73
(3), 2013, pp. 260-266
A deterministic algorithm for the Frieze-Kannan regularity lemma
Domingos Dellamonica
,
Subrahmanyam Kalyanasundaram
,
Daniel Martin
,
Vojtȇch Rödl
,
Asaf Shapira
SIAM Journal on Discrete Mathematics
26
(1), 2012, pp. 15-29
A note on maximizing the spread of influence in social networks
Eyal Even-Dar
,
Asaf Shapira
Information Processing Letters
111
(4), 2011, pp. 184-187
Sublinear time algorithms
Ronitt Rubinfeld
,
Asaf Shapira
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1562-1588
All-pairs bottleneck paths in vertex weighted graphs
Asaf Shapira
,
Raphael Yuster
,
Uri Zwick
Algorithmica
59
(4), 2011, pp. 621-633
Approximate hypergraph partitioning and applications
Eldar Fischer
,
Arie Matsliah
,
Asaf Shapira
SIAM Journal on Computing
39
(7), 2010, pp. 3155-3185
Testing the expansion of a graph
Asaf Nachmias
,
Asaf Shapira
Information and Computation
208
(4), 2010, pp. 309-314
On the density of a graph and its blowup
Asaf Shapira
,
Raphael Yuster
Journal of Combinatorial Theory Series B
100
(6), 2010, pp. 704-719
A combinatorial characterization of the testable graph properties: It's all about regularity
Noga Alon
,
Eldar Fischer
,
Ilan Newman
,
Asaf Shapira
SIAM Journal on Computing
39
(1), 2009, pp. 143-167
Testing hereditary properties of nonexpanding bounded-degree graphs
Artur Czumaj
,
Asaf Shapira
,
Christian Sohler
SIAM Journal on Computing
38
(6), 2009, pp. 2499-2510
Green's conjecture and testing linear-invariant properties
Asaf Shapira
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 159-166
Can a graph have distinct regular partitions?
Noga Alon
,
Asaf Shapira
,
Uri Stav
SIAM Journal on Discrete Mathematics
23
(1), 2008-2009, pp. 278-287
A separation theorem in property testing
Noga Alon
,
Asaf Shapira
Combinatorica
28
(3), 2008, pp. 261-281
A characterization of the (natural) graph properties testable with one-sided error
Noga Alon
,
Asaf Shapira
SIAM Journal on Computing
37
(6), 2008, pp. 1703-1727
Every monotone graph property is testable
Noga Alon
,
Asaf Shapira
SIAM Journal on Computing
38
(2), 2008, pp. 505-522
Every minor-closed property of sparse graphs is testable
Itai Benjamini
,
Oded Schramm
,
Asaf Shapira
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 393-402
All-pairs shortest paths with a sublinear additive error
Liam Roditty
,
Asaf Shapira
Lecture Notes in Computer Science
5125
, 2008, pp. 622-633
Quasi-randomness and the distribution of copies of a fixed graph
Asaf Shapira
Combinatorica
28
(6), 2008, pp. 735-745
Can a graph have distinct regular partitions?
Noga Alon
,
Asaf Shapira
,
Uri Stav
Lecture Notes in Computer Science
4598
, 2007, pp. 428-438
A combinatorial characterization of the testable graph properties: It's all about regularity
Noga Alon
,
Eldar Fischer
,
Ilan Newman
,
Asaf Shapira
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 251-260
Additive approximation for edge-deletion problems
Noga Alon
,
Asaf Shapira
,
Benny Sudakov
Lecture Notes in Computer Science
4051
, 2006, pp. 1-2
On an extremal hypergraph problem of Brown, Erdŏs and Sós
Noga Alon
,
Asaf Shapira
Combinatorica
26
(6), 2006, pp. 627-645
Every monotone graph property is testable
Noga Alon
,
Asaf Shapira
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 128-137
Testing subgraphs in directed graphs
Noga Alon
,
Asaf Shapira
Journal of Computer and System Sciences
69
(3), 2004, pp. 354-382
Testing satisfiability
Noga Alon
,
Asaf Shapira
Journal of Algorithms
47
(2), 2003, pp. 87-103
Seiten 1
2
>