-
1Academic Journal
Συγγραφείς: Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke
Συνεισφορές: Jan Böker and Louis Härtel and Nina Runde and Tim Seppelt and Christoph Standke
Πηγή: Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 19:1-19:20 (2024). doi:10.4230/LIPIcs.STACS.2024.19
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11-2024-03-14
41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)Θεματικοί όροι: FOS: Computer and information sciences, Mathematics of computing → Graph theory, Discrete Mathematics (cs.DM), Theory of computation → Graph algorithms analysis, graph homomorphism, parameterised complexity, Computer Science - Data Structures and Algorithms, counting complexity, FOS: Mathematics, Mathematics - Combinatorics, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics
Περιγραφή αρχείου: application/pdf
-
2Academic Journal
Συγγραφείς: Gajarský, Jakub, Jaffke, Lars, Lima, Paloma T., Novotná, Jana, Pilipczuk, Marcin, Rzążewski, Paweł, Souza, Uéverton S.
Συνεισφορές: Jakub Gajarský and Lars Jaffke and Paloma T. Lima and Jana Novotná and Marcin Pilipczuk and Paweł Rzążewski and Uéverton S. Souza, Chechik, Shiri, Navarro, Gonzalo, Rotenberg, Eva, Herman, Grzegorz
Πηγή: Leibniz International Proceedings in Informatics
58:1-58:8Θεματικοί όροι: FOS: Computer and information sciences, Mathematics of computing → Graph theory, Discrete Mathematics (cs.DM), 4. Education, 0102 computer and information sciences, 16. Peace & justice, 01 natural sciences, hereditary graph class, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Minimal separator, 0101 mathematics, Computer Science - Discrete Mathematics
Περιγραφή αρχείου: application/pdf
-
3Academic Journal
Συγγραφείς: F. V. Paulovich, A. Arleo, S. van den Elzen
Πηγή: Computer Graphics Forum. 44
Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Machine Learning, CCS Concepts, • Computing methodologies → Dimensionality reduction and manifold learning, • Mathematics of computing → Graph theory, • Human-centered computing → Visualization, Machine Learning (cs.LG)
Συνδεδεμένο Πλήρες ΚείμενοΣύνδεσμος πρόσβασης: http://arxiv.org/abs/2412.06555
-
4Academic Journal
Συγγραφείς: Katheder, Julia, Kaufmann, Michael, Pupyrev, Sergey, Ueckerdt, Torsten, Beyersdorff, Olaf, Pilipczuk, Michał, Pimentel, Elaine, Thắng, Nguyễn Kim
Θεματικοί όροι: ddc:004, Mathematics of computing → Graph theory, Stack Number, Separated linear Layouts, DATA processing & computer science, Queue Number, bipartite Graphs, mixed Number, Mathematics of computing → Combinatorics
Περιγραφή αρχείου: application/pdf
-
5Academic Journal
Συγγραφείς: Haun, Deborah, Merker, Laura, Pupyrev, Sergey, Beyersdorff, Olaf
Θεματικοί όροι: ddc:004, Mathematics of computing → Graph theory, DATA processing & computer science, linear Layout, Stack Layout, Ordered Graphs, Queue Layout, mixed linear Layout
Περιγραφή αρχείου: application/pdf
-
6Conference
Συγγραφείς: Balev, Stefan, Sanlaville, Éric, Toullalan, Antoine
Συνεισφορές: Equipe Réseaux d'interactions et Intelligence Collective (LITIS - RI2C), Laboratoire d'Informatique, du Traitement de l'Information et des Systèmes (LITIS), Université Le Havre Normandie (ULH), Normandie Université (NU)-Normandie Université (NU)-Université de Rouen Normandie (UNIROUEN), Normandie Université (NU)-Institut national des sciences appliquées Rouen Normandie (INSA Rouen Normandie), Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Institut National des Sciences Appliquées (INSA)-Université Le Havre Normandie (ULH), Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Institut National des Sciences Appliquées (INSA), Université Le Havre Normandie - UFR Sciences et Techniques (ULHN UFR ST), Normandie Université (NU)-Normandie Université (NU), ANR-22-CE48-0001,TEMPOGRAL,Problèmes algorithmiques sur les graphes temporels(2022)
Πηγή: Leibniz International Proceedings in Informatics (LIPIcs) ; Symposium on Algorithmic Foundations of Dynamic Networks (SAND) ; https://normandie-univ.hal.science/hal-05283832 ; Symposium on Algorithmic Foundations of Dynamic Networks (SAND), Jun 2025, LIVERPOOL, United Kingdom. ⟨10.4230/LIPIcs.SAND.2025.2⟩
Θεματικοί όροι: Mathematics of computing → Graph theory, Temporal Graph Exploration, Graph Theory, Temporal Graph Exploration Digital Object Identifier 10.4230/LIPIcs.SAND.2025.2, Temporal Graph, 2012 ACM Subject Classification Mathematics of computing → Graph theory Graph Theory, 2012 ACM Subject Classification Mathematics of computing → Graph theory Graph Theory Temporal Graph Temporal Graph Exploration Digital Object Identifier 10.4230/LIPIcs.SAND.2025.2, [INFO]Computer Science [cs], [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]
Θέμα γεωγραφικό: LIVERPOOL, United Kingdom
-
7Academic Journal
Συγγραφείς: Aichholzer, Oswin, García, Alfredo, Tejel, Javier, Vogtenhuber, Birgit, Weinberger, Alexandra
Συνεισφορές: Oswin Aichholzer and Alfredo García and Javier Tejel and Birgit Vogtenhuber and Alexandra Weinberger, Goaoc, Xavier, Kerber, Michael
Πηγή: Discrete Comput Geom
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Universidad de Zaragoza
instnameΘεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, Mathematics of computing → Graph theory, plane matching, Simple drawings, 0102 computer and information sciences, Mathematics of computing → Combinatorics, 01 natural sciences, simple topological graphs, Article, disjoint edges, Computer Science - Computational Geometry, ddc:004, plane path
Περιγραφή αρχείου: application/pdf
Συνδεδεμένο Πλήρες ΚείμενοΣύνδεσμος πρόσβασης: https://pubmed.ncbi.nlm.nih.gov/38192902
http://arxiv.org/abs/2203.06143
http://zaguan.unizar.es/record/118720
http://zaguan.unizar.es/record/132154
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.5 -
8Academic Journal
Συγγραφείς: Kanté, Mamadou Moustapha, Kim, Eun Jung, Kwon, O-Joung, Oum, Sang-Il
Συνεισφορές: Mamadou Moustapha Kanté and Eun Jung Kim and O-joung Kwon and Sang-il Oum, Kanté, Mamadou, Berenbrink, Petra and Monmege, Benjamin
Πηγή: Journal of Combinatorial Theory, Series B. 160:15-35
Θεματικοί όροι: Linear rank-width, path-width, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases path-width matroid linear rank-width graph forbidden minor vertex-minor pivot-minor, 0102 computer and information sciences, 01 natural sciences, Graph, forbidden minor, FOS: Mathematics, Vertex-minor, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases path-width, pivot-minor, Matroid, linear rank-width, Pivot-minor, graph, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Path-width, Combinatorics, vertex-minor, Forbidden minor, matroid, Combinatorics (math.CO), ddc:004, Recherche opérationnelle, 05B35 (Primary), 05C75 (Secondary)
Περιγραφή αρχείου: application/pdf
Συνδεδεμένο Πλήρες ΚείμενοΣύνδεσμος πρόσβασης: http://arxiv.org/abs/2109.12291
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.40
https://hal.science/hal-04056695v1
https://doi.org/10.1016/j.jctb.2022.12.004
https://hal.science/hal-04056545v2/document
https://hal.science/hal-04056545v2
https://doi.org/10.4230/lipics.stacs.2022.40 -
9Report
Συγγραφείς: Balev, Stefan, Sanlaville, Eric, Toullalan, Antoine
Συνεισφορές: Equipe Réseaux d'interactions et Intelligence Collective (LITIS - RI2C), Laboratoire d'Informatique, du Traitement de l'Information et des Systèmes (LITIS), Université Le Havre Normandie (ULH), Normandie Université (NU)-Normandie Université (NU)-Université de Rouen Normandie (UNIROUEN), Normandie Université (NU)-Institut national des sciences appliquées Rouen Normandie (INSA Rouen Normandie), Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Institut National des Sciences Appliquées (INSA)-Université Le Havre Normandie (ULH), Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Institut National des Sciences Appliquées (INSA), Normandie Université (NU), LITIS, Le Havre Normandie University, ANR-22-CE48-0001,TEMPOGRAL,Problèmes algorithmiques sur les graphes temporels(2022)
Πηγή: https://normandie-univ.hal.science/hal-05020820 ; LITIS, Le Havre Normandie University. 2025.
Θεματικοί όροι: Temporal graph, Graph exploration, Graph Theory, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases Graph Exploration Graph Theory Temporal Graph, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases Graph Exploration, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]
-
10Academic Journal
Συγγραφείς: Roberson, David E., Seppelt, Tim
Συνεισφορές: David E. Roberson and Tim Seppelt, Etessami, Kousha, Feige, Uriel, Puppis, Gabriele
Πηγή: Roberson, D E & Seppelt, T 2024, ' Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability ', TheoretiCS, vol. 3, 20 . https://doi.org/10.46298/theoretics.24.20
Roberson, D E & Seppelt, T 2023, Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability . in Proceedings of the 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) . vol. 261, 101, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, pp. 101:1-101:18, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), Paderborn, North Rhine-Westphalia, Germany, 10/07/2023 . https://doi.org/10.4230/LIPIcs.ICALP.2023.101
Roberson, D E & Seppelt, T 2023, Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability . in K Etessami, U Feige & G Puppis (eds), 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023 ., 101, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics, LIPIcs, vol. 261, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, Paderborn, Germany, 10/07/2023 . https://doi.org/10.4230/LIPIcs.ICALP.2023.101
Dagstuhl, Germany : Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics 261, 101:1-101:18 (2023). doi:10.4230/LIPICS.ICALP.2023.101
50th International Colloquium on Automata, Languages and Programming (ICALP 2023) / Herausgeber: Kousha Etessami, Uriel Feige, Gabriele Puppis
50th International Colloquium on Automata, Languages and Programming (ICALP 2023) / Herausgeber: Kousha Etessami, Uriel Feige, Gabriele Puppis50. International Colloquium on Automata, Languages and Programming, ICALP 2023, Paderborn, Germany, 2023-07-10-2023-07-14
TheoretiCS : an open access journal in theoretical computer science 3, 12321 (2024). doi:10.46298/theoretics.24.20
42 Seiten (2023). doi:10.48550/ARXIV.2302.10538
TheoretiCSΘεματικοί όροι: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Discrete Mathematics (cs.DM), Treewidth, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Graph isomorphism, Homomorphism indistinguishability, Linear programming, FOS: Mathematics, treewidth, Mathematics - Combinatorics, Semidefinite programming, Mathematics - Optimization and Control, Lasserre hierarchy, graph isomorphism, Mathematics of computing → Graph theory, linear programming, semidefinite programming, Mathematics of computing → Combinatorics, Logic in Computer Science (cs.LO), Computer Science - Computational Complexity, Optimization and Control (math.OC), Sherali–Adams hierarchy, homomorphism indistinguishability, Combinatorics (math.CO), ddc:004, Sherali-Adams hierarchy, Computer Science - Discrete Mathematics
Περιγραφή αρχείου: application/pdf
Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2302.10538
https://orbit.dtu.dk/en/publications/fb2ad2b2-79a1-4dd4-89d9-c1db18db5340
https://orbit.dtu.dk/en/publications/7a8177cd-cdb4-4e46-8018-3012bdcc3350
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.101
https://curis.ku.dk/ws/files/362936484/Lasserre_Hierarchy.pdf
https://publications.rwth-aachen.de/record/960915
https://publications.rwth-aachen.de/record/992330
https://publications.rwth-aachen.de/record/992617 -
11Book
Συγγραφείς: Bulteau, Laurent, Dabrowski, Konrad, Köhler, Noleen, Ordyniak, Sebastian, Paulusma, Daniël
Συνεισφορές: Bulteau, Laurent, Bekos, M.A., Kaufmann, M.
Πηγή: Lecture Notes in Computer Science ISBN: 9783031159138
Bekos, M.A. & Kaufmann, M. (Eds.). Graph-Theoretic Concepts in Computer Science. WG 2022. : Springer, pp. 114-128, Lecture Notes in Computer Science, Vol.13453Θεματικοί όροι: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), fracture number, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], Computational Complexity (cs.CC), 01 natural sciences, (locally constrained) graph homomorphism parameterized complexity fracture number, integer linear programming, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), parameterized complexity, role assignment, 2012 ACM Subject Classification Mathematics of computing → Graph theory locally constrained homomorphism, deletion set/modulator to small components, 2012 ACM Subject Classification Mathematics of computing → Graph theory locally constrained homomorphism parameterized complexity deletion set/modulator to small components role assignment integer linear programming, Computer Science - Computational Complexity, Combinatorics (math.CO), Recherche opérationnelle, (locally constrained) graph homomorphism, Computer Science - Discrete Mathematics
Περιγραφή αρχείου: application/pdf
-
12Academic Journal
Συγγραφείς: Adler, Isolde, Fluck, Eva
Συνεισφορές: Isolde Adler and Eva Fluck
Πηγή: Saarbrücken/Wadern, Germany : Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 306, 6:1-6:18 (2024). doi:10.4230/LIPICS.MFCS.2024.6
49th International Symposium on Mathematical Foundations of Computer Science : (MFCS 2024), August 26-30, 2024, Bratislava, Slovakia / Edited by Rastislav Královič, Antonín Kučera
49th International Symposium on Mathematical Foundations of Computer Science : (MFCS 2024), August 26-30, 2024, Bratislava, Slovakia / Edited by Rastislav Královič, Antonín Kučera49. International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, Bratislava, Slovakia, 2024-08-26-2024-08-30Θεματικοί όροι: FOS: Computer and information sciences, Mathematics of computing → Graph theory, Discrete Mathematics (cs.DM), treedepth, G.2.2, cops-and-robber game, monotonicity, 16. Peace & justice, treewidth, FOS: Mathematics, Mathematics - Combinatorics, homomorphism distinguishing closure, Combinatorics (math.CO), ddc:004, tree decompositions, Computer Science - Discrete Mathematics
Περιγραφή αρχείου: application/pdf
-
13Conference
Συγγραφείς: Seppelt, Tim Frederik
Συνεισφορές: Tim Seppelt
Πηγή: Saarbrücken/Wadern, Germany : Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 306, 82:1-82:19 (2024). doi:10.4230/LIPIcs.MFCS.2024.82
49th International Symposium on Mathematical Foundations of Computer Science : (MFCS 2024), August 26-30, 2024, Bratislava, Slovakia / Edited by Rastislav Královič, Antonín Kučera
49th International Symposium on Mathematical Foundations of Computer Science : (MFCS 2024), August 26-30, 2024, Bratislava, Slovakia / Edited by Rastislav Královič, Antonín Kučera49. International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, Bratislava, Slovakia, 2024-08-26-2024-08-30
49th International Symposium on Mathematical Foundations of Computer ScienceΘεματικοί όροι: Computer Science - Logic in Computer Science, Mathematics of computing → Graph theory, recognisability, Mathematics of computing → Combinatorics, graph minor, Courcelle's Theorem, Computer Science - Computational Complexity, Theory of computation → Graph algorithms analysis, graph homomorphism, randomised algorithm, Mathematics - Combinatorics, Theory of computation → Parameterized complexity and exact algorithms, homomorphism indistinguishability, ddc:004, Computer Science - Discrete Mathematics
Περιγραφή αρχείου: application/pdf
-
14Conference
Συνεισφορές: Kanté, Mamadou
Θεματικοί όροι: Theory of computation → Models of computation, Mathematics of computing → Graph theory, STACS 2024, Theory of computation → Design and analysis of algorithms, Theory of computation → Formal languages and automata theory, Complete Volume, [INFO] Computer Science [cs], Volume 289, Theory of computation → Computational complexity and cryptography, Mathematics of computing → Combinatorics, Theory of computation → Logic, LIPIcs
Σύνδεσμος πρόσβασης: https://hal.science/hal-04859229v1
-
15Conference
Συγγραφείς: Siebertz, Sebastian, Vigny, Alexandre
Συνεισφορές: Sebastian Siebertz and Alexandre Vigny, Vigny, Alexandre
Θεματικοί όροι: Mathematics of computing → Graph theory, algorithmic graph structure theory, monadic second-order logic, [INFO] Computer Science [cs], ddc:004, Theory of computation → Finite Model Theory, Algorithmic meta theorems, first-order logic, disjoint paths logic
Περιγραφή αρχείου: application/pdf
-
16Academic Journal
Συγγραφείς: Ardévol Martínez, Virginia, Rizzi, Romeo, Saffidine, Abdallah, Sikora, Florian, Vialette, Stéphane
Συνεισφορές: Virginia Ardévol Martínez and Romeo Rizzi and Abdallah Saffidine and Florian Sikora and Stéphane Vialette, Sikora, Florian
Θεματικοί όροι: Unit Interval Graphs, FOS: Computer and information sciences, Mathematics of computing → Graph theory, Discrete Mathematics (cs.DM), Characterization, [INFO] Computer Science [cs], Computer Science - Data Structures and Algorithms, Interval graphs, Multiple Interval Graphs, Data Structures and Algorithms (cs.DS), ddc:004, Computer Science - Discrete Mathematics
Περιγραφή αρχείου: application/pdf
-
17Conference
Συγγραφείς: Cautrès, Maxime, Claudet, Nathan, Mhalla, Mehdi, Perdrix, Simon, Savin, Valentin, Thomassé, Stéphan
Συνεισφορές: École normale supérieure de Lyon (ENS de Lyon), Université de Lyon, Commissariat à l'énergie atomique et aux énergies alternatives - Laboratoire d'Electronique et de Technologie de l'Information (CEA-LETI), Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Designing the Future of Computational Models (MOCQUA), Centre Inria de l'Université de Lorraine, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique de Grenoble (LIG), Institut National de Recherche en Informatique et en Automatique (Inria)-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), Calculs algorithmes programmes et preuves (CAPP), Université Grenoble Alpes (UGA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS), Modèles de calcul, Complexité, Combinatoire (MC2), Laboratoire de l'Informatique du Parallélisme (LIP), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon), Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), European Association for Theoretical Computer Science (EATCS), ANR-22-PETQ-0007,EPiQ,Etude de la pile quantique : Algorithmes, modèles de calcul et simulation pour l'informatique quantique(2022), ANR-22-QUA2-0005,EQUIP,Error Correction for Quantum Information Processing(2022), European Project: NEASQC, European Project: 101018180,H2020-JTI-EuroHPC-2020-01,H2020-JTI-EuroHPC-2020-2,HPCQS(2021)
Πηγή: European Association for Theoretical Computer Science (EATCS) ; ICALP 2024 51st EATCS International Colloquium on Automata, Languages and Programming ; https://hal.science/hal-04632835 ; ICALP 2024 51st EATCS International Colloquium on Automata, Languages and Programming, European Association for Theoretical Computer Science (EATCS), Jul 2024, Tallinn, Estonia. ⟨10.4230/LIPIcs.ICALP.2024.36⟩
Θεματικοί όροι: k-pairability, Theory of computation → Quantum information theory, Theory of computation → Quantum communication complexity, Mathematics of computing → Graph theory, vertex-minors, graph states, Quantum networks, [INFO]Computer Science [cs], [PHYS.QPHY]Physics [physics]/Quantum Physics [quant-ph]
Time: Tallinn, Estonia
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2402.06260; info:eu-repo/grantAgreement//101018180/EU/High Performance Computer and Quantum Simulator hybrid/HPCQS; ARXIV: 2402.06260
-
18Conference
Συγγραφείς: Böker, Jan Wilhelm, Härtel, Louis, Runde, Nina Katrin, Seppelt, Tim Frederik, Standke, Christoph
Πηγή: Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Leibniz International Proceedings in Informatics : LIPIcs 289, 19:1-19:20 (2024). doi:10.4230/LIPIcs.STACS.2024.19 ; 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024) ; 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024) 41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11 - 2024-03-15
Θεματικοί όροι: Mathematics of computing → Graph theory, Theory of computation → Graph algorithms analysis, Theory of computation → Parameterized complexity and exact algorithms, counting complexity, graph homomorphism, parameterised complexity
Θέμα γεωγραφικό: DE
Relation: info:eu-repo/semantics/altIdentifier/issn/1868-8969; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-311-9; info:eu-repo/semantics/altIdentifier/wos/WOS:001300393400019; info:eu-repo/grantAgreement/EC//101054974
-
19Conference
Συγγραφείς: Fluck, Eva, Seppelt, Tim Frederik, Spitzer, Gian Luca
Πηγή: Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 288, 27:[1]-27:17 (2024). doi:10.4230/LIPIcs.CSL.2024.27 ; 32nd EACSL Annual Conference on Computer Science Logic : CSL 2024, February 19–23, 2024, Naples, Italy / edited by Aniello Murano Alexandra Silva ; 32nd EACSL Annual Conference on Computer Science Logic : CSL 2024, February 19–23, 2024, Naples, Italy / edited by Aniello Murano Alexandra Silva 32. EACSL Annual Conference on Computer Science Logic, CSL 2024, Naples, Italy, 2024-02-19 - 2024-02-23
Θεματικοί όροι: Mathematics of computing → Graph theory, Theory of computation → Finite Model Theory, Treewidth, counting first-order logic, homomorphism indistinguishability, treedepth
Θέμα γεωγραφικό: DE
Relation: info:eu-repo/semantics/altIdentifier/issn/1868-8969; info:eu-repo/semantics/altIdentifier/wos/WOS:001300390800027; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-310-2; info:eu-repo/grantAgreement/EC//101054974
-
20Academic Journal
Συγγραφείς: Seppelt, Tim Frederik
Συνεισφορές: Tim Seppelt
Πηγή: Information and computation 301(Part A), 105224 (2024). doi:10.1016/j.ic.2024.105224 special issue: "Special issue on the 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) / Guest Editors: Dr. Jérôme Leroux, Professor David Peleg"
48. International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, Bordeaux, France, 2023-08-28-2023-09-01
Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics: LIPIcs 272, 82:1-82:15 (2023). doi:10.4230/LIPIcs.MFCS.2023.82
48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) / Herausgeber: Jérôme Leroux, Sylvain Lombardy, David Peleg
48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) / Herausgeber: Jérôme Leroux, Sylvain Lombardy, David Peleg48. International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, Bordeaux, France, 2023-08-28-2023-09-01
Information and ComputationΘεματικοί όροι: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, logic, Mathematics of computing → Graph theory, Discrete Mathematics (cs.DM), 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Mathematics of computing → Combinatorics, graph minor, Logic in Computer Science (cs.LO), Computer Science - Computational Complexity, FOS: Mathematics, Mathematics - Combinatorics, homomorphism indistinguishability, Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics
Περιγραφή αρχείου: application/pdf
Συνδεδεμένο Πλήρες ΚείμενοΣύνδεσμος πρόσβασης: http://arxiv.org/abs/2302.11290
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.82
https://publications.rwth-aachen.de/record/992907
https://publications.rwth-aachen.de/record/964005