Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Danny
Last name:	Segev
DBLP:	40/68
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 10 of 39  

Select a publication
Show	Title	Venue	Rating	Date
	Journal article Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan. Approximation algorithms for orienting mixed graphs.	Theor. Comput. Sci. 2013, Volume 483	(0)	2013
	Conference paper Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann. Improved Bounds for Online Preemptive Matching.	30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013	(0)	2013
	Conference paper Dima Blokh, Danny Segev, Roded Sharan. Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations.	Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings 2012	(0)	2012
	Conference paper Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann. Improved Bounds for Online Preemptive Matching	CoRR 2012, Volume 0	(0)	2012
	Conference paper Jochen Könemann, Ojas Parekh, Danny Segev. A Unified Approach to Approximating Partial Covering Problems.	Algorithmica 2011, Volume 59	(0)	2011
	Conference paper Danny Segev. Approximating	J. Comb. Optim. 2011, Volume 21	(0)	2011
	Conference paper Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev. Set connectivity problems in undirected graphs and the directed steiner network problem.	ACM Transactions on Algorithms 2010, Volume 7	(0)	2011
	Conference paper Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan. Approximation Algorithms for Orienting Mixed Graphs.	Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011. Proceedings 2011	(0)	2011
	Conference paper Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev. Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model.	SIAM J. Discrete Math. 2011, Volume 25	(0)	2011
	Journal article Michael Elberfeld, Vineet Bafna, Iftah Gamzu, Alexander Medvedovsky, Danny Segev, Dana Silverbush, Uri Zwick, Roded Sharan. On the Approximability of Reachability-Preserving Network Orientations.	Internet Mathematics 2011, Volume 7	(0)	2011

Show item 1 to 10 of 39  

Your query returned 39 matches in the database.