Zobrazeno 1 - 10
of 3 024
pro vyhledávání: '"Abrishami A"'
Autor:
Abrishami, Tara, Esperet, Louis, Giocanti, Ugo, Hamann, Matthias, Knappe, Paul, Möller, Rögnvaldur G.
We study the existence of periodic colorings and orientations in locally finite graphs. A coloring or orientation of a graph $G$ is periodic if the resulting colored or oriented graph is quasi-transitive, meaning that $V(G)$ has finitely many orbits
Externí odkaz:
http://arxiv.org/abs/2411.01951
Autor:
Abrishami, Tara, Briański, Marcin, Czyżewska, Jadwiga, McCarty, Rose, Milanič, Martin, Rzążewski, Paweł, Walczak, Bartosz
For a tree decomposition $\mathcal{T}$ of a graph $G$, let $\mu(\mathcal{T})$ denote the maximum size of an induced matching in $G$ with the property that some bag of $\mathcal{T}$ contains at least one endpoint of every edge of the matching. The ind
Externí odkaz:
http://arxiv.org/abs/2405.04617
Precise estimation of cardiac patients' current and future comorbidities is an important factor in prioritizing continuous physiological monitoring and new therapies. ML models have shown satisfactory performance in short-term mortality prediction of
Externí odkaz:
http://arxiv.org/abs/2403.01533
Sivaraman conjectured that if $G$ is a graph with no induced even cycle then there exist sets $X_1, X_2 \subseteq V(G)$ satisfying $V(G) = X_1 \cup X_2$ such that the induced graphs $G[X_1]$ and $G[X_2]$ are both chordal. We prove this conjecture in
Externí odkaz:
http://arxiv.org/abs/2310.05903
Publikováno v:
Epidemiology and Health System Journal, Vol 11, Iss 3, Pp 121-127 (2024)
Background and aims: Transcription errors pose significant risks to patient well-being, potentially leading to morbidity, mortality, and financial burdens on healthcare systems and society. This study assessed the prevalence of transcription errors a
Externí odkaz:
https://doaj.org/article/cdf8e84813d54244a361cb87743f225e
Autor:
Ramin Nourinia, Sare Safi, Mehrad Mohammadpour, Hamid Riazi-Esfahani, Mohammad Reza Ansari Astaneh, Khalil Ghasemi Falavarjani, Alireza Ramezani, Saeed Karimi, Sahba Fekri, Nazanin Ebrahimiadib, Elias Khalili Pour, Homayoun Nikkhah, Nasser Shoeibi, Narges Hassanpoor, Maryam Hosseini, Mojtaba Abrishami, Fatemeh Abdi, Anoushiravan Rahimi, Mohammad Hossein Jabbarpoor Bonyadi, Siamak Moradian, Sina Khosravi Mirzaei, Hamid Safi, Pasha Anvari, Kaveh Fadakar, Masoud Mirghorbani, Niloufar Mohammadbagheri, Firouze Hatami, Bahareh Kheiri, Mehdi Yaseri, Zahra Khorrami, Hamid Ahmadieh
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-9 (2024)
Abstract In this randomized controlled trial, we assessed the effects of three consecutive intra-silicone oil (SO) injections of methotrexate (MTX) on the outcomes of surgery for proliferative vitreoretinopathy grade C (PVR-C). Seventy-four eyes of 7
Externí odkaz:
https://doaj.org/article/ce04202a3e04454594841f68a9e88322
We revisit the recent polynomial-time algorithm for the MAX WEIGHT INDEPENDENT SET (MWIS) problem in bounded-degree graphs that do not contain a fixed graph whose every component is a subdivided claw as an induced subgraph [Abrishami, Dibek, Chudnovs
Externí odkaz:
http://arxiv.org/abs/2309.16995
Induced subgraphs and tree decompositions X. Towards logarithmic treewidth for even-hole-free graphs
A generalized $t$-pyramid is a graph obtained from a certain kind of tree (a subdivided star or a subdivided cubic caterpillar) and the line graph of a subdivided cubic caterpillar by identifying simplicial vertices. We prove that for every integer $
Externí odkaz:
http://arxiv.org/abs/2307.13684
Autor:
Abrishami, Tara, Alecu, Bogdan, Chudnovsky, Maria, Hajebi, Sepehr, Spirkl, Sophie, Vušković, Kristina
The tree-independence number tree-$\alpha$, first defined and studied by Dallard, Milani\v{c} and \v{S}torgel, is a variant of treewidth tailored to solving the maximum independent set problem. Over a series of papers, Abrishami et al. developed the
Externí odkaz:
http://arxiv.org/abs/2305.16258
Let $G$ be a Berge graph that has no odd prism and no antihole of length at least six as an induced subgraph. We show that every such graph $G$ with no balanced skew-partition is either complete or has an even pair.
Externí odkaz:
http://arxiv.org/abs/2305.00532