default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuval Emek
Person information
- affiliation: Technion - Israel Institute of Technology
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j29]Yuval Emek, Ron Lavi, Rad Niazadeh
, Yangguang Shi:
Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes. Math. Oper. Res. 49(2): 880-900 (2024)- [j28]Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen:
Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions. SIAM J. Comput. 53(2): 247-286 (2024) - [c66]Yuval Emek, Yuval Gil, Noga Harlev:
On the Power of Graphical Reconfigurable Circuits. DISC 2024: 22:1-22:16 - [e2]Yuval Emek:
Structural Information and Communication Complexity - 31st International Colloquium, SIROCCO 2024, Vietri sul Mare, Italy, May 27-29, 2024, Proceedings. Lecture Notes in Computer Science 14662, Springer 2024, ISBN 978-3-031-60602-1 [contents] - [i35]Yuval Emek, Yuval Gil, Noga Harlev:
On the Power of Graphical Reconfigurable Circuits. CoRR abs/2408.10761 (2024) - 2023
- [c65]Anne Condon, Yuval Emek, Noga Harlev:
On the Runtime of Chemical Reaction Networks Beyond Idealized Conditions. DNA 2023: 3:1-3:22 - [c64]Yuval Emek, Yuval Gil, Maciej Pacut, Stefan Schmid:
Online Algorithms with Randomly Infused Advice. ESA 2023: 44:1-44:19 - [c63]Fabien Dufoulon, Yuval Emek, Ran Gelles:
Beeping Shortest Paths via Hypergraph Bipartite Decomposition. ITCS 2023: 45:1-45:24 - [c62]Taisuke Izumi, Yuval Emek, Tadashi Wadayama, Toshimitsu Masuzawa:
Deterministic Fault-Tolerant Connectivity Labeling Scheme. PODC 2023: 190-199 - [i34]Yuval Emek, Yuval Gil, Maciej Pacut, Stefan Schmid:
Online Algorithms with Randomly Infused Advice. CoRR abs/2302.05366 (2023) - [i33]Anne Condon, Yuval Emek, Noga Harlev:
On the Runtime of Chemical Reaction Networks Beyond Idealized Conditions. CoRR abs/2307.00647 (2023) - 2022
- [j27]Yuval Emek, Saket Navlakha:
Special Issue: Biological Distributed Algorithms 2021. J. Comput. Biol. 29(4): 305 (2022) - [c61]Yuval Emek, Yuval Gil, Noga Harlev:
Design of Self-Stabilizing Approximation Algorithms via a Primal-Dual Approach. OPODIS 2022: 27:1-27:19 - [c60]Yuval Emek, Yuval Gil, Shay Kutten:
Locally Restricted Proof Labeling Schemes. DISC 2022: 20:1-20:22 - [i32]Yuval Emek, Yuval Gil, Shay Kutten:
Locally Restricted Proof Labeling Schemes (Full Version). CoRR abs/2208.08718 (2022) - [i31]Taisuke Izumi, Yuval Emek, Tadashi Wadayama, Toshimitsu Masuzawa:
Deterministic Fault-Tolerant Connectivity Labeling Scheme with Adaptive Query Processing Time. CoRR abs/2208.11459 (2022) - [i30]Fabien Dufoulon, Yuval Emek, Ran Gelles:
Beeping Shortest Paths via Hypergraph Bipartite Decomposition. CoRR abs/2210.06882 (2022) - 2021
- [c59]Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks:
Multicast Communications with Varying Bandwidth Constraints. INFOCOM 2021: 1-10 - [c58]Yuval Emek, Shay Kutten, Yangguang Shi:
Online Paging with a Vanishing Regret. ITCS 2021: 67:1-67:20 - [c57]Yuval Emek, Eyal Keren:
A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological Networks. PODC 2021: 93-102 - [c56]Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks:
Hierarchical b-Matching. SOFSEM 2021: 189-202 - [i29]Yuval Emek, Eyal Keren:
A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological Networks. CoRR abs/2102.12787 (2021) - [i28]Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten:
Fully Adaptive Self-Stabilizing Transformer for LCL Problems. CoRR abs/2105.09756 (2021) - 2020
- [j26]Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi:
Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency. J. ACM 67(1): 7:1-7:33 (2020) - [j25]Yuval Emek, Jara Uitto:
Dynamic networks of finite state machines. Theor. Comput. Sci. 810: 58-71 (2020) - [j24]Sebastian Brandt, Yuval Emek, Jara Uitto, Roger Wattenhofer:
A tight lower bound for the capture time of the Cops and Robbers game. Theor. Comput. Sci. 839: 143-163 (2020) - [j23]Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi:
Bayesian generalized network design. Theor. Comput. Sci. 841: 167-185 (2020) - [c55]Ruben Becker, Yuval Emek, Christoph Lenzen:
Low Diameter Graph Decompositions by Approximate Distance Computation. ITCS 2020: 50:1-50:29 - [c54]Yuval Emek, Ron Lavi, Rad Niazadeh, Yangguang Shi:
Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes. NeurIPS 2020 - [c53]Xavier Défago, Yuval Emek, Shay Kutten, Toshimitsu Masuzawa, Yasumasa Tamura:
Communication Efficient Self-Stabilizing Leader Election. DISC 2020: 11:1-11:19 - [c52]Yuval Emek, Yuval Gil:
Twenty-Two New Approximate Proof Labeling Schemes. DISC 2020: 20:1-20:14 - [e1]Yuval Emek, Christian Cachin:
PODC '20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020. ACM 2020, ISBN 978-1-4503-7582-5 [contents] - [i27]Yuval Emek, Shay Kutten, Ron Lavi, Rad Niazadeh, Yangguang Shi:
No-Regret Stateful Posted Pricing. CoRR abs/2005.01869 (2020) - [i26]Amos Korman, Yuval Emek, Simon Collet, Aya Goldshtein, Yossi Yovel:
Exploitation of Multiple Replenishing Resources with Uncertainty. CoRR abs/2007.09640 (2020) - [i25]Yuval Emek, Yuval Gil:
Twenty-Two New Approximate Proof Labeling Schemes. CoRR abs/2007.14307 (2020) - [i24]Xavier Défago, Yuval Emek, Shay Kutten, Toshimitsu Masuzawa, Yasumasa Tamura:
Communication Efficient Self-Stabilizing Leader Election (Full Version). CoRR abs/2008.04252 (2020) - [i23]Yuval Emek, Shay Kutten, Yangguang Shi:
Online Paging with a Vanishing Regret. CoRR abs/2011.09439 (2020)
2010 – 2019
- 2019
- [j22]Yakov Babichenko, Yuval Emek, Michal Feldman, Boaz Patt-Shamir, Ron Peretz, Rann Smorodinsky:
Stable Secretaries. Algorithmica 81(8): 3136-3161 (2019) - [j21]Yuval Emek, Yaacov Shapiro, Yuyi Wang:
Minimum cost perfect matching with delays for two sources. Theor. Comput. Sci. 754: 122-129 (2019) - [c51]Yuval Emek, Adam Goldbraikh, Erez Kantor:
Online Disjoint Set Cover Without Prior Knowledge. ESA 2019: 44:1-44:16 - [c50]Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi:
Bayesian Generalized Network Design. ESA 2019: 45:1-45:16 - [c49]Yuval Emek, Shay Kutten, Ron Lavi, William K. Moses Jr.:
Deterministic Leader Election in Programmable Matter. ICALP 2019: 140:1-140:14 - [c48]Yuval Emek, Noga Harlev, Taisuke Izumi:
Towards Distributed Two-Stage Stochastic Optimization. OPODIS 2019: 32:1-32:16 - [c47]Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten:
Message Reduction in the LOCAL Model is a Free Lunch. PODC 2019: 300-302 - [c46]Yossi Azar, Yuval Emek, Rob van Stee, Danny Vainstein:
The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays. SPAA 2019: 1-10 - [c45]Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen:
Distributed Algorithms for Low Stretch Spanning Trees. DISC 2019: 4:1-4:14 - [c44]Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten:
Message Reduction in the LOCAL Model Is a Free Lunch. DISC 2019: 7:1-7:15 - [i22]Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks:
Hierarchical b-Matching. CoRR abs/1904.10210 (2019) - [i21]Yuval Emek, Fanica Gavril, Shay Kutten, Mordechai Shalom, Shmuel Zaks:
Maximizing Communication Throughput in Tree Networks. CoRR abs/1904.10215 (2019) - [i20]Yuval Emek, Shay Kutten, Ron Lavi, William K. Moses Jr.:
Deterministic Leader Election in Programmable Matter. CoRR abs/1905.00580 (2019) - [i19]Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi:
Bayesian Generalized Network Design. CoRR abs/1907.00484 (2019) - [i18]Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten:
Message Reduction in the Local Model is a Free Lunch. CoRR abs/1909.08369 (2019) - [i17]Ruben Becker, Yuval Emek, Christoph Lenzen:
Low Diameter Graph Decompositions by Approximate Distance Computation. CoRR abs/1909.09002 (2019) - 2018
- [c43]Shimon Bitton, Yuval Emek, Shay Kutten:
Efficient Jobs Dispatching in Emerging Clouds. INFOCOM 2018: 2033-2041 - [c42]Yehuda Afek, Yuval Emek, Noa Kolikant:
The Synergy of Finite State Machines. OPODIS 2018: 22:1-22:16 - [c41]Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi:
Approximating generalized network design under (dis)economies of scale with applications to energy efficiency. STOC 2018: 598-606 - [c40]Yehuda Afek, Yuval Emek, Noa Kolikant:
Selecting a Leader in a Network of Finite State Machines. DISC 2018: 4:1-4:17 - [i16]Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi:
Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency. CoRR abs/1803.05361 (2018) - [i15]Yehuda Afek, Yuval Emek, Noa Kolikant:
Selecting a Leader in a Network of Finite State Machines. CoRR abs/1805.05660 (2018) - 2017
- [c39]Yuval Emek, Yaacov Shapiro, Yuyi Wang:
Minimum Cost Perfect Matching with Delays for Two Sources. CIAC 2017: 209-221 - [c38]Sebastian Brandt, Yuval Emek, Jara Uitto, Roger Wattenhofer:
A Tight Lower Bound for the Capture Time of the Cops and Robbers Game. ICALP 2017: 82:1-82:13 - [c37]Yakov Babichenko, Yuval Emek, Michal Feldman, Boaz Patt-Shamir, Ron Peretz, Rann Smorodinsky:
Stable Secretaries. EC 2017: 243-244 - [c36]Lihi Cohen, Yuval Emek, Oren Louidor, Jara Uitto:
Exploring an Infinite Space with Finite Memory Scouts. SODA 2017: 207-224 - [c35]Yehuda Afek, Yuval Emek, Noa Kolikant:
Brief Announcement: The Synergy of Finite State Machines. DISC 2017: 42:1-42:3 - [i14]Lihi Cohen, Yuval Emek, Oren Louidor, Jara Uitto:
Exploring an Infinite Space with Finite Memory Scouts. CoRR abs/1704.02380 (2017) - [i13]Yakov Babichenko, Yuval Emek, Michal Feldman, Boaz Patt-Shamir, Ron Peretz, Rann Smorodinsky:
Stable Secretaries. CoRR abs/1705.01589 (2017) - [i12]Yuval Emek, Jara Uitto:
Dynamic Networks of Finite State Machines. CoRR abs/1706.03721 (2017) - 2016
- [j20]Yuval Emek, Erez Kantor, David Peleg:
On the effect of the deployment setting on broadcasting in Euclidean radio networks. Distributed Comput. 29(6): 409-434 (2016) - [j19]Yuval Emek, Magnús M. Halldórsson, Adi Rosén:
Space-Constrained Interval Selection. ACM Trans. Algorithms 12(4): 51:1-51:32 (2016) - [j18]Yuval Emek, Adi Rosén:
Semi-Streaming Set Cover. ACM Trans. Algorithms 13(1): 6:1-6:22 (2016) - [c34]Yuval Emek, Jara Uitto:
Dynamic Networks of Finite State Machines. SIROCCO 2016: 19-34 - [c33]Yuval Emek, Shay Kutten, Roger Wattenhofer:
Online matching: haste makes waste! STOC 2016: 333-344 - [i11]Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg, Yuval Emek:
Notions of Connectivity in Overlay Networks. CoRR abs/1601.01104 (2016) - [i10]Yuval Emek, Shay Kutten, Roger Wattenhofer:
Online Matching: Haste makes Waste! CoRR abs/1603.03024 (2016) - 2015
- [j17]Yuval Emek, Tobias Langner, David Stolz, Jara Uitto, Roger Wattenhofer:
How many ants does it take to find the food? Theor. Comput. Sci. 608: 255-267 (2015) - [c32]Yuval Emek, Tobias Langner, Roger Wattenhofer:
The Price of Matching with Metric Preferences. ESA 2015: 459-470 - 2014
- [j16]Yuval Emek, Michal Feldman, Iftah Gamzu, Renato Paes Leme, Moshe Tennenholtz:
Signaling Schemes for Revenue Maximization. ACM Trans. Economics and Comput. 2(2): 5:1-5:19 (2014) - [c31]Yuval Emek, Jochen Seidel, Roger Wattenhofer:
Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs. ICALP (2) 2014: 183-195 - [c30]Yuval Emek, Adi Rosén:
Semi-Streaming Set Cover - (Extended Abstract). ICALP (1) 2014: 453-464 - [c29]Yuval Emek, Tobias Langner, Jara Uitto, Roger Wattenhofer:
Solving the ANTS Problem with Asynchronous Finite State Machines. ICALP (2) 2014: 471-482 - [c28]Yuval Emek, Christoph Pfister, Jochen Seidel, Roger Wattenhofer:
Anonymous networks: randomization = 2-hop coloring. PODC 2014: 96-105 - [c27]Yuval Emek, Tobias Langner, David Stolz, Jara Uitto, Roger Wattenhofer:
How Many Ants Does It Take to Find the Food? SIROCCO 2014: 263-278 - [i9]Yuval Emek, Adi Rosén:
Semi-Streaming Set Cover. CoRR abs/1404.6763 (2014) - 2013
- [j15]Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz:
Adversarial Leakage in Games. SIAM J. Discret. Math. 27(1): 363-385 (2013) - [c26]Yuval Emek, Roger Wattenhofer:
Stone age distributed computing. PODC 2013: 137-146 - [c25]Yuval Emek, Roger Wattenhofer:
Frequency Hopping against a Powerful Adversary. DISC 2013: 329-343 - [i8]Yuval Emek, Tobias Langner, Jara Uitto, Roger Wattenhofer:
Ants: Mobile Finite State Machines. CoRR abs/1311.3062 (2013) - 2012
- [j14]Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David Peleg:
Sparse reliable graph backbones. Inf. Comput. 210: 31-39 (2012) - [j13]Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty:
SINR Diagrams: Convexity and Its Applications in Wireless Networks. J. ACM 59(4): 18:1-18:34 (2012) - [j12]Yuval Emek, Magnús M. Halldórsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz:
Online Set Packing. SIAM J. Comput. 41(4): 728-746 (2012) - [j11]Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz:
Bayesian ignorance. Theor. Comput. Sci. 452: 1-11 (2012) - [j10]Yuval Emek, Michal Feldman:
Computing optimal contracts in combinatorial agencies. Theor. Comput. Sci. 452: 56-74 (2012) - [c24]Yuval Emek, Magnús M. Halldórsson, Adi Rosén:
Space-Constrained Interval Selection. ICALP (1) 2012: 302-313 - [c23]Yuval Emek, Michal Feldman, Iftah Gamzu, Renato Paes Leme, Moshe Tennenholtz:
Signaling schemes for revenue maximization. EC 2012: 514-531 - [c22]Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg:
Notions of Connectivity in Overlay Networks. SIROCCO 2012: 25-35 - [i7]Yuval Emek, Jasmin Smula, Roger Wattenhofer:
Stone Age Distributed Computing. CoRR abs/1202.1186 (2012) - [i6]Yuval Emek, Michal Feldman, Iftah Gamzu, Renato Paes Leme, Moshe Tennenholtz:
Signaling Schemes for Revenue Maximization. CoRR abs/1202.1590 (2012) - [i5]Yuval Emek, Magnús M. Halldórsson, Adi Rosén:
Space-Constrained Interval Selection. CoRR abs/1202.4326 (2012) - 2011
- [j9]Yuval Emek:
k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees. Algorithmica 61(1): 141-160 (2011) - [j8]Yuval Emek, Amos Korman:
New bounds for the controller problem. Distributed Comput. 24(3-4): 177-186 (2011) - [j7]Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén:
Online computation with advice. Theor. Comput. Sci. 412(24): 2642-2656 (2011) - [c21]Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz:
Economical Graph Discovery. ICS 2011: 476-486 - [c20]Yuval Emek, Ron Karidi, Moshe Tennenholtz, Aviv Zohar:
Mechanisms for multi-level marketing. EC 2011: 209-218 - [c19]Yuval Emek, Amos Korman, Yuval Shavitt:
Approximating the Statistics of various Properties in Randomly Weighted Graphs. SODA 2011: 1455-1467 - [i4]Yuval Emek, Tobias Langner, Roger Wattenhofer:
Stability vs. Cost of Matchings. CoRR abs/1112.4632 (2011) - 2010
- [j6]Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén:
On the additive constant of the k-server Work Function Algorithm. Inf. Process. Lett. 110(24): 1120-1123 (2010) - [j5]Yuval Emek, David Peleg, Liam Roditty:
A near-linear-time algorithm for computing replacement paths in planar directed graphs. ACM Trans. Algorithms 6(4): 64:1-64:13 (2010) - [c18]Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David Peleg:
Sparse Reliable Graph Backbones. ICALP (2) 2010: 261-272 - [c17]Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz:
Adversarial Leakage in Games. ICS 2010: 111-119 - [c16]Yuval Emek, Amos Korman:
Efficient threshold detection in a distributed environment: extended abstract. PODC 2010: 183-191 - [c15]Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz:
Bayesian ignorance. PODC 2010: 384-391 - [c14]Yuval Emek, Magnús M. Halldórsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz:
Online set packing and competitive scheduling of multi-part tasks. PODC 2010: 440-449
2000 – 2009
- 2009
- [j4]Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su:
Broadcasting in UDG radio networks with unknown topology. Distributed Comput. 21(5): 331-351 (2009) - [j3]Yuval Emek, David Peleg:
A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs. SIAM J. Discret. Math. 23(4): 1827-1841 (2009) - [c13]Yuval Emek:
k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees. ESA 2009: 203-214 - [c12]Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén:
Online Computation with Advice. ICALP (1) 2009: 427-438 - [c11]Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty:
SINR diagrams: towards algorithmically usable SINR models of wireless networks. PODC 2009: 200-209 - [c10]Yuval Emek, Amos Korman:
Brief announcement: new bounds for the controller problem. PODC 2009: 340-341 - [c9]Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén:
On the Additive Constant of the k-Server Work Function Algorithm. WAOA 2009: 128-134 - [c8]Yuval Emek, Amos Korman:
New Bounds for the Controller Problem. DISC 2009: 22-34 - [c7]Yuval Emek, Michal Feldman:
Computing Optimal Contracts in Series-Parallel Heterogeneous Combinatorial Agencies. WINE 2009: 268-279 - [i3]Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén:
On the Additive Constant of the k-server Work Function Algorithm. CoRR abs/0902.1378 (2009) - [i2]Yuval Emek, Amos Korman, Yuval Shavitt:
Computing the Expected Values of some Properties of Randomly Weighted Graphs. CoRR abs/0908.0968 (2009) - 2008
- [j2]Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng:
Lower-Stretch Spanning Trees. SIAM J. Comput. 38(2): 608-628 (2008) - [j1]Yuval Emek, David Peleg:
Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs. SIAM J. Comput. 38(5): 1761-1781 (2008) - [c6]Yuval Emek, Erez Kantor, David Peleg:
On the effect of the deployment setting on broadcasting in Euclidean radio networks. PODC 2008: 223-232 - [c5]Yuval Emek, David Peleg, Liam Roditty:
A near-linear time algorithm for computing replacement paths in planar directed graphs. SODA 2008: 428-435 - [i1]Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty:
SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks. CoRR abs/0811.3284 (2008) - 2007
- [c4]Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su:
Broadcasting in udg radio networks with unknown topology. PODC 2007: 195-204 - 2006
- [c3]Yuval Emek, David Peleg:
A tight upper bound on the probabilistic embedding of series-parallel graphs. SODA 2006: 1045-1053 - 2005
- [c2]Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng:
Lower-stretch spanning trees. STOC 2005: 494-503 - 2004
- [c1]Yuval Emek, David Peleg:
Approximating Minimum Max-Stretch spanning Trees on unweighted graphs. SODA 2004: 261-270
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-10-25 21:12 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:
