المؤلفون: Mateusz Krzyziński, Paweł Rzążewski, Szymon Tur

المصدر: Discussiones Mathematicae Graph Theory, Vol 44, Iss 3, p 817 (2024)

مصطلحات موضوعية: Mathematics, QA1-939

وصف الملف: electronic resource

Relation: https://www.dmgt.uz.zgora.pl/?doi=10.7151/dmgt.2472; https://doaj.org/toc/1234-3099; https://doaj.org/toc/2083-5892

URL الوصول: https://doaj.org/article/cc28e601ae5a44478c4a04411cbfb4a3

المؤلفون: Zbigniew Lonc, Paweł Naroski, Paweł Rzążewski

المصدر: Discrete Mathematics & Theoretical Computer Science, Vol Vol. 19 no. 3, Iss Analysis of Algorithms (2017)

مصطلحات موضوعية: computer science - computational complexity, computer science - data structures and algorithms, Mathematics, QA1-939

وصف الملف: electronic resource

Relation: https://dmtcs.episciences.org/3755/pdf; https://doaj.org/toc/1365-8050

URL الوصول: https://doaj.org/article/6eeb6e9cc5f841fd8f665c9df8d595d8

المؤلفون: Jacob Focke, Dániel Marx, Paweł Rzążewski

مصطلحات موضوعية: Algorithmic Foundations and Cryptography

Relation: https://figshare.com/articles/conference_contribution/Counting_list_homomorphisms_from_graphs_of_bounded_treewidth_tight_complexity_bounds/24614052

الاتاحة: https://doi.org/10.60882/cispa.24614052.v1
https://figshare.com/articles/conference_contribution/Counting_list_homomorphisms_from_graphs_of_bounded_treewidth_tight_complexity_bounds/24614052

المؤلفون: Karolina Okrasa, Paweł Rzążewski

المصدر: Journal of Computer and System Sciences. 109:126-144

مصطلحات موضوعية: Computational Theory and Mathematics, Computer Networks and Communications, Applied Mathematics, Homomorphism, Graph homomorphism, Computational problem, Binary logarithm, Algorithm, Graph, MathematicsofComputing_DISCRETEMATHEMATICS, Theoretical Computer Science, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::b35479101e4c479b0a6c0f819f16f526
https://doi.org/10.1016/j.jcss.2019.12.004

المؤلفون: Paweł Rzążewski, Konstanty Junosza-Szaniawski, Joanna Chybowska-Sokół

المصدر: Discrete Applied Mathematics. 277:71-81

مصطلحات موضوعية: Applied Mathematics, Geometric representation, 0211 other engineering and technologies, 021107 urban & regional planning, 0102 computer and information sciences, 02 engineering and technology, Intersection graph, 01 natural sciences, Upper and lower bounds, Unit disk, Graph, Vertex (geometry), Combinatorics, 010201 computation theory & mathematics, Discrete Mathematics and Combinatorics, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::d35f179402039c11a85f42e9a3c6f248
https://doi.org/10.1016/j.dam.2019.08.020

المؤلفون: Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Paweł Rzążewski

المصدر: Discrete & Computational Geometry.

مصطلحات موضوعية: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Computational Complexity, Discrete Mathematics (cs.DM), Computational Theory and Mathematics, Computer Science - Computational Geometry, Discrete Mathematics and Combinatorics, Geometry and Topology, Computational Complexity (cs.CC), Computer Science - Discrete Mathematics, Theoretical Computer Science

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::73cf831aeda8a121e07bd5927e60b70f
https://doi.org/10.1007/s00454-022-00381-0

المؤلفون: Sándor Kisfaludi-Bak, Karolina Okrasa, Paweł Rzążewski

المصدر: Graph-Theoretic Concepts in Computer Science-48th International Workshop, WG 2022
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Graph-Theoretic Concepts in Computer Science
Graph-Theoretic Concepts in Computer Science ISBN: 9783031159138

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d3e82c06a500cbdff0e04828fdbb09cb

