Suchergebnisse - "Subexponential-time algorithms"
-
1
Autoren: et al.
Quelle: Foundations of Computational Mathematics. 24:865-914
Schlagwörter: FOS: Computer and information sciences, Mathematics - Statistics Theory, Machine Learning (stat.ML), Statistics Theory (math.ST), 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, Statistics - Machine Learning, Computer Science - Data Structures and Algorithms, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 0101 mathematics
Zugangs-URL: http://arxiv.org/abs/1907.11635
-
2
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Algorithmica
14th International Symposium on Parameterized and Exact Computation (IPEC 2019)Schlagwörter: FOS: Computer and information sciences, P -free graphs, 000 Computer science, knowledge, general works, General Computer Science, string graphs, String graphs, Applied Mathematics, Subexponential algorithm, feedback vertex set, Computational Complexity (cs.CC), Article, Computer Science Applications, subexponential algorithm, Computer Science - Computational Complexity, 13. Climate action, Computer Science, P_t-free graphs, Pt-free graphs, ddc:004, Feedback vertex set
Dateibeschreibung: application/pdf
Zugangs-URL: https://link.springer.com/content/pdf/10.1007/s00453-020-00745-z.pdf
https://pubmed.ncbi.nlm.nih.gov/34720297
http://arxiv.org/abs/1910.01082
https://research-portal.uu.nl/en/publications/6bf40e64-8d9e-4e2c-8145-5837e7c3c12d
https://doi.org/10.4230/LIPIcs.IPEC.2019.23
https://drops.dagstuhl.de/opus/volltexte/2019/11484/
https://doi.org/10.4230/LIPIcs.IPEC.2019.23
https://drops.dagstuhl.de/opus/volltexte/2019/11484/pdf/LIPIcs-IPEC-2019-23.pdf/
https://dblp.uni-trier.de/db/conf/iwpec/ipec2019.html#NovotnaOPRLW19
https://link.springer.com/content/pdf/10.1007/s00453-020-00745-z.pdf
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica83.html#NovotnaOPRLW21
https://link.springer.com/article/10.1007/s00453-020-00745-z
http://dblp.uni-trier.de/db/journals/corr/corr1910.html#abs-1910-01082
https://doi.org/10.1007/s00453-020-00745-z
http://arxiv.org/pdf/1910.01082.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.23
https://ruj.uj.edu.pl/xmlui/handle/item/130538
https://ruj.uj.edu.pl/xmlui/handle/item/282469
https://dspace.library.uu.nl/handle/1874/415731 -
3
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Algorithmica
Schlagwörter: FOS: Computer and information sciences, 0211 other engineering and technologies, QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, scattered set, H-free graphs, independent set, QA166-QA166.245 Graphs theory / gráfelmélet, subexponential algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), approximation
Dateibeschreibung: text; image/pdf
Zugangs-URL: https://link.springer.com/content/pdf/10.1007/s00453-018-0479-5.pdf
http://arxiv.org/abs/1804.04077
https://link.springer.com/article/10.1007/s00453-018-0479-5
https://www.narcis.nl/publication/RecordID/oai%3Adspace.library.uu.nl%3A1874%2F382147
http://real.mtak.hu/90072/
https://dblp.uni-trier.de/db/journals/corr/corr1804.html#abs-1804-04077
http://doi.org/10.1007/s00453-018-0479-5
http://dspace.library.uu.nl/handle/1874/382147
https://eprints.sztaki.hu/9823/
https://dspace.library.uu.nl/handle/1874/382147 -
4
Autoren: et al.
Quelle: Algorithmica vol.83 (2021) p.2634-2650 [ISSN 0178-4617]
Index Begriffe: Feedback vertex set, P -free graphs, String graphs, Subexponential algorithm, Article
URL:
https://research-portal.uu.nl/en/publications/6539230f-8096-477e-a060-0065d22c887f https://dspace.library.uu.nl/bitstream/handle/1874/415731/Novotn_2021_Article_Subexponential_TimeAlgorithmsF.pdf?sequence=1 https://dspace.library.uu.nl/bitstream/handle/1874/415731/Novotn_2021_Article_Subexponential_TimeAlgorithmsF.pdf?sequence=1 -
5
Autoren: et al.
-
6
Autoren: et al.
Quelle: Algorithmica vol.81 (2019) nr.2 p.421-438 [ISSN 0178-4617]
Index Begriffe: independent set, subexponential algorithms, approximation, scattered set, H-free graphs, Article
-
7
Autoren: et al.
-
8
Autoren: et al.
Quelle: Tsinghua Science and Technology. 19:374-386
Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 3. Good health
Zugangs-URL: https://ieeexplore.ieee.org/ielx7/5971803/6867510/06867519.pdf
http://tst.tsinghuajournals.com/EN/abstract/abstract148379.shtml
http://www.tsinghuajournals.com/tst/EN/abstract/abstract148379.shtml
https://cris.maastrichtuniversity.nl/en/publications/social-choice-meets-graph-drawing-how-to-get-subexponential -time - -
9
-
10
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány, Polynomial approximation, Parallel processing systems, Independent set, QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány, Time algorithms, Sub-exponential algorithms, Maximum independent sets, Graph theory, scattered set, H-free graphs, independent set, QA166-QA166.245 Graphs theory / gráfelmélet, Subexponential time, Scattered set, Graphic methods, subexponential algorithms, Parameter estimation, Polynomial-time algorithms, Set theory, ddc:004
Dateibeschreibung: application/pdf; text
-
11
Autoren: et al.
Quelle: Jansen, Bart M.P., Telle, Jan Arne (Ed.), 14th International Symposium on Parameterized and Exact Computation: IPEC 2019, September 11-13, 2019, Munich, Germany, Saarbrücken|: Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH. [ISBN 9783959771290]
Index Begriffe: subexponential algorithm, feedback vertex set, Pt-free graphs, string graphs, Conference contribution
-
12
-
13
Autoren: et al.
URL:
https://doi.org/10.1007/s00453-018-0479-5 http://hdl.handle.net/1874/382147 https://dspace.library.uu.nl/handle/1874/382147
0178-4617
Algorithmica
81
2
421
438 -
14
-
15
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: subexponential time, subgraph isomorphism, ddc:004, graph minors
Dateibeschreibung: application/pdf
Zugangs-URL: https://research.tue.nl/en/publications/9edf440e-4c1a-41d7-94b4-c2d3d83f266a
https://doi.org/10.4230/LIPIcs.ICALP.2016.9
https://research.tue.nl/en/publications/subexponential -time -algorithms -for-embedding-h-minor-free-graphs
https://dblp.uni-trier.de/db/conf/icalp/icalp2016.html#BodlaenderNZ16
https://drops.dagstuhl.de/opus/volltexte/2016/6275/pdf/LIPIcs-ICALP-2016-9.pdf/
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2F9edf440e-4c1a-41d7-94b4-c2d3d83f266a
https://drops.dagstuhl.de/opus/volltexte/2016/6275/
https://pure.tue.nl/ws/files/53480205/subex.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.9 -
16
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Computational Geometry (cs.CG), FOS: Computer and information sciences, Discrete Mathematics (cs.DM), triangulations, exponential-time algorithms, 0211 other engineering and technologies, QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computer Science - Data Structures and Algorithms, computational geometry, FOS: Mathematics, Computer Science - Computational Geometry, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics
Dateibeschreibung: application/pdf; text
Zugangs-URL: http://arxiv.org/abs/1603.07340
https://arxiv.org/abs/1603.07340
https://drops.dagstuhl.de/opus/volltexte/2016/5944/
https://drops.dagstuhl.de/opus/volltexte/2016/5944/pdf/LIPIcs-SoCG-2016-52.pdf/
https://arxiv.org/pdf/1603.07340v1
https://dblp.uni-trier.de/db/journals/corr/corr1603.html#MarxM16
http://ui.adsabs.harvard.edu/abs/2016arXiv160307340M/abstract
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.52
https://eprints.sztaki.hu/9029/ -
17
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Lecture Notes in Computer Science ISBN: 9783662483497
Schlagwörter: FOS: Computer and information sciences, cs.DS, General Computer Science, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 16. Peace & justice, 01 natural sciences, Theoretical Computer Science
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/pdf/1601.02415
http://arxiv.org/abs/1601.02415
https://research.tue.nl/en/publications/cfafc9a7-d049-4c19-823b-9b89094c01e8
https://dblp.uni-trier.de/db/journals/corr/corr1601.html#BodlaenderN16
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2F92f925c0-ae77-4f7f-aaaf-c881e093b6ca
https://ui.adsabs.harvard.edu/abs/2016arXiv160102415B/abstract
https://dspace.library.uu.nl/handle/1874/322950
https://rd.springer.com/chapter/10.1007/978-3-662-48350-3_16
https://pure.tue.nl/ws/files/48172281/1601.02415v2
https://dspace.library.uu.nl/handle/1874/322950 -
18
Autoren:
Quelle: Ioannis Chatzigiannakis Michael Mitzenmacher, Yuval Rabani, Sangiorgi, Davide (Ed.), 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), p.1-14. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. [ISBN 978-3-95977-013-2]
Index Begriffe: Conference contribution
-
19
Autoren:
Quelle: arXiv (2016) date: 2016-01-11 nr.1601.02415v2
Index Begriffe: cs.DS, Tijdschriftartikel, Article
-
20
Full Text Finder
Nájsť tento článok vo Web of Science