-
1
المصدر: Proceedings of the 55th Annual ACM Symposium on Theory of Computing.
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::4c94526a9a14b6e712900794a74da79d
https://doi.org/10.1145/3564246.3585111 -
2
المؤلفون: Jacob Holm, Eva Rotenberg, Alice Ryhl
المصدر: Symposium on Simplicity in Algorithms (SOSA) ISBN: 9781611977585
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::32dfbe4b01ee909ee7bfebca549b46d0
https://doi.org/10.1137/1.9781611977585.ch28 -
3
المؤلفون: Eva Rotenberg, Andreas Bærentzen
المصدر: Bærentzen, A & Rotenberg, E 2021, ' Skeletonization via Local Separators ', ACM Transactions on Graphics, vol. 40, no. 5, 187 . https://doi.org/10.1145/3459233
مصطلحات موضوعية: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer science, Computation, Vertex separator, Skeleton (category theory), Computer Graphics and Computer-Aided Design, Graphics (cs.GR), Skeletonization, Computer Science - Graphics, Computer Science - Computational Geometry, Graph (abstract data type), Algorithm, ComputingMethodologies_COMPUTERGRAPHICS
وصف الملف: application/pdf
-
4
المؤلفون: Mikkel Abrahamsen, Christian Wulff-Nilsen, Jacob Holm, Eva Rotenberg
المصدر: Abrahamsen, M, Holm, J, Rotenberg, E & Wulff-Nilsen, C 2020, ' Escaping an Infinitude of Lions ', American Mathematical Monthly, vol. 127, no. 10, pp. 880-896 . https://doi.org/10.1080/00029890.2020.1820837
Abrahamsen, M, Holm, J, Rotenberg, E & Wulff-nilsen, C 2020, ' Escaping an Infinitude of Lions ', The American Mathematical Monthly, vol. 127, no. 10, pp. 880-896 . https://doi.org/10.1080/00029890.2020.1820837مصطلحات موضوعية: Computational Geometry (cs.CG), FOS: Computer and information sciences, General Mathematics, 010102 general mathematics, 01 natural sciences, Unit speed, Combinatorics, Computer Science - Robotics, Computer Science - Computer Science and Game Theory, Euclidean geometry, Computer Science - Computational Geometry, Countable set, 0101 mathematics, Robotics (cs.RO), Value (mathematics), Computer Science::Databases, Computer Science and Game Theory (cs.GT), Mathematics
وصف الملف: application/pdf
-
5
المؤلفون: Eva Rotenberg, Jacob Holm
المساهمون: Makarychev, Konstantin, Makarychev, Yury, Tulsiani, Madhur, Kamath, Gautam, Chuzhoy, Julia
المصدر: STOC
Holm, J & Rotenberg, E 2020, Fully-dynamic planarity testing in polylogarithmic time . in K Makarychev, Y Makarychev, M Tulsiani, G Kamath & J Chuzhoy (eds), STOC 2020-Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing . Association for Computing Machinery, pp. 167-180, 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, United States, 22/06/2020 . https://doi.org/10.1145/3357713.3384249
Holm, J & Rotenberg, E 2020, Fully-dynamic planarity testing in polylogarithmic time . in K Makarychev, Y Makarychev, M Tulsiani, G Kamath & J Chuzhoy (eds), Proceedings of the 52 nd Annual ACM SIGACT Symposium on Theory of Computing . Association for Computing Machinery, pp. 167-180, 52nd Annual ACM SIGACT Symposium on Theory of Computing, Chicago, Illinois, United States, 22/06/2020 . https://doi.org/10.1145/3357713.3384249مصطلحات موضوعية: FOS: Computer and information sciences, Planar embedding, Computer science, Computer Science::Computational Geometry, Edge (geometry), Graph, Planarity testing, Exponential function, Combinatorics, Deterministic amortized upper bound, Planar, TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, Computer Science - Data Structures and Algorithms, Data_FILES, Data Structures and Algorithms (cs.DS), Planarity, Computer Science::Data Structures and Algorithms, Dynamic graphs, MathematicsofComputing_DISCRETEMATHEMATICS
وصف الملف: application/pdf
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6f3688cf2bdf5e1fce7d305130b538d
https://doi.org/10.1145/3357713.3384249 -
6
-
7كتاب إلكتروني
المؤلفون: Eva Rotenberg
نوع المادة: eBook.
تصنيفات: SOCIAL SCIENCE / Sociology / Marriage & Family, FAMILY & RELATIONSHIPS / Adoption & Fostering
-
8
المؤلفون: Jacob Holm, Eva Rotenberg
المساهمون: Mayr, Ernst W., Ollinger, Nicolas
المصدر: Holm, J & Rotenberg, E 2015, Dynamic planar embeddings of dynamic graphs . in E W Mayr & N Ollinger (eds), 32nd Symposium on Theoretical Aspects of Computer Science (STACS 2015) . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, pp. 434-446, 32nd International Symposium on Theoretical Aspects of Computer Science, Garching, Germany, 04/03/2015 . https://doi.org/10.4230/LIPIcs.STACS.2015.434
مصطلحات موضوعية: Computational Geometry (cs.CG), FOS: Computer and information sciences, Discrete mathematics, 000 Computer science, knowledge, general works, Book embedding, Planar straight-line graph, Graph embedding, Complete graph, 0102 computer and information sciences, 01 natural sciences, Theoretical Computer Science, Combinatorics, Graph bandwidth, Computational Theory and Mathematics, 010201 computation theory & mathematics, Computer Science, Computer Science - Data Structures and Algorithms, Wheel graph, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), Path graph, Complement graph, MathematicsofComputing_DISCRETEMATHEMATICS, Mathematics
وصف الملف: application/pdf
-
9
المؤلفون: Jacob Holm, Eva Rotenberg, Aaron Bernstein
المصدر: Bernstein, A, Holm, J & Rotenberg, E 2019, ' Online Bipartite Matching with Amortized O(log 2 n) Replacements ', Journal of the ACM, vol. 66, no. 5, 37 . https://doi.org/10.1145/3344999
مصطلحات موضوعية: Matching (graph theory), 0102 computer and information sciences, 01 natural sciences, Upper and lower bounds, Combinatorics, Artificial Intelligence, TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, Maximum matching, 0101 mathematics, Online algorithm, Greedy algorithm, Mathematics, Bipartite graphs, 010102 general mathematics, Online algorithms, Vertex (geometry), 010201 computation theory & mathematics, Hardware and Architecture, Control and Systems Engineering, Path (graph theory), Bipartite graph, Assignment problem, Load balancing, Software, Shortest augmenting path, Information Systems, MathematicsofComputing_DISCRETEMATHEMATICS
وصف الملف: application/pdf
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7e9817cc767a039dba29b764338e957
https://orbit.dtu.dk/en/publications/5b1126c3-9f12-41ed-923c-e06c836cbfa3 -
10
المؤلفون: Mehran Mehr, Eva Rotenberg, Anna Adamaszek, Mikkel Abrahamsen, Alan Roytman, Karl Bringmann, Mikkel Thorup, Vincent Cohen-Addad
المساهمون: Max-Planck-Institut für Informatik (MPII), Max-Planck-Gesellschaft, Recherche Opérationnelle (RO), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Department of Applied Mathematics and Computer Science [Lyngby], Technical University of Denmark [Lyngby] (DTU), Computer Science Department [UCLA] (CSD), University of California [Los Angeles] (UCLA), University of California-University of California, Algorithms, Geometry and Applications
المصدر: The 50th Annual ACM SIGACT Symposium on Theory of Computing
The 50th Annual ACM SIGACT Symposium on Theory of Computing, Jun 2018, Los Angeles, United States. pp.564-573, ⟨10.1145/3188745.3188878⟩
arXiv, 2018:1804.00101. Cornell University Libraryمصطلحات موضوعية: Computational Geometry (cs.CG), FOS: Computer and information sciences, Plane (geometry), [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Fence (mathematics), Exponential function, cs.CG, Combinatorics, Set (abstract data type), 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, Computer Science - Computational Geometry, 020201 artificial intelligence & image processing, Point (geometry), Unit cost, Time complexity, Unit (ring theory), Mathematics
وصف الملف: application/pdf
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::863db10d3b4ab23230d455ae97e7ef34
http://arxiv.org/abs/1804.00101
PDF full text from Publisher 
Find this article in full text from Springer Verlag.