相关论文: Hypergraph covering problems motivated by genome a…

An important question in the study of constraint satisfaction problems (CSP) is understanding how the graph or hypergraph describing the incidence structure of the constraints influences the complexity of the problem. For binary CSP…

In the past several years, the problem of genome assembly has received considerable attention from both biologists and computer scientists. An important component of current assembly methods is the scaffolding process. This process involves…

For data sampled from an arbitrary density on a manifold embedded in Euclidean space, the Continuous k-Nearest Neighbors (CkNN) graph construction is introduced. It is shown that CkNN is geometrically consistent in the sense that under…

Systems of polynomial equations arise frequently in computer vision, especially in multiview geometry problems. Traditional methods for solving these systems typically aim to eliminate variables to reach a univariate polynomial, e.g., a…

Continual Graph Learning (CGL) enables models to incrementally learn from streaming graph-structured data without forgetting previously acquired knowledge. Experience replay is a common solution that reuses a subset of past samples during…

In recent work by Johnson et al. (2022), a framework was described for the study of graph problems over classes specified by omitting each of a finite set of graphs as subgraphs. If a problem falls into the framework then its computational…

Polynomial systems occur in many areas of science and engineering. Unlike general nonlinear systems, the algebraic structure enables to compute all solutions of a polynomial system. We describe our massive parallel predictor-corrector…

An abundance of real-world problems manifest as covering edges and/or vertices of a graph with cliques that are optimized for some objectives. We consider different structural parameters of graph, and design fixed-parameter tractable…

We continue the study of the recently-introduced C123-framework, for (simple) graph problems restricted to inputs specified by the forbidding of some finite set of subgraphs, to more general graph problems possibly involving multiedges and…

We study the complexity of the Distributed Constraint Satisfaction Problem (DCSP) on a synchronous, anonymous network from a theoretical standpoint. In this setting, variables and constraints are controlled by agents which communicate with…

We consider the class of conditional graph patterns (\emph{CGPs}) that allow user to query data graphs with complex patterns that contain negation and predicates. To overcome the prohibitive cost of subgraph isomorphism, we consider…

Given a sequence of $s$-uniform hypergraphs $\{H_n\}_{n \geq 1}$, denote by $T_p(H_n)$ the number of edges in the random induced hypergraph obtained by including every vertex in $H_n$ independently with probability $p \in (0, 1)$. Recent…

Clique-width is a well-studied graph parameter. For graphs of bounded clique-width, many problems that are NP-hard in general can be polynomial-time solvable. The fact motivates several studies to investigate whether the clique-width of…

We initiate the study of constraint satisfaction problems (CSPs) in the presence of counting quantifiers, which may be seen as variants of CSPs in the mould of quantified CSPs (QCSPs). We show that a single counting quantifier strictly…

In real-world systems, the relationships and connections between components are highly complex. Real systems are often described as networks, where nodes represent objects in the system and edges represent relationships or connections…

We consider a variant of the set covering problem with uncertain parameters, which we refer to as the chance-constrained set multicover problem (CC-SMCP). In this problem, we assume that there is uncertainty regarding whether a selected set…

Persistence diagrams, which summarize the birth and death of homological features extracted from data, are employed as stable signatures for applications in image analysis and other areas. Besides simply considering the multiset of…

Mixed packing and covering problems are problems that can be formulated as linear programs using only non-negative coefficients. Examples include multicommodity network flow, the Held-Karp lower bound on TSP, fractional relaxations of set…

We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…

We revisit the algorithmic problem of reconstructing a graph from homomorphism counts that has first been studied in (B\"oker et al., STACS 2024): given graphs $F_1,\ldots,F_k$ and counts $m_1,\ldots,m_k$, decide if there is a graph $G$…