Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time

Συγγραφείς: Eppstein, David

Συνεισφορές: David Eppstein

Πηγή: Algorithmica, vol 86, iss 9

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, Non-crossing Hamiltonian path, Applied Mathematics, non-crossing structures, 0102 computer and information sciences, Pure Mathematics, Output-sensitive enumeration, 01 natural sciences, Mathematical Sciences, Computation Theory & Mathematics, Approximate counting, Computer Science - Data Structures and Algorithms, Information and computing sciences, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), polygonalization, ddc:004, output-sensitive algorithms, 0101 mathematics, Polygonalization

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2303.00147
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.29
https://escholarship.org/uc/item/8g54s4qn
https://escholarship.org/uc/item/3zw640xf

Constructing Antidictionaries in Output-Sensitive Space

Συγγραφείς: Ayad, Lorraine A.K., Badkobeh, Golnaz, Fici, Gabriele, Heliou, Alice, Pissis, Solon P.

Πηγή: 2019 Data Compression Conference (DCC) DCC Data Compression Conference (DCC), 2019. :538-547 Mar, 2019

Relation: 2019 Data Compression Conference (DCC)

Refined notions of parameterized enumeration kernels with applications to matching cut enumeration

Συγγραφείς: Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le

Συνεισφορές: Petr A. Golovach and Christian Komusiewicz and Dieter Kratsch and Van Bang Le

Πηγή: Journal of computer and system sciences

Θεματικοί όροι: FOS: Computer and information sciences, matching cuts, Discrete Mathematics (cs.DM), 0102 computer and information sciences, 01 natural sciences, enumeration problems, kernelization, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, output-sensitive algorithms, polynomial delay, structural parameterizations, Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2101.03800
https://www.sciencedirect.com/science/article/pii/S0022000021000696
https://dblp.uni-trier.de/db/journals/jcss/jcss123.html#GolovachKKL22
https://drops.dagstuhl.de/opus/volltexte/2021/13682/pdf/LIPIcs-STACS-2021-37.pdf/
https://drops.dagstuhl.de/opus/volltexte/2021/13682/
https://dblp.uni-trier.de/db/journals/corr/corr2101.html#abs-2101-03800
https://arxiv.org/abs/2101.03800
https://arxiv.org/pdf/2101.03800
https://hdl.handle.net/11250/2980680
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.37

Distributed Alarming in the On-Duty and Off-Duty Models

Συγγραφείς: Bienkowski, M., Gasieniec, L., Klonowski, M., Korzeniowski, M., Mans, B., Schmid, S., Wattenhofer, R.

Πηγή: IEEE/ACM Transactions on Networking IEEE/ACM Trans. Networking Networking, IEEE/ACM Transactions on. 24(1):218-230 Feb, 2016

Scalable computational geometry in MapReduce

Συγγραφείς: Li, Yuan, Eldawy, Ahmed, Xue, Jie, Knorozova, Nadezda, Mokbel, Mohamed F, Janardan, Ravi

Πηγή: The VLDB Journal. 28(4)

Θεματικοί όροι: Networking and Information Technology R&D (NITRD), Bioengineering, Computational Geometry, MapReduce, Hadoop, Output-sensitive Algorithms, Distributed Systems, Data Format, Distributed Computing, Information Systems

Σύνδεσμος πρόσβασης: https://escholarship.org/uc/item/07d1j81x

Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time

Συγγραφείς: Eppstein, David

Συνεισφορές: David Eppstein

Θεματικοί όροι: polygonalization, non-crossing structures, output-sensitive algorithms

Περιγραφή αρχείου: application/pdf

Relation: Is Part Of LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.29

Διαθεσιμότητα: https://doi.org/10.4230/LIPIcs.SoCG.2023.29
https://nbn-resolving.org/urn:nbn:de:0030-drops-178790
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.29

Batched Predecessor and Sorting with Size-Priced Information in External Memory

Συγγραφείς: Bender, Michael A.^Aff10, Goswami, Mayank^Aff11, Medjedovic, Dzejla^Aff12, Montes, Pablo^Aff13, Tsichlas, Kostas^Aff14

Συνεισφορές: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Woeginger, Gerhard, Editorial Board Member^Aff6, Yung, Moti, Editorial Board Member^Aff7, Kohayakawa, Yoshiharu, editor^Aff8, Miyazawa, Flávio Keidi, editor^Aff9

Πηγή: LATIN 2020: Theoretical Informatics : 14th Latin American Symposium, São Paulo, Brazil, January 5-8, 2021, Proceedings. 12118:155-167

Output-Sensitive Computation of Force-Closure Grasps of a Semi-Algebraic Object

Συγγραφείς: Cheong, J.-S., Kruger, H., van der Stappen, A. F.

Πηγή: IEEE Transactions on Automation Science and Engineering IEEE Trans. Automat. Sci. Eng. Automation Science and Engineering, IEEE Transactions on. 8(3):495-505 Jul, 2011

Instance-Optimal Geometric Algorithms

Συγγραφείς: Afshani, Peyman, Barbay, Jérémy, Chan, Timothy M.

Πηγή: 2009 50th Annual IEEE Symposium on Foundations of Computer Science Foundations of Computer Science, 2009. FOCS '09. 50th Annual IEEE Symposium on. :129-138 Oct, 2009

Relation: 2009 IEEE 50th Annual Symposium on Foundations of Computer Science (FOCS)

Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration

Συγγραφείς: Golovach, Petr A., Komusiewicz, Christian, Kratsch, Dieter, Le, Van Bang

Συνεισφορές: Petr A. Golovach and Christian Komusiewicz and Dieter Kratsch and Van Bang Le

Θεματικοί όροι: enumeration problems, polynomial delay, output-sensitive algorithms, kernelization, structural parameterizations, matching cuts

Περιγραφή αρχείου: application/pdf

Relation: Is Part Of LIPIcs, Volume 187, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.37

Διαθεσιμότητα: https://doi.org/10.4230/LIPIcs.STACS.2021.37
https://nbn-resolving.org/urn:nbn:de:0030-drops-136823
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.37

Output-Optimal Massively Parallel Algorithms for Similarity Joins

Συγγραφείς: Hu, Xiao CSE, Yi, Ke, Tao, Yufei

Πηγή: ACM Transactions on Database Systems. 44:1-36

Θεματικοί όροι: Parallel computation, 0202 electrical engineering, electronic engineering, information engineering, Output-sensitive algorithms, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Similarity joins

Σύνδεσμος πρόσβασης: https://dblp.uni-trier.de/db/journals/tods/tods44.html#HuYT19
https://dl.acm.org/doi/10.1145/3311967
https://dialnet.unirioja.es/servlet/articulo?codigo=6895395
https://doi.org/10.1145/3311967

Interviews3D: A Platform for Interactive Handling of Massive Data Sets

Συγγραφείς: Brüderlin, Beat, Heyer, Mathias, Pfützner, Sebastian

Πηγή: IEEE Computer Graphics and Applications IEEE Comput. Grap. Appl. Computer Graphics and Applications, IEEE. 27(6):48-59 Jan, 2007

Output-optimal Parallel Algorithms for Similarity Joins

Συγγραφείς: Hu, Xiao, Tao, Yufei, Yi, Ke

Πηγή: Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. :79-90

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3034786.3056110

Output-sensitive well-separated pair decompositions for dynamic point sets

Συγγραφείς: Park, Eunhui, Mount, David M.

Πηγή: Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. :354-363

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/2525314.2525364

A new approach to output-sensitive voronoi diagrams and delaunay triangulations

Συγγραφείς: Miller, Gary L., Sheehy, Donald R.

Πηγή: Proceedings of the twenty-ninth annual symposium on Computational geometry. :281-288

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/2462356.2462372

A fast algorithm for well-spaced points and approximate delaunay graphs

Συγγραφείς: Miller, Gary L., Sheehy, Donald R., Velingker, Ameya

Πηγή: Proceedings of the twenty-ninth annual symposium on Computational geometry. :289-298

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/2462356.2462404

Fast stabbing of boxes in high dimensions

Συγγραφείς: Frank Nielsen

Πηγή: Canadian Conference on Computational Geometry ISBN: 9780773591134

Θεματικοί όροι: Computer graphics, computational geometry (digital and algorithmic aspects), computational geometry, 0211 other engineering and technologies, Output-sensitive algorithms, geometric combinatorial optimization, 0102 computer and information sciences, 02 engineering and technology, output-sensitive algorithms, Geometric combinatorial optimization, 01 natural sciences, Computational geometry, Theoretical Computer Science, Computer Science(all)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/1521653
https://doi.org/10.1016/s0304-3975(98)00336-3

On point covers of c-oriented polygons: On point covers of \(c-\)oriented polygons

Συγγραφείς: Frank Nielsen

Πηγή: Theoretical Computer Science. 263:17-29

Θεματικοί όροι: Precision-sensitive heuristics, 0102 computer and information sciences, Transversal and packing numbers, transversal and packing numbers, 01 natural sciences, Computational geometry, Theoretical Computer Science, Computer graphics, computational geometry (digital and algorithmic aspects), computational geometry, Output-sensitive algorithms, output-sensitive algorithms, 0101 mathematics, precision-sensitive heuristics, Computer Science(all)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/1635691
https://doi.org/10.1016/s0304-3975(00)00227-9
https://www.sciencedirect.com/science/article/pii/S0304397500002279
http://www.lix.polytechnique.fr/~nielsen/pdf/2001-PiercingOrientedPolygons-TCS.pdf
https://dblp.uni-trier.de/db/journals/tcs/tcs263.html#Nielsen01

Enumerating trichromatic triangles containing the origin in linear time

Συγγραφείς: Amr Elmasry

Πηγή: Journal of Discrete Algorithms. 17:45-50

Θεματικοί όροι: Coloured simplices, Computational Theory and Mathematics, Caratheodoryʼs theorem, Discrete Mathematics and Combinatorics, Output-sensitive algorithms, 0102 computer and information sciences, 0101 mathematics, Enumeration algorithms, 01 natural sciences, Theoretical Computer Science

Σύνδεσμος πρόσβασης: https://dblp.uni-trier.de/db/journals/jda/jda17.html#Elmasry12
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_1324105
https://www.sciencedirect.com/science/article/pii/S1570866712001426
https://core.ac.uk/display/81992489
https://www.sciencedirect.com/science/article/abs/pii/S1570866712001426
https://www.jaist.ac.jp/~uehara/JCCGG09/short/paper_71.pdf

A note on the problem of reporting maximal cliques

Συγγραφείς: C. Karande, F. Cazals

Πηγή: Theoretical Computer Science. 407:564-568

Θεματικοί όροι: Output sensitive algorithms, Maximal cliques, Maximal common subgraphs, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Enumeration problems, Theoretical Computer Science, Computer Science(all)