Search Results - [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC]

Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front by Dupin, Nicolas, Nielsen, Frank, Talbi, El-Ghazali

“… In dimension three (or upper), this induces NP-hard complexities. In the planar case, common optimality property is proven…”
Get full text

Multifractal Desynchronization of the Cardiac Excitable Cell Network During Atrial Fibrillation. I. Multifractal Analysis of Clinical Data by Attuel, Guillaume, Gerasimova-Chechkina, Evgeniya, Argoul, Françoise, Yahia, Hussein, Arneodo, Alain

“…Atrial fibrillation (AF) is a cardiac arrhythmia characterized by rapid and irregular atrial electrical activity with a high clinical impact on stroke…”
Get full text

Oritatami: A Computational Model for Molecular Co-Transcriptional Folding by Geary, Cody, Meunier, Pierre-Étienne, Schabanel, Nicolas, Seki, Shinnosuke

“…We introduce and study the computational power of Oritatami, a theoretical model that explores greedy molecular folding, whereby a molecular strand begins to fold before its production is complete…”
Get full text

Leanness Computation: Small Values and Special Graph Classes by Coudert, David, Coulomb, Samuel, Ducoffe, Guillaume

“…, COMPLEX NETWORKS'21). In this paper, we give a finer-grained complexity analysis of two related problems, namely…”
Get full text

From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows by Carvalho, Cláudio, Costa, Jonas, Lopes, Raul, Maia, Ana Karolinna, Nisse, Nicolas, Sales, Cláudia

“…An s-branching flow f in a network N = (D, u), where u is the capacity function, is a flow thatreaches every vertex in V(D) from s while loosing exactly one…”
Get full text

Freezing, Bounded-Change and Convergent Cellular Automata by Ollinger, Nicolas, Theyssier, Guillaume

“…This paper studies three classes of cellular automata from a computational point of view…”
Get full text

Holonomic equations and efficient random generation of binary trees by Lescanne, Pierre

“… Schröder trees has linear expected complexity and my algorithm that generates Motzkin trees is in O(n…”
Get full text

A Type System Describing Unboundedness by Parys, Paweł

“…We consider nondeterministic higher-order recursion schemes as recognizers of languages of finite words or finite trees. We propose a type system that allows…”
Get full text

New schemes for simplifying binary constraint satisfaction problems by Naanaa, Wady

“…Finding a solution to a Constraint Satisfaction Problem (CSP) is known to be an NP-hard task. This has motivatedthe multitude of works that have been devoted…”
Get full text

Constrained ear decompositions in graphs and digraphs by Havet, Frédéric, Nisse, Nicolas

“… In this paper, we study the complexity of deciding whether a graph admits an ear decomposition with prescribed ear lengths…”
Get full text

On interval number in cycle convexity by Araujo, Julio, Ducoffe, Guillaume, Nisse, Nicolas, Suchan, Karol

“…Recently, Araujo et al. [Manuscript in preparation, 2017] introduced the notion of Cycle Convexity of graphs. In their seminal work, they studied the graph…”
Get full text

Vertex order with optimal number of adjacent predecessors by Jérémy Omer, Tangi Migot

“…In this paper, we study the complexity of the selection of a graph discretization order with a stepwise linear cost function…”
Get full text

Computing metric hulls in graphs by Knauer, Kolja, Nisse, Nicolas

“…We prove that, given a closure function the smallest preimage of a closed set can be calculated in polynomial time in the number of closed sets. This implies…”
Get full text

Permutation Pattern matching in (213, 231)-avoiding permutations by Neou, Both, Rizzi, Romeo, Vialette, Stéphane

“…Given permutations σ of size k and π of size n with k < n, the permutation pattern matching problem is to decide whether σ occurs in π as an order-isomorphic…”
Get full text

Almost envy-free allocations with connected bundles by Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker

Get full text

Packing Arc-Disjoint Cycles in Tournaments by Bessy, Stéphane, Bougeret, Marin, Krithika, R., Sahu, Abhishek, Saurabh, Saket, Thiebaut, Jocelyn, Zehavi, Meirav

Get full text

Fine costs for Euclid's algorithm on polynomials and Farey maps by Berthé, Valérie, Nakada, Hitoshi, Natsui, Rie, Vallée, Brigitte

“… The usual bit-complexity is defined with respect to the degree of the quotients; we focus here on a notion of ‘fine’ complexity…”
Get full text

Universal Relations and #P-Completeness by Fournier, Hervé, Malod, Guillaume

Get full text

A Universal Semi-totalistic Cellular Automaton on Kite and Dart Penrose Tilings by Imai, Katsunobu, Hatsuda, Takahiro, Poupet, Victor, Kota, Sato

Get full text

Editorial: Advances in data-driven approaches and modeling of complex systems by Mohd, Mohd Hafiz, Nguyen-Huu, Tri, Park, Junpyo, Addawe, Joel, M, Haga, Hirohide

Get full text