Search Results - Output-polynomial algorithm
-
1
Authors:
Source: Discrete Applied Mathematics. 376:1-14
Subject Terms: Optimization and Control (math.OC), FOS: Mathematics, Mathematics - Optimization and Control
Access URL: http://arxiv.org/abs/2305.12867
-
2
Authors:
Contributors:
Source: Algorithmica, vol 86, iss 9
Subject Terms: 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
File Description: application/pdf
-
3
Authors:
Source: Lecture Notes in Computer Science ISBN: 9783540281771
-
4
Authors:
Contributors:
Subject Terms: polygonalization, non-crossing structures, output-sensitive algorithms
File Description: 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
-
5
Authors: et al.
Contributors: et al.
Source: SIAM Journal on Computing. 51:1580-1625
Subject Terms: graph enumeration, output polynomial, polynomial delay, proximity search, FOS: Computer and information sciences, 0102 computer and information sciences, [INFO] Computer Science [cs], 05C30, 05C85, 01 natural sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), graph enumeration polynomial delay proximity search, F.2.2
File Description: application/pdf
-
6
Authors: et al.
Contributors: et al.
Source: Lecture Notes in Computer Science ISBN: 9783662489703
Subject Terms: FOS: Computer and information sciences, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Computer Science - Data Structures and Algorithms, 1. No poverty, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Data Structures and Algorithms (cs.DS), 16. Peace & justice
Access URL: http://arxiv.org/pdf/1509.03753
http://arxiv.org/abs/1509.03753
https://dblp.uni-trier.de/db/conf/isaac/isaac2015.html#GolovachHKKSV15
https://arxiv.org/pdf/1509.03753v2
https://rd.springer.com/chapter/10.1007/978-3-662-48971-0_22
https://link.springer.com/10.1007/978-3-662-48971-0_22
https://link.springer.com/chapter/10.1007/978-3-662-48971-0_22/fulltext.html
https://link.springer.com/article/10.1007/s00453-017-0289-1
https://hal.archives-ouvertes.fr/hal-02083480
https://link.springer.com/article/10.1007/s00453-017-0289-1/figures/1
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica80.html#GolovachHKKSV18
https://doi.org/10.1007/s00453-017-0289-1
https://rd.springer.com/article/10.1007/s00453-017-0289-1 -
7
Authors: et al.
Contributors: et al.
Subject Terms: parameterized algorithms, treewidth, multicriteria optimization problems, multicriteria MST, multicriteria TSP, polygon aggregation
File Description: application/pdf
Relation: Is Part Of LIPIcs, Volume 351, 33rd Annual European Symposium on Algorithms (ESA 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.105
-
8
Authors: et al.
Contributors: et al.
Subject Terms: Theory of Computation, Randomized Algorithms, Straight-Line
File Description: application/postscript
-
9
Authors:
Index Terms: polygonalization, non-crossing structures, output-sensitive algorithms, InProceedings, Text, doc-type:ResearchArticle, publishedVersion
URL:
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.29
Is Part Of LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023) -
10
Authors: et al.
Source: Sādhanā: Academy Proceedings in Engineering Sciences; Dec2025, Vol. 50 Issue 4, p1-14, 14p
-
11
Authors: et al.
Contributors: et al.
Source: https://hal.archives-ouvertes.fr/hal-01653717 ; 2017.
Subject Terms: Polyadic Concept Analysis, Incremental Algorithm, Output-polynomial Algorithm, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
Relation: hal-01653717; https://hal.archives-ouvertes.fr/hal-01653717; https://hal.archives-ouvertes.fr/hal-01653717/document; https://hal.archives-ouvertes.fr/hal-01653717/file/NCremental.pdf
-
12
-
13
Authors:
Source: PLoS ONE; 11/11/2025, Vol. 20 Issue 11, p1-29, 29p
-
14
Authors: et al.
Contributors: et al.
Source: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
https://hal.science/hal-02181721
36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Mar 2019, Berlin, Germany. pp.16:1--16:12, ⟨10.4230/LIPIcs.STACS.2019.16⟩Subject Terms: triangle-free graphs, split graphs, minimal dominating set, output-polynomial algorithms, enumeration algorithms, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
-
15
Authors:
Contributors:
Subject Terms: Totally unimodular matrices, Vertices of polyhedra, Vertex enumeration, Hypergraph transversals, Hypergraph decomposition, Output polynomial-time algorithm
File Description: application/pdf
Relation: Is Part Of LIPIcs, Volume 101, 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2018.18
-
16
Authors: et al.
Source: Proceedings of the ACM on Management of Data. 3:1-19
Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Computational Complexity (cs.CC)
Access URL: http://arxiv.org/abs/2504.04757
-
17
-
18
Authors: et al.
Source: Graph-Theoretic Concepts in Computer Science (978-3-540-74838-0); 2007, p316-327, 12p
-
19
Authors:
Source: SIAM Journal on Computing. 32:514-537
Subject Terms: FOS: Computer and information sciences, combinatorial enumeration, Analysis of algorithms and problem complexity, Applications of graph theory, 0211 other engineering and technologies, G.2.1, G.2.2, 0102 computer and information sciences, 02 engineering and technology, dualization, Computational Complexity (cs.CC), Hypergraphs, 01 natural sciences, Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, treewidth, Data Structures and Algorithms (cs.DS), Boolean functions, hypergraph acyclicity, Database theory, output-polynomial algorithms, F.2.2, F.1.3, transversal computation, Computer Science - Computational Complexity, hypergraphs, Knowledge representation, Graph theory (including graph drawing) in computer science, Switching theory, application of Boolean algebra, limited nondeterminism
File Description: application/xml
Access URL: http://arxiv.org/abs/cs/0204009
https://arxiv.org/pdf/cs/0204009
https://ui.adsabs.harvard.edu/abs/2002cs........4009E/abstract
http://portal.acm.org/citation.cfm?doid=509907.509912
http://www.kr.tuwien.ac.at/staff/eiter/et-archive/dual-stoc02.pdf
https://dblp.uni-trier.de/db/journals/corr/corr0204.html#cs-DS-0204009
https://www.cs.ox.ac.uk/publications/publication176-abstract.html
https://ora.ox.ac.uk/objects/uuid:08358504-8295-4044-add3-3e389c6cfa59
https://ora.ox.ac.uk/objects/uuid:0f8cffd0-f051-4deb-91a7-84054df48cc2
https://ora.ox.ac.uk/objects/uuid:6ad59704-11d2-497d-8fd1-3906bb0b7519
https://doi.org/10.1145/509907.509912 -
20
Authors: et al.
Source: Inductive Logic Programming (9783540281771). 2005, p1-19. 19p.
Full Text Finder 
Nájsť tento článok vo Web of Science 
Full Text