-
1Academic Journal
المؤلفون: Scheidt, Benjamin
المساهمون: Benjamin Scheidt
مصطلحات موضوعية: homomorphism indistinguishability, counting logics, guarded logics, hypergraphs, incidence graphs, tree depth, elimination forest, hypertree width
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 297, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.152
-
2Report
المؤلفون: Bagan, Guillaume, Bousquet, Nicolas, Oijid, Nacim, Pierron, Théo
المساهمون: Graphes, AlgOrithmes et AppLications (GOAL), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS), Université Claude Bernard Lyon 1 (UCBL), Université de Lyon, ANR-21-CE48-0001,P-GASE,Jeux positionnels : complexité, algorithmes et stratégies(2021)
المصدر: https://hal.science/hal-04501118 ; 2024.
مصطلحات موضوعية: eternal dominating set, tree-depth, PSPACE-completeness, parameterized complexity, [INFO]Computer Science [cs], [MATH]Mathematics [math]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2401.10584; hal-04501118; https://hal.science/hal-04501118; https://hal.science/hal-04501118/document; https://hal.science/hal-04501118/file/2401.10584.pdf; ARXIV: 2401.10584
-
3Academic Journal
المؤلفون: Staniszewski, Konrad
المساهمون: Konrad Staniszewski
مصطلحات موضوعية: Parity Games, Circuits, Tree-Depth, Clique-Width
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 252, 31st EACSL Annual Conference on Computer Science Logic (CSL 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.33
-
4Academic Journal
المؤلفون: Jiang, Yiting, Nešetřil, Jaroslav, Ossona de Mendez, Patrice
المساهمون: Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Univerzita Karlova Praha, Česká republika = Charles University Prague, Czech Republic (UK), Centre d'Analyse et de Mathématique sociales (CAMS), École des hautes études en sciences sociales (EHESS)-Centre National de la Recherche Scientifique (CNRS), European Project: DYNASNET
المصدر: ISSN: 0095-8956.
مصطلحات موضوعية: χ-bounded, bounded expansion, star coloring, χs -bounded, tree-depth coloring, subdivision, topological minor, restricted homomorphism duality, even-hole free graph, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
-
5Conference
مصطلحات موضوعية: integer programming, width parameters, matroids, graver basis, tree-depth, fixed parameter tractability
-
6Academic JournalWhen Locality Meets Preservation ; Localité et théorèmes de préservation en logique du premier ordre
المؤلفون: Lopez, Aliaume
المساهمون: Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)
المصدر: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science ; https://hal.science/hal-03883990 ; Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science, 2022, pp.1-14. ⟨10.1145/3531130.3532498⟩
مصطلحات موضوعية: Undecidability, Preservation theorem, Well quasi ordering, Tree depth, Locality, Gaifman normal form, Finite Model Theory, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Relation: hal-03883990; https://hal.science/hal-03883990; https://hal.science/hal-03883990/document; https://hal.science/hal-03883990/file/Lopez%20-%202022%20-%20When%20Locality%20Meets%20Preservation.pdf
-
7Academic Journal
المؤلفون: Strasser, Ben
المساهمون: Ben Strasser
مصطلحات موضوعية: tree depth, graph algorithm, partitioning
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 180, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.32
-
8Academic Journal
المؤلفون: Cardinal, Jean, Pournin, Lionel, Valencia-Pabon, Mario M.
المصدر: Procedia Computer Science, 195
مصطلحات موضوعية: Généralités, generalized permutohedra, graph associahedra, pathwidth, tree-depth, treewidth
وصف الملف: 1 full-text file(s): application/pdf
Relation: uri/info:doi/10.1016/j.procs.2021.11.030; uri/info:pii/S1877050921021694; uri/info:scp/85122909768; https://dipot.ulb.ac.be/dspace/bitstream/2013/339066/1/doi_322710.pdf; http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/339066
-
9Academic Journal
المؤلفون: Iwata, Yoichi, Ogasawara, Tomoaki, Ohsaka, Naoto
المساهمون: Yoichi Iwata and Tomoaki Ogasawara and Naoto Ohsaka
مصطلحات موضوعية: Fully Polynomial FPT Algorithm, Tree-Depth, Divide-and-Conquer
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 96, 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.41
-
10Academic Journal
المؤلفون: Sankaran, Abhisekh
المساهمون: Abhisekh Sankaran
مصطلحات موضوعية: downward Lowenheim-Skolem theorem, trees, nested words, tree-depth, cographs, tree representation, translation schemes, composition lemma, f.p.t, log
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 82, 26th EACSL Annual Conference on Computer Science Logic (CSL 2017); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2017.37
-
11Academic Journal
المؤلفون: Bannach, Max, Tantau, Till
المساهمون: Max Bannach and Till Tantau
مصطلحات موضوعية: Parallel computation, FPT, meta-theorems, tree width, tree depth
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 63, 11th International Symposium on Parameterized and Exact Computation (IPEC 2016); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.4
-
12Academic Journal
المؤلفون: Duroux, Roxane, Scornet, Erwan
المساهمون: Centre de Recherches sur les Littératures et la Sociopoétique (CELIS), Université Clermont Auvergne 2017-2020 (UCA 2017-2020 ), Centre de Mathématiques Appliquées de l'Ecole polytechnique (CMAP), Institut National de Recherche en Informatique et en Automatique (Inria)-École polytechnique (X), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS)
المصدر: ISSN: 1292-8100 ; EISSN: 1262-3318.
مصطلحات موضوعية: Random forests, randomization, parameter tuning, subsampling, tree depth, [MATH]Mathematics [math]
-
13
المؤلفون: David M. Kahn, Jan Hoffmann
المصدر: Proceedings of the ACM on Programming Languages. 5:1-29
مصطلحات موضوعية: Set (abstract data type), Theoretical computer science, Bounding overwatch, Computer science, Quantum superposition, Overhead (computing), Potential method, Remainder, Safety, Risk, Reliability and Quality, Tree-depth, Quantum, Software
-
14Academic Journal
المؤلفون: Pilipczuk, Michal, Wrochna, Marcin
المساهمون: Michal Pilipczuk and Marcin Wrochna
مصطلحات موضوعية: tree decomposition, LCS, tree-depth, NAuxSA, Savitch’s theorem
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 47, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.57
-
15Academic Journal
المؤلفون: Bannach, Max, Stockhusen, Christoph, Tantau, Till
المساهمون: Max Bannach and Christoph Stockhusen and Till Tantau
مصطلحات موضوعية: color coding, parallel computation, fixed-parameter tractability, graph packing, cutting $ell$ vertices, cluster editing, tree-width, tree-depth
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 43, 10th International Symposium on Parameterized and Exact Computation (IPEC 2015); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.224
-
16
المؤلفون: Daryl R. DeFord, Daniel N. Rockmore
المصدر: Linear Algebra and its Applications. 598:165-185
مصطلحات موضوعية: FOS: Computer and information sciences, Pure mathematics, Other Computer Science (cs.OH), Asymptotic distribution, 010103 numerical & computational mathematics, Tree-depth, 01 natural sciences, Branching (linguistics), Computer Science - Other Computer Science, Fibonacci polynomials, FOS: Mathematics, Mathematics - Combinatorics, Discrete Mathematics and Combinatorics, Representation Theory (math.RT), 0101 mathematics, Eigenvalues and eigenvectors, Mathematics, Numerical Analysis, Algebra and Number Theory, 010102 general mathematics, 05CXX, 11B39, Homogeneous, Adjacency list, Combinatorics (math.CO), Geometry and Topology, Mathematics - Representation Theory
-
17
المؤلفون: Aliaume Lopez
المساهمون: Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)
المصدر: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science, 2022, pp.1-14. ⟨10.1145/3531130.3532498⟩مصطلحات موضوعية: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Well quasi ordering, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Locality, Preservation theorem, Tree depth, Gaifman normal form, 03C13, 68Q99, Undecidability, Finite Model Theory, Logic in Computer Science (cs.LO)
-
18
المؤلفون: Heitor Murilo Gomes, Robert J. Durrant, Jesse Read, Albert Bifet
مصطلحات موضوعية: FOS: Computer and information sciences, Concept drift, Artificial Intelligence and Image Processing, Computer science, 02 engineering and technology, Tree-depth, Machine learning, computer.software_genre, Naive Bayes classifier, Artificial Intelligence, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Data stream mining, business.industry, Supervised learning, Ensemble learning, Random forest, Human-Computer Interaction, ComputingMethodologies_PATTERNRECOGNITION, Hardware and Architecture, Artificial intelligence, business, computer, Software, Subspace topology, Information Systems
-
19Academic Journal
مصطلحات موضوعية: Graph, Isomorphism, Canonization, Parameterized complexity, Fixed-parameter tractable, Bounded degree, Graph theory, Complexity theory, Tree-depth
وصف الملف: application/pdf
-
20Academic Journal
المؤلفون: Till Tantau
المصدر: Algorithms; Volume 9; Issue 3; Pages: 44
مصطلحات موضوعية: algorithmic metatheorems, Courcelle’s Theorem, tree width, tree depth, monadic second-order logic, logarithmic space, circuit classes
وصف الملف: application/pdf
Relation: https://dx.doi.org/10.3390/a9030044
الاتاحة: https://doi.org/10.3390/a9030044