Forschungspapier (738)

11001.
Forschungspapier
Christodoulou, G.; Mehlhorn, K.; Pyrga, E.: Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. (2013), 17 pages, 2 figures, preliminary version appeared at ESA 2011 S.
11002.
Forschungspapier
Alvarez, V.; Bringmann, K.; Ray, S.: A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations. (2013), 38 pages, 48 figures S.
11003.
Forschungspapier
Bhattacharya, S.; Chalermsook, P.; Mehlhorn, K.; Neumann, A.: New Approximability Results for the Robust k-Median Problem. (2013), 19 pages S.
11004.
Forschungspapier
Bringmann, K.; Engels, C.; Manthey, B.; Rao, R. B. V.: Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems. (2013)
11005.
Forschungspapier
Byrka, J.; Fleszar, K.; Rybicki, B.; Spoerhase, J.: Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems. (2013), 37 S.
11006.
Forschungspapier
Chatzis, N.; Smaragdakis, G.; Feldmann, A.: On the Importance of Internet eXchange Points for Today's Internet Ecosystem. (2013), 10 S.
11007.
Forschungspapier
Crowston, R.; Jones, M.; Muciaccia, G.; Philip, G.; Rai, A.; Saurabh, S.: Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzík Bound. (2013)
11008.
Forschungspapier
Dolev, D.; Heljanko, K.; Järvisalo, M.; Korhonen, J. H.; Lenzen, C.; Rybicki, J.; Suomela, J.; Wieringa, S.: Synchronous Counting and Computational Algorithm Design. (2013), 35 S.
11009.
Forschungspapier
Erdős, D.; Miettinen, P.: Scalable Boolean Tensor Factorizations using Random Walks. (2013)
11010.
Forschungspapier
Fekete, S. P.; Friedrichs, S.; Kröller, A.; Schmidt, C.: Facets for Art Gallery Problems. (2013), 29 pages, 18 figures, 1 table S.
11011.
Forschungspapier
Kim, J.; Chatzis, N.; Siebke, M.; Feldmann, A.: Tigers vs Lions: Towards Characterizing Solitary and Group User Behavior in MMORPG. (2013)
11012.
Forschungspapier
Kim, J.; Khalili, R.; Feldmann, A.; Chen, Y.-C.; Towsley, D.: Multi-Source Multi-Path HTTP (mHTTP): A Proposal. (2013), 12 S.
11013.
Forschungspapier
Kratsch, S.; Philip, G.; Ray, S.: Point Line Cover: The Easy Kernel is Essentially Tight. (2013)
11014.
Forschungspapier
Megow, N.; Wiese, A.: Competitive-ratio Approximation Schemes for Minimizing the Makespan in the Online-list Model. (2013)
11015.
Forschungspapier
Mehlhorn, K.; Sagraloff, M.; Wang, P.: From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition. (2013), 38 S.
11016.
Forschungspapier
Sagraloff, M.; Mehlhorn, K.: Computing Real Roots of Real Polynomials. (2013)
11017.
Forschungspapier
Schmidt, J. M.: The Mondshein Sequence. (2013)
11018.
Forschungspapier
Suda, M.: Triggered Clause Pushing for IC3. (2013), 4 S.
11019.
Forschungspapier
Doerr, B.; Doerr, C.; Spöhel, R.; Thomas, H.: Playing Mastermind with Many Colors. (2012), Extended abstract appeared in SODA 2013. This full version has 22 pages and 1 picture S.
11020.
Forschungspapier
Berberich, E.; Emeliyanenko, P.; Kobel, A.; Sagraloff, M.: Exact Symbolic-numeric Computation of Planar Algebraic Curves. (2012), 46 S.
Zur Redakteursansicht