Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles Fulltext Access 9 Pages 2018
Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems Fulltext Access 9 Pages 2018
On the number of rainbow spanning trees in edge-colored complete graphs Fulltext Access 10 Pages 2018
Splitting a planar graph of girth 5 into two forests with trees of small diameter Fulltext Access 10 Pages 2018
Characterizing approximate-matching dependencies in formal concept analysis with pattern structures Fulltext Access 10 Pages 2018
Graphical characterization of positive definite non symmetric quasi-Cartan matrices Fulltext Access 10 Pages 2018
Parameterized complexity of distance labeling and uniform channel assignment problems Fulltext Access 10 Pages 2018
Flow-contractible configurations and group connectivity of signed graphs Fulltext Access 10 Pages 2018
The list chromatic index of simple graphs whose odd cycles intersect in at most one edge Fulltext Access 10 Pages 2018
The weighted coloring problem for two graph classes characterized by small forbidden induced structures Fulltext Access 10 Pages 2018
Existence of regular unimodular triangulations of dilated empty simplices Fulltext Access 10 Pages 2018
On the largest sizes of certain simultaneous core partitions with distinct parts Fulltext Access 10 Pages 2018
On the complexity of clustering with relaxed size constraints in fixed dimension Fulltext Access 10 Pages 2018
On the dominating induced matching problem: Spectral results and sharp bounds Fulltext Access 10 Pages 2018
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid Fulltext Access 10 Pages 2018
Algorithmic aspects of rotor-routing and the notion of linear equivalence Fulltext Access 10 Pages 2018
Parameterized algorithms for stable matching with ties and incomplete lists Fulltext Access 10 Pages 2018
The convexity of induced paths of order three and applications: Complexity aspects Fulltext Access 10 Pages 2018
Simple linear-time algorithms for counting independent sets in distance-hereditary graphs Fulltext Access 10 Pages 2018
On inverse linear programming problems under the bottleneck-type weighted Hamming distance Fulltext Access 10 Pages 2018
Fixed points and connections between positive and negative cycles in Boolean networks Fulltext Access 10 Pages 2018
Optimal algorithms for inverse vertex obnoxious center location problems on graphs Fulltext Access 10 Pages 2018
Approximation algorithms for the scaffolding problem and its generalizations Fulltext Access 11 Pages 2018
Constructions for optimal cyclic ternary constant-weight codes of weight four and distance six Fulltext Access 11 Pages 2018
On network formation games with heterogeneous players and basic network creation games Fulltext Access 11 Pages 2018
Budget-constrained multi-battle contests: A new perspective and analysis Fulltext Access 11 Pages 2018
Online buffer management for transmitting packets with processing cycles Fulltext Access 11 Pages 2018
Distinguishing chromatic numbers of complements of Cartesian products of complete graphs Fulltext Access 11 Pages 2018
On the degree of regularity of a certain quadratic Diophantine equation Fulltext Access 11 Pages 2018