☰

Andre Berger, Ph.D. - Publications

Affiliations: 
2006 Emory University, Atlanta, GA 
Area:
Mathematics, Computer Science
Tree Info Similar researchers PubMed Report error

11 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2017 Berger A, Grigoriev A, Panin AA, Winokurow A. Location, pricing and the problem of Apollonius Optimization Letters. 11: 1797-1805. DOI: 10.1007/S11590-017-1159-0  0.337
2016 Berger A, Gross J, Harks T, Tenbusch S. Constrained resource assignments: Fast algorithms and applications in wireless networks Management Science. 62: 2070-2089. DOI: 10.1287/Mnsc.2015.2221  0.347
2016 Berger A, Grigoriev A, Panin AA, Winokurow A. Location, Pricing and the Problem of Apollonius Lecture Notes in Computer Science. 9869: 563-569. DOI: 10.1007/978-3-319-44914-2_44  0.337
2015 Berger A, Röglin H, Zwaan Rvd. Internet routing between autonomous systems Discrete Applied Mathematics. 185: 8-17. DOI: 10.1016/J.Dam.2014.11.025  0.345
2015 Berger A, Grigoriev A, Peeters R, Usotskaya N. On Time-Optimal Trajectories in Non-Uniform Mediums Journal of Optimization Theory and Applications. 165: 586-626. DOI: 10.1007/S10957-014-0590-Y  0.353
2014 Berger A, Grigoriev A, Heggernes P, Zwaan RVD. Scheduling unit-length jobs with precedence constraints of small height Operations Research Letters. 42: 166-172. DOI: 10.1016/J.Orl.2014.01.008  0.343
2012 Berger A, Parekh O. Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems Algorithmica. 62: 633-634. DOI: 10.1007/S00453-011-9558-6  0.344
2011 Berger A, Grigoriev A, Usotskaya N. On the time-optimal 2D-trajectories in non-uniform mediums Meteor Research Memorandum. DOI: 10.26481/Umamet.2011031  0.357
2011 Berger A, Bonifaci V, Grandoni F, Schäfer G. Budgeted matching and budgeted matroid intersection via the gasoline puzzle Mathematical Programming. 128: 355-372. DOI: 10.1007/S10107-009-0307-4  0.333
2008 Berger A, Parekh O. Linear time algorithms for generalized edge dominating set problems Algorithmica (New York). 50: 244-254. DOI: 10.1007/S00453-007-9057-Y  0.305
2007 Berger A, Fukunaga T, Nagamochi H, Parekh O. Approximability of the capacitated b-edge dominating set problem Theoretical Computer Science. 385: 202-213. DOI: 10.1016/J.Tcs.2007.06.009  0.341
Show low-probability matches.