المؤلفون: Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Paweł Rzążewski

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::373be1205e01f79d9ea31438e73f5bd9
https://doi.org/10.1137/1.9781611977073.61

المؤلفون: Giacomo Paesani, Daniël Paulusma, Paweł Rzążewski

المساهمون: Bekos, M.A., Kaufmann, M.

المصدر: Bekos, M.A. & Kaufmann, M. (Eds.). Graph-Theoretic Concepts in Computer Science. WG 2022. : Springer, pp. 412-424, Lecture Notes in Computer Science, Vol.13453
Graph-Theoretic Concepts in Computer Science ISBN: 9783031159138

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::30ed3a1e735620a8ebf3ff8bbc6df436
http://dro.dur.ac.uk/37189/

المؤلفون: Paweł Rzążewski, Jan Kratochvíl, Jan Bok, Jiri Fiala, Nikola Jedličková

المصدر: Lecture Notes in Computer Science ISBN: 9783031066771

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::f26f5f1d3b214562a7970f80107678b1
https://doi.org/10.1007/978-3-031-06678-8_17

المؤلفون: Paweł Rzążewski, Paul Seymour, Karolina Okrasa, Carla Groenland, Alex Scott, Sophie Spirkl

المصدر: Discrete Applied Mathematics. 267:184-189

مصطلحات موضوعية: Exponential time hypothesis, Applied Mathematics, Multigraph, 0211 other engineering and technologies, Induced subgraph, 021107 urban & regional planning, 0102 computer and information sciences, 02 engineering and technology, Free graph, 01 natural sciences, Graph, Combinatorics, Pathwidth, 010201 computation theory & mathematics, Discrete Mathematics and Combinatorics, Homomorphism, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::a1828956e412dabf9932c03b217a499b
https://doi.org/10.1016/j.dam.2019.04.010

المؤلفون: Paweł Rzążewski, Édouard Bonnet

المصدر: Algorithmica. 81:3047-3073

مصطلحات موضوعية: Computational Geometry (cs.CG), FOS: Computer and information sciences, F.2.2, G.2.2, Exponential time hypothesis, General Computer Science, Applied Mathematics, String (computer science), Binary logarithm, Upper and lower bounds, Computer Science Applications, Planar graph, Combinatorics, symbols.namesake, Dominating set, symbols, Computer Science - Computational Geometry, 68Q17, 68Q25, Feedback vertex set, Unit (ring theory), Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be837f57e17c2501ee07f057b459bb1d
https://doi.org/10.1007/s00453-019-00568-7

المؤلفون: Michał Pilipczuk, Erik Jan van Leeuwen, Paweł Rzążewski, Bartosz Walczak, Jana Novotná, Karolina Okrasa

المساهمون: Wagner, Michael, Sub Algorithms and Complexity, Algorithms and Complexity

المصدر: Algorithmica, 83, 2634. Springer New York
Algorithmica

مصطلحات موضوعية: FOS: Computer and information sciences, P -free graphs, General Computer Science, Induced subgraph, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_t$$\end{document}Pt-free graphs, 01 natural sciences, Article, Combinatorics, subexponential algorithm, 0202 electrical engineering, electronic engineering, information engineering, 05C85, Pt-free graphs, Feedback vertex set, Mathematics, 000 Computer science, knowledge, general works, string graphs, String graphs, Applied Mathematics, Subexponential algorithm, 68Q25, feedback vertex set, Graph, Computer Science Applications, Computer Science - Computational Complexity, 010201 computation theory & mathematics, Theory of computation, Computer Science, 020201 artificial intelligence & image processing, Computer Science(all)

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eaed4a6aead840bd1a93db65ab37c1f8
https://dspace.library.uu.nl/handle/1874/415731

المؤلفون: Mateusz Krzyziński, Paweł Rzążewski, Szymon Tur

المصدر: Discussiones Mathematicae Graph Theory

مصطلحات موضوعية: Applied Mathematics, FOS: Mathematics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Combinatorics (math.CO)

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9e0f99c259a5bfcc4cdf346b41e585bd
http://arxiv.org/abs/2105.11235

المؤلفون: Konstanty Junosza-Szaniawski, Pawel Rzazewski

المصدر: Discrete Mathematics & Theoretical Computer Science, Vol Vol. 16 no. 3, Iss Discrete Algorithms (2014)

مصطلحات موضوعية: graph labeling, exact algorithm, t-coloring, generalized list t-coloring, channel assignment, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], Mathematics, QA1-939

Relation: https://dmtcs.episciences.org/2095/pdf; https://doaj.org/toc/1365-8050; https://doaj.org/article/24fd8801ba064fec9076d14819413713

الاتاحة: https://doi.org/10.46298/dmtcs.2095
https://doaj.org/article/24fd8801ba064fec9076d14819413713

المؤلفون: Paweł Rzążewski, Panos Giannopoulos, Marthe Bonamy, Stéphan Thomassé, Nicolas Bousquet, Édouard Bonnet, Pierre Charbit, Florian Sikora, Eun Jung Kim

المساهمون: Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE), Université Paris Dauphine-PSL, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), City University of London, Warsaw University of Technology [Warsaw], École normale supérieure de Lyon (ENS de Lyon), ANR-19-CE48-0013,DIGRAPHS,Digraphes(2019)

المصدر: Journal of the ACM (JACM)
Journal of the ACM (JACM), Association for Computing Machinery, 2021, 68 (2), pp.1-38. ⟨10.1145/3433160⟩
Journal of the ACM (JACM), 2021, 68 (2), pp.1-38. ⟨10.1145/3433160⟩
Journal of the ACM

مصطلحات موضوعية: Computational Geometry (cs.CG), FOS: Computer and information sciences, Unit sphere, QA75, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Induced subgraph, 0102 computer and information sciences, Computational Complexity (cs.CC), Clique (graph theory), [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, Artificial Intelligence, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Ball (mathematics), 0101 mathematics, ComputingMilieux_MISCELLANEOUS, Mathematics, Exponential time hypothesis, 010102 general mathematics, Intersection graph, Unit disk, Computer Science - Computational Complexity, Disjoint union (topology), 010201 computation theory & mathematics, Hardware and Architecture, Control and Systems Engineering, Computer Science - Computational Geometry, Algorithm, Software, Information Systems

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::08e7270d7f539eeb78e1d4fabec534de
https://hal.archives-ouvertes.fr/hal-03107441

المؤلفون: Michał Pilipczuk, Peter Gartland, Daniel Lokshtanov, Paweł Rzążewski, Marcin Pilipczuk

المصدر: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
STOC

مصطلحات موضوعية: Induced path, 010103 numerical & computational mathematics, 0102 computer and information sciences, 01 natural sciences, Degeneracy (graph theory), Vertex (geometry), Planar graph, Combinatorics, symbols.namesake, Integer, 010201 computation theory & mathematics, Independent set, Computer Science - Data Structures and Algorithms, symbols, Feedback vertex set, 0101 mathematics, Variety (universal algebra), Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1cca91d6360ae5aa54a28137c12831c2

المؤلفون: Marcin Pilipczuk, Michał Pilipczuk, Paweł Rzążewski

المصدر: 4th Symposium on Simplicity in Algorithms, SOSA 2021
Symposium on Simplicity in Algorithms (SOSA)

مصطلحات موضوعية: 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, 020206 networking & telecommunications, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b52bc0f50762efe67e3cad972274add

المؤلفون: Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Paweł Rzążewski, Paul Seymour

المصدر: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)

مصطلحات موضوعية: 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, 020206 networking & telecommunications, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e00496add80a8e6fc620590e241ee920

المؤلفون: Karolina Okrasa, Paweł Rzążewski

المصدر: 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)

URL الوصول: https://explore.openaire.eu/search/publication?articleId=r3c4b2081b22::6fe95ffabf515dd44e5fd3e86e48a77f