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="Yuster, Raphael"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the compatibility of quartet trees
Noga Alon
,
Sagi Snir
,
Raphael Yuster
SIAM Journal on Discrete Mathematics
28
(3), 2014, pp. 1493-1507
Approximating the maximum consecutive subsums of a sequence
Ferdinando Cicalese
,
Eduardo Laber
,
Oren Weimann
,
Raphael Yuster
Theoretical Computer Science
525
, 2014, pp. 130-137
On minimum witnesses for Boolean matrix multiplication
Keren Cohen
,
Raphael Yuster
Algorithmica
69
(2), 2014, pp. 431-442
Edge-disjoint cliques in graphs with high minimum degree
Raphael Yuster
SIAM Journal on Discrete Mathematics
28
(2), 2014, pp. 893-910
Matrix sparsification and nested dissection over arbitrary fields
Noga Alon
,
Raphael Yuster
Journal of the ACM
60
(4), 2013, pp. 25: 1-18
The TurĂ¡n number of sparse spanning graphs
Noga Alon
,
Raphael Yuster
Journal of Combinatorial Theory Series B
103
(3), 2013, pp. 337-343
Approximating the diameter of planar graphs in near linear time
Oren Weimann
,
Raphael Yuster
Lecture Notes in Computer Science
7965
, 2013, pp. 828-839
Maximum matching in regular and almost regular graphs
Raphael Yuster
Algorithmica
66
(1), 2013, pp. 87-92
Packing triangles in regular tournaments
Raphael Yuster
Journal of Graph Theory
74
(1), 2013, pp. 58-66
Near linear time construction of an approximate index for all maximum consecutive sub-sums of a sequence
Ferdinando Cicalese
,
Eduardo Laber
,
Oren Weimann
,
Raphael Yuster
Lecture Notes in Computer Science
7354
, 2012, pp. 149-158
Reconstructing approximate phylogenetic trees from quartet samples
Sagi Snir
,
Raphael Yuster
SIAM Journal on Computing
41
(6), 2012, pp. 1466-1480
Almost exact matchings
Raphael Yuster
Algorithmica
63
(1-2), 2012, pp. 39-50
Approximate shortest paths in weighted graphs
Raphael Yuster
Journal of Computer and System Sciences
78
(2), 2012, pp. 632-637
On graphs and algebraic graphs that do not contain cycles of length 4
Noga Alon
,
H. Tracy Hall
,
Christian Knauer
,
Rom Pinchasi
,
Raphael Yuster
Journal of Graph Theory
68
(2), 2011, pp. 91-102
Distance oracles for vertex-labeled graphs
Danny Hermelin
,
Avivit Levy
,
Oren Weimann
,
Raphael Yuster
Lecture Notes in Computer Science
6756
, 2011, pp. 490-501
All-pairs bottleneck paths in vertex weighted graphs
Asaf Shapira
,
Raphael Yuster
,
Uri Zwick
Algorithmica
59
(4), 2011, pp. 621-633
A linear time approximation scheme for maximum quartet consistency on sparse sampled inputs
Sagi Snir
,
Raphael Yuster
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1722-1736
Two-phase algorithms for the parametric shortest path problem
Sourav Chakraborty
,
Eldar Fischer
,
Oded Lachish
,
Raphael Yuster
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 167-178
The rainbow connection of a graph is (at most) reciprocal to its minimum degree
Michael Krivelevich
,
Raphael Yuster
Journal of Graph Theory
63
(3), 2010, pp. 185-191
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
Computing the girth of a planar graph in
O(n \log n)
time
Oren Weimann
,
Raphael Yuster
SIAM Journal on Discrete Mathematics
24
(2), 2010, pp. 609-616
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
Raphael Yuster
Combinatorica
30
(2), 2010, pp. 239-246
Single source shortest paths in
H
-minor free graphs
Raphael Yuster
Theoretical Computer Science
411
(34-36), 2010, pp. 3042-3047
Hardness and algorithms for rainbow connectivity
Sourav Chakraborty
,
Eldar Fischer
,
Arie Matsliah
,
Raphael Yuster
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 243-254
A comment on Ryser's conjecture for intersecting hypergraphs
Toufik Mansour
,
Chunwei Song
,
Raphael Yuster
Graphs and Combinatorics
25
(1), 2009, pp. 101-109
Seiten 1
2
3
>