Results 101 to 110 of about 306 (178)
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
Causal Unit Selection using Tractable Arithmetic Circuits
Proceedings of the International Florida Artificial Intelligence Research Society ConferenceThe unit selection problem aims to find objects, called units, that optimize a causal objective function which describes the objects' behavior in a causal context (e.g., selecting customers who are about to churn but would most likely change their mind ...
Haiying Huang, Adnan Darwiche
doaj +1 more source
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. [PDF]
Algorithmica, 2022 Gąsieniec L, Klasing R, Radzik T.
europepmc +1 more source
Faster algorithms for counting subgraphs in sparse graphs. [PDF]
Algorithmica, 2021 Bressan M.
europepmc +1 more source
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths. [PDF]
Algorithmica, 2021 Ganian R, Ordyniak S.
europepmc +1 more source
Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection. [PDF]
Theory Comput Syst, 2021 Mengel S, Skritek S.
europepmc +1 more source
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. [PDF]
Algorithmica, 2021 Novotná J +5 more
europepmc +1 more source
An Algorithmic Treatment of Causal Unit Selection. [PDF]
Entropy (Basel)Huang H, Darwiche A.
europepmc +1 more source
Welfare optimization for resource allocation with peer effects. [PDF]
PNAS NexusQiu Z +6 more
europepmc +1 more source
, 1993 This thesis focuses on problems related to treewidth and pathwidth of graphs. Many problems are difficult to solve for graphs in general. The treewidth of a graph is a good indication whether one can obtain a solution within reasonable time. A necessary ingredient is a treedecomposition of the graph with small width.
openaire +1 more source