Results 81 to 90 of about 2,616,817 (282)

Parameterized algorithms for block-structured integer programs with large entries [PDF]

TheoretiCS
We study two classic variants of block-structured integer programming. Two-stage stochastic programs are integer programs of the form $\{A_i \mathbf{x} + D_i \mathbf{y}_i = \mathbf{b}_i\textrm{ for all }i=1,\ldots,n\}$, where $A_i$ and $D_i$ are bounded ...
Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michał Pilipczuk, Adam Polak   +4 more
doaj   +1 more source

Designing Vanadium‐Based Oxide Electrocatalysts for Water Splitting: Experimental and Mechanistic Insights with Machine Learning

Advanced Functional Materials, EarlyView.
This review establishes structure‐property‐mechanism relationships across six modification strategies for V‐based oxide water‐splitting electrocatalysts: lattice engineering, heteroatom doping, interface engineering, carbon‐based hybridization, morphology engineering, and surface reconstruction and pre‐catalyst design, where dissolution is reframed as ...
Youness El Issmaeli, Amina Lahrichi, Hoje Chun, Rafael Gómez‐Bombarelli, Bruno G. Pollet   +4 more
wiley   +1 more source

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges

Tsinghua Science and Technology, 2014
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (including Artificial Intelligence and Multiagent Systems) on the other ...
Robert Bredereck, Jiehua Chen, Piotr Faliszewski, Jiong Guo, Rolf Niedermeier, Gerhard J. Woeginger   +5 more
doaj   +1 more source

Fixed-parameter tractability of multicut in directed acyclic graphs

, 2012
The Multicut problem, given a graph G, a set of terminal pairs \ensuremathT={(si,ti) | 1≤i≤r} and an integer p, asks whether one can find a cutset consisting of at most p non-terminal vertices that separates all the terminal pairs, i.e., after removing ...
Michał Pilipczuk, Wahlström, Magnus, Marcin Pilipczuk, Kratsch, S., Pilipczuk, Marcin, Stefan Kratsch, Magnus Wahlström, Pilipczuk, M., Pilipczuk, Michał, Wahlström, M., Kratsch, Stefan, Michal Pilipczuk   +11 more
core   +1 more source

Nano Borophene as a Programmable 2D Scaffold for Organized DNA Assembly and Long‐Range Energy Transfer

Advanced Functional Materials, EarlyView.
Borophene is introduced as a programmable 2D bio‐interface that organizes DNA through dual boron–sulfur and nucleobase interactions. This molecular architecture enables efficient long‐range nanosurface energy transfer, establishing new design principles for functional nano–bio interfaces and amplification‐free optical biosensing.
Teresa Aditya, Pranay Saha, John M. Sansalone, Shraddha Krishnakumar, Matthew Molinaro, André J. van der Vlies, Nada Maher, Adrienne Griffiths, Zakhro Zakirova, Ketan Dighe, Narayana R. Aluru, Dipanjan Pan   +11 more
wiley   +1 more source

Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs

Journal of Graph Algorithms and Applications
In a right-angle crossing (RAC) drawing of a graph, each edge is represented as a polyline and edge crossings must occur at an angle of exactly $90^\circ$, where the number of bends on such polylines is typically restricted in some way.
Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager   +3 more
doaj   +1 more source

Exploiting bounded signal flow for graph orientation based on cause-effect pairs

Algorithms for Molecular Biology, 2011
Background We consider the following problem: Given an undirected network and a set of sender-receiver pairs, direct all edges such that the maximum number of "signal flows" defined by the pairs can be routed respecting edge directions.
Niedermeier Rolf, Krüger Dominikus, Hüffner Falk, Dorn Britta, Uhlmann Johannes   +4 more
doaj   +1 more source

Modification to Planarity is Fixed Parameter Tractable.

, 2019
A replacement action is a function L that maps each k-vertex labeled graph to another k-vertex graph. We consider a general family of graph modification problems, called L-Replacement to C, where the input is a graph G and the question is whether it is possible to replace in G some k-vertex subgraph H of it by L(H) so that the new graph belongs to the ...
Fomin, Fedor V., Golovach, Petr A., Thilikos, Dimitrios M.   +2 more
openaire   +4 more sources

Bounded-Degree Cut is Fixed-Parameter Tractable

CoRR, 2020
ICALP ...
Mingyu Xiao 0001, Hiroshi Nagamochi
openaire   +3 more sources

Limits to the Hall Effect and Other Nonreciprocal Effects in Three‐Dimensional Metamaterials

Advanced Materials, EarlyView.
Comprehensive and fundamental bounds on nonreciprocal effects in three‐dimensional metamaterials are derived. They reveal that the effective Hall mobility cannot exceed the largest constituent mobility, that, under certain conditions, the Verdet constant cannot be enhanced, and that, for constituents with Hall coefficients of the same sign, the largest
Christian Kern, Graeme W. Milton
wiley   +1 more source