Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Jan Foniok"'
Autor:
Jan Foniok
Publikováno v:
Logical Methods in Computer Science, Vol Volume 10, Issue 3 (2014)
Let F be a set of relational trees and let Forbh(F) be the class of all structures that admit no homomorphism from any tree in F; all this happens over a fixed finite relational signature $\sigma$. There is a natural way to expand Forbh(F) by unary r
Externí odkaz:
https://doaj.org/article/1a8739da174840ae8f5e0763d9628d51
Autor:
Jan Foniok, Claude Tardif
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 11 no. 2, Iss Graph and Algorithms (2009)
Graphs and Algorithms
Externí odkaz:
https://doaj.org/article/e558b3dea6bb4b73994e378bdffd16ac
Autor:
Karina Piwarska, Robert J. Whittaker, Chris Bick, Sofia Trejo, Vinh Doan, Martine J. Barons, J. G. Williams, Colin P. Please, Antoine Choffrut, Laura Guzman-Rincon, Norbert Peyerimhoff, Roger Hill, Jan Foniok, Marco Caselli, Caoimhe Rooney, Emily Kawabata, Yuanwei Xu, Luke Whincop, Payman Eslami, Giovanni Mizzi, Chris Norman
A Railway Traffic Management problem can be defined as forecasting fu- ture progression of trains, identifying conflicts where two or more trains compete for available infrastructure, investigating options for resolution of conflicts, re-planning tra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8541e408d3973bfb32df7fefac922046
https://doi.org/10.33774/miir-2021-f9x91
https://doi.org/10.33774/miir-2021-f9x91
Autor:
Jan Foniok, Hanan Batarfi, Chris Budd, Xiaodong Li, Francisco Rodrigues, Ran Dong, Ellen Murphy, A.A. Lacey, Alex Wendland, Kamil Kulesza, Alan R Champneys, Edmund Barter, Ambrose Yim
This report details the work carried out by the Study Group on workflow modelling of con- struction projects. Data on the progress of about a hundred projects over a single five-year planning period were provided by Heathrow Airport (the client) and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5655c8095d8d31a3d8996a2a046de277
https://doi.org/10.33774/miir-2021-cvlwr
https://doi.org/10.33774/miir-2021-cvlwr
Autor:
Jan Foniok, Claude Tardif
Publikováno v:
Applied Categorical Structures. 26:113-128
We survey results on Hedetniemi’s conjecture which are connected to adjoint functors in the “thin” category of graphs, and expose the obstacles to extending these results.
Publikováno v:
DISCRETE APPLIED MATHEMATICS
© 2017 Elsevier B.V. The celebrated theorem of Robertson and Seymour states that in the family of minor-closed graph classes, there is a unique minimal class of graphs of unbounded tree-width, namely, the class of planar graphs. In the case of tree-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9eb7fb2f687b8af7419a971646c94e08
Publikováno v:
Electronic Notes in Discrete Mathematics. 29:389-396
We show that for structures with at most two relations all finite maximal antichains in the homomorphism order correspond to finite homomorphism dualities. We also show that most finite maximal antichains in this order split.
Autor:
Jan Foniok, Claude Tardif
For our purposes, two functors {\Lambda} and {\Gamma} are said to be respectively left and right adjoints of each other if for any digraphs G and H, there exists a homomorphism of {\Lambda}(G) to H if and only if there exists a homomorphism of G to {
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b30069a5a640262aac7995d43892ead0
https://e-space.mmu.ac.uk/601222/
https://e-space.mmu.ac.uk/601222/
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783319123394
The paper [J. Balogh, B. Bollobas, D. Weinreich, A jump to the Bell number for hereditary graph properties, J. Combin. Theory Ser. B 95 (2005) 29–48] identifies a jump in the speed of hereditary graph properties to the Bell number \(B_n\) and provi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::806018965f7089518825b211487d155c
https://doi.org/10.1007/978-3-319-12340-0_6
https://doi.org/10.1007/978-3-319-12340-0_6
Unique-sink orientations (USOs) are an abstract class of orientations of the n-cube graph. We consider some classes of USOs that are of interest in connection with the linear complementarity problem. We summarise old and show new lower and upper boun
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eee8318ff9490f50be75c8733735cebb
https://e-space.mmu.ac.uk/601166/
https://e-space.mmu.ac.uk/601166/