Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Odak, Saeed"'
Autor:
Aloupis, Greg, Biniaz, Ahmad, Bose, Prosenjit, De Carufel, Jean-Lou, Eppstein, David, Maheshwari, Anil, Odak, Saeed, Smid, Michiel, Tóth, Csaba D., Valtr, Pavel
Edge crossings in geometric graphs are sometimes undesirable as they could lead to unwanted situations such as collisions in motion planning and inconsistency in VLSI layout. Short geometric structures such as shortest perfect matchings, shortest spa
Externí odkaz:
http://arxiv.org/abs/2410.05580
Autor:
Bekos, Michael A., Bose, Prosenjit, Büngener, Aaron, Dujmović, Vida, Hoffmann, Michael, Kaufmann, Michael, Morin, Pat, Odak, Saeed, Weinberger, Alexandra
We study the impact of forbidding short cycles to the edge density of $k$-planar graphs; a $k$-planar graph is one that can be drawn in the plane with at most $k$ crossings per edge. Specifically, we consider three settings, according to which the fo
Externí odkaz:
http://arxiv.org/abs/2408.16085
Autor:
Biniaz, Ahmad, Bose, Prosenjit, De Carufel, Jean-Lou, Maheshwari, Anil, Miraftab, Babak, Odak, Saeed, Smid, Michiel, Smorodinsky, Shakhar, Yuditsky, Yelena
We explore the concept of separating systems of vertex sets of graphs. A separating system of a set $X$ is a collection of subsets of $X$ such that for any pair of distinct elements in $X$, there exists a set in the separating system that contains ex
Externí odkaz:
http://arxiv.org/abs/2312.14295
We show that every $n$-vertex triangulation has a connected dominating set of size at most $10n/21$. Equivalently, every $n$ vertex triangulation has a spanning tree with at least $11n/21$ leaves. Prior to the current work, the best known bounds were
Externí odkaz:
http://arxiv.org/abs/2312.03399
The odd colouring number is a new graph parameter introduced by Petru\v{s}evski and \v{S}krekovski. In this note, we show that graphs with so called product structure have bounded odd-colouring number. By known results on the product structure of $k$
Externí odkaz:
http://arxiv.org/abs/2202.12882
The \emph{Product Structure Theorem} for planar graphs (Dujmovi\'c et al.\ \emph{JACM}, \textbf{67}(4):22) states that any planar graph is contained in the strong product of a planar $3$-tree, a path, and a $3$-cycle. We give a simple linear-time alg
Externí odkaz:
http://arxiv.org/abs/2202.08870
The odd colouring number is a new graph parameter introduced by Petru\v{s}evski and \v{S}krekovski. In this note, we show that graphs with so called product structure have bounded odd-colouring number. By known results on the product structure of $k$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::34fd1cd78cbba0b999f56da18e4ace94
http://arxiv.org/abs/2202.12882
http://arxiv.org/abs/2202.12882