yusuke1997/dblp-id-title huggingface dataset:
Well-quasi-ordering H-contraction-free graphs
Robust location transportation problems under uncertain demands
Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover
Independent domination in finitely defined classes of graphs: Polynomial algorithms
Lower bounds for Ramsey numbers of K n with a small subgraph removed
On bipartite graphs of defect at most 4
Real royal road functions--where crossover provably is essential
Probably approximately correct learning of Horn envelopes from queries
A linear algorithm for minimum 1-identifying codes in oriented trees
Randomised algorithms
Binding numbers and restricted fractional (g, f)-factors in graphs
Constructing connected bicritical graphs with edge-connectivity 2
A note on adjacent vertex distinguishing colorings of graphs
A note on median eigenvalues of subcubic graphs
Sub-dominant theory in numerical taxonomy
Fractional matching preclusion number of graphs
Finding biclique partitions of co-chordal graphs
Enumeration of balanced ternary designs
Integer k-matchings of graphs: k-Berge-Tutte formula, k-factor-critical graphs and k-barriers
On the O(n 3 ) algorithm for checking the strong robustness of interval fuzzy matrices
A linear-time algorithm for minimum k-hop dominating set of a cactus graph
Suborthogonal Double Covers of the Complete Graph by Stars
The complexity of partitioning into disjoint cliques and a triangle-free graph
Consensus Functions on Trees that Satisfy Independence Axiom
Independent (k+1)-domination in k-trees
Complete weight enumerators of some irreducible cyclic codes
Semi-online scheduling on two identical machines with a common due date to maximize total early work
A note on b-coloring of Kneser graphs
Vehicle scheduling under the warehouse-on-wheels policy
Self-reading sequences
Near automorphisms of powers of a path
Minimizing Restricted-Fanout Queries
Constructing cospectral graphs by unfolding non-bipartite graphs
Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
On the parallel computation of the biconnected and strongly connected co-components of graphs
Classification of three-valued logical functions preserving 0
On the chromatic number of 2K2-free graphs
LexBFS-orderings of Distance-hereditary Graphs with Application to the Diametral Pair Problem
Nondegenerate Functions and Permutations
Ramsey and Gallai-Ramsey numbers for the union of paths and stars
On the expressive power of CNF formulas of bounded tree- and clique-width
On the reduction method for integer linear programs, II
Forwarding Indices of k -Connected Graphs
Relocalization - Theory and Practice
Optimal irreversible dynamos in chordal rings
Independence number and minimum degree for path-factor critical uniform graphs
Hamilton Circuits in the Directed Wrapped Butterfly Network
Filling some gaps on the edge coloring problem of split graphs
On constant discrete programming problems
The complexity of determinacy problem on group testing
Integral polyhedra related to integer multicommodity flows on a cycle
A -approximation algorithm for Graphic TSP in cubic bipartite graphs
The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs
Modified hyper-Wiener index of trees
Hybrid rounding techniques for knapsack problems
A new algorithm to find the shortest paths between all pairs of nodes
Remarks on Hamiltonian Properties of Powers of Digraphs
Diameters of Cubic Graphs
Algorithms for solving multiobjective discrete control problems and dynamic c-games on networks
Matrices inducing generalized metric on sequences
On the first geometric-arithmetic index of graphs
A short note on the existence of infinite sequences of γ-graphs of graphs
A note on isomorphic simulation of automata by networks of two-state automata
Improving the Caro-Wei bound and applications to Turán stability
Minimum cost and list homomorphisms to semicomplete digraphs
On the maximal augmented Zagreb index of unicyclic graphs with given girth
Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications
The constrained Bottleneck Spanning Tree Problem with upgrades
Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem
The Erdos-Ko-Rado Bound for the Function Lattice
The minor minimal intrinsically chiral graphs
Tree-edges deletion problems with bounded diameter obstruction sets
In Memoriam Walter Kern
A distributed algorithm to find k-dominating sets
Graphs in Which All Hamiltonian Cycles Have the Same Length
Greedy linear extensions to minimize jumps
Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
Scheduling subject to resource constraints: classification and complexity
Preface: LAGOS 2017 - IX Latin and American Algorithms, Graphs and Optimization Symposium, C.I.R.M. - Marseille, France, 2017
General upper bound on the game domination number
Energies of unitary one-matching bi-Cayley graphs over finite commutative rings
Accelerated partial decoding in wavelet trees
On the poset of all posets on n elements
Trees of extremal connectivity index
The H-force set of a hypertournament
Generalized balances in Sturmian words
Minimum-weight cycle covers and their approximability
Total colorings of complete multipartite graphs using amalgamations
2-bisections in claw-free cubic multigraphs
Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs
On spectral theory in discrete programming : References added in proof
A note on α-total domination in cubic graphs
New classes of clustering coefficient locally maximizing graphs
A new characterization of dual bases in finite fields and its applications
Finding the edge ranking number through vertex partitions
Constructive generation of very hard 3-colorability instances
Alternative MIP formulations for an integrated shift scheduling and task assignment problem
On the correspondence between tree representations of chordal and dually chordal graphs
Identifying codes and searching with balls in graphs
On the k-edge-incident subgraph problem and its variants
Construction of weightwise perfectly balanced Boolean functions with high weightwise nonlinearity
Matching preclusion for cube-connected cycles
Modeling and simulation of nitrogen regulation in Corynebacterium glutamicum
The discrete ellipsoid covering problem: A discrete geometric programming approach
On the distance-edge-monitoring numbers of graphs
On characterizing the class of cographic signed-graphic matroids
Simple 8-(40, 11, 1440) Designs
Introduction to special volume of Discrete Applied Mathematics
On the dual of the solvency cone
On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms
Reconstruction of segmentationally distributive space from its metric
On the number of connected sets with the neighborhood of a given size in a graph
Disjoint paths in symmetric digraphs
A spectral condition for the existence of component factors in graphs
On local and global independence numbers of a graph
Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
Upper bounds on the k-forcing number of a graph
Diametral broadcast graphs
Improving the high order nonlinearity lower bound for Boolean functions with given algebraic immunity
The Zagreb coindices of graph operations
A variable-dimension homotopy on networks for computing linear spatial equilibria
Maximization of input conductances of an infinite network
Thrackles: An improved upper bound
Container ship stowage problem: complexity and connection to the coloring of circle graphs
Waiting patterns for a printer
New clique and independent set algorithms for circle graphs
Resolvability in graphs and the metric dimension of a graph
The m -step, same-step, and any-step competition graphs
Preface for CTW2005 special issue
On minimum cuts and the linear arrangement problem
New bounds for perfect k-hashing
Complexity of representation of graphs by set systems
Unicyclic signed graphs with minimal energy
State transfer and star complements in graphs
Modeling the spread of fault in majority-based network systems: Dynamic monopolies in triangular grids
Algorithmic aspects of the k k-domination problem in graphs
Generalized Perfect Graphs: Characterizations and Inversion
On approximation problems related to the independent set and vertex cover problems
Density condensation of Boolean formulas
A simple criterion on degree sequences of graphs
On fractional version of oriented coloring
Single-peaked preferences over multidimensional binary alternatives
The signs of three-term recurrence sequences
The Construction of Cubic and Quartic Planar Maps with Prescribed Face Degrees
Locally monotone Boolean and pseudo-Boolean functions
Complexity results for minimum sum edge coloring
Slow coloring of 3k-connected graphs
A Technique to Find Multiple Motif Occurrences in a Biomolecular Sequence
Equistable distance-hereditary graphs
Odd coloring of 2-boundary planar graphs and beyond
Preface: CALDAM 2019
Complexity results on restricted instances of a paint shop problem for words
Deltahedra are realizable as simplicial convex polyhedra
The selective travelling salesman problem
Stability factor for robust balancing of simple assembly lines under uncertainty
Euler circuits and DNA sequencing by hybridization
Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
On (q, 1)-subnormal q-ary Covering Codes
Hardness and efficiency on t-admissibility for graph operations
A faster algorithm for packing branchings in digraphs
Analysis of Minimal Path Routing Schemes in the Presence of Faults
The Scheduling of Maintenance Service
The expected values for the Kirchhoff indices in the random hexagonal-quadrilateral chain and its spiro chain
Equivalence for negabent functions and their relative difference sets
Wirelength of hypercubes into certain trees
Indicated coloring of matroids
Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs
The task allocation problem with constant communication
The multi-terminal vertex separator problem: Branch-and-Cut-and-Price
Easy cases of the D0L sequence equivalence problem
On sum edge-coloring of regular, bipartite and split graphs
Fractional domination of strong direct products
On Generalized Perfect Graphs: Bounded Degree and Bounded Edge Perfection
Enumerating lambda terms by weighted length of their De Bruijn representation
Computing Optimal Rectilinear Steiner Trees: A Survey and Experimental Evaluation
On more variants of the Majority Problem
The wide-diameter of Z n, k
Exploring the missing link among d-separable, d _ -separable and d-disjunct matrices
On well-covered triangulations: Part III
On graphs on n vertices having an identifying code of cardinality [log 2 (n+1)]
A fast discovery algorithm for large common connected induced subgraphs
Compatible Eulerian Circuits in K n **
A biased edge coloring game
Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems
On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks
The linear chromatic number of a Sperner family
Applications of max-plus algebra to flow shop scheduling problems
Preface: 2nd Russian-Hungarian Combinatorial Workshop
On the Nth 2-adic complexity of binary sequences identified with algebraic 2-adic integers
Distributions of statistics on separable permutations
On the dynamic coloring of graphs
Total-rainbow connection and forbidden subgraphs
Fractional acquisition in graphs
On three outer-independent domination related parameters in graphs
The first and second Zagreb indices of some graph operations
On the b -dominating coloring of graphs
Identifying codes and locating-dominating sets on paths and cycles
Minsum hyperspheres in normed spaces
On independent set in B1-EPG graphs
On powers and centers of chordal graphs
Upgrading bottleneck constrained forests
On decision and optimization ( k, l )-graph sandwich problems
3-path-connectivity of Cayley graphs generated by transposition trees
On the size of maximum renamable Horn sub-CNF
Exact values of ex(nu;{C 3 , C 4 , ..., C n })
Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences
Genetic Algorithms in Coding Theory - A Table for A 3 ( n, d )
Weakly connected Roman domination in graphs
Solving symmetric mixed-model multi-level just-in-time scheduling problems
Editorial: Stringology Algorithms
Maximizing the number of cliques in graphs with given matching number
Reconfiguration of cliques in a graph
On dimensional rigidity of bar-and-joint frameworks
Solving the train marshalling problem by inclusion-exclusion
Short k-rotation symmetric Boolean functions
Comportement periodique des fonctions a seuil binaires et applications
Lower Bounds for Hypergraph Ramsey Numbers
On the peripheral Wiener index of graphs
Grundy packing coloring of graphs
Maximum bipartite subgraphs in graphs without short cycles
A polymatroid associated with convex games
Self-duality of bounded monotone boolean functions and related problems
Formulating the single machine sequencing problem with release dates as a mixed integer program
Optimization over degree sequences of graphs
Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers
Orientations of graphs with maximum Wiener index
Representation of lattices via set-colored posets
On cut vertices and eigenvalues of character graphs of solvable groups
Lower bounds on the integrality ratio of the subtour LP for the traveling salesman problem
A note on the weakly convex and convex domination numbers of a torus
Distances in graphs of girth 6 and generalised cages
Computing the minimal perimeter polygon for digital objects in the triangular tiling
Equal relation between g-good-neighbor diagnosability under the PMC model and g-good-neighbor diagnosability under the MM∗ model of a graph
A new class of optimal linear codes with flexible parameters
VC-dimensions of Finite Automata and Commutative Finite Automata with k Letters and n States
Minimum 2-dominating sets in regular graphs
Combinatorial optimization problems with balanced regret
The difference between several metric dimension graph invariants
The membership problem for unmixed polynomial ideals is solvable in single exponential time
A Set Covering Reformulation of the Pure Fixed Charge Transportation Problem
Spanning trees in directed square cycles
Minimum sum coloring problem: Upper bounds for the chromatic strength
Global defensive alliances in star graphs
Bip-ordered bipartite Ramsey number
Graph classes with and without powers of bounded clique-width
An extension of the periodicity lemma to longer periods
Heredity of the index of convergence of the line digraph
A tabu search algorithm for scheduling a single robot in a job-shop environment
Gracefulness of two nested cycles: A first approach
How to Count Efficiently all Affine Roots of a Polynomial System
An improved bound for 2-distance coloring of planar graphs with girth six
On optimally- lambda (3) transitive graphs
Partitioning a graph into offensive k-alliances
Counting Candy Crush configurations
On Optimal Orientations of Cartesian Products with a Bipartite Graph
Non-abelian key agreement protocols
The Tower of Hanoi problem on Path h graphs
On weakly and strongly popular rankings
Local certification of graphs with bounded genus
Combinatorial aspects of construction of competition Dutch Professional Football Leagues
Two mixed integer programming formulations arising in manufacturing management
Hart and Mas-Colell consistency in PERT problems
An algorithm for finding the vertices of the k-additive monotone core
On the Primer Selection Problem in Polymerase Chain Reaction Experiments
The Overfull Conjecture on split-comparability and split-interval graphs
Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches
On the signless Laplacian Estrada index of cacti
Some NP-complete problems for hypergraph degree sequences
The Clar formulas of a benzenoid system and the resonance graph
On the structure of linear programs with overlapping cardinality constraints
Interval orders with two interval lengths
Approximation algorithms for the bi-criteria weighted MAX-CUT problem
Practical experiments of broadcasting algorithms on a configurable parallel computer
On diregular digraphs with degree two and excess two
Rainbow triangles in arc-colored digraphs
An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
On the absolute approximation ratio for First Fit and related results
Lifting for mixed integer programs with variable upper bounds
Simple games and weighted games: A theoretical and computational viewpoint
Anti-forcing numbers of perfect matchings of graphs
On the minimal alphabet size in multidimensional unrepetitive configurations
On Quasi-Cayley Graphs
Extremal Values for Ratios of Distances in Trees
Dominating sets reconfiguration under token sliding
Rolling horizon strategies for a dynamic and stochastic ridesharing problem with rematches
Bounding the sum of the largest signless Laplacian eigenvalues of a graph
Proximity, remoteness and minimum degree
The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence
Using Lagrangian dual information to generate degree constrained spanning trees
A probabilistic analysis of the multi-period single-sourcing problem
Discovering cis-regulatory modules by optimizing barbecues
A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time
A Parametric Critical Path Problem and an Application for Cyclic Scheduling
Minimum cost homomorphisms to semicomplete multipartite digraphs
Remarks on maximum atom-bond connectivity index with given graph parameters
On inventory allocation for periodic review assemble-to-order systems
Hamilton cycles in vertex-transitive graphs of order 6p
Weighted Domination of Cocomparability Graphs
List T -Colorings of Graphs
Open Shop Problem with Zero-one Time Operations and Integer Release Date/deadline Intervals
2-Point site Voronoi diagrams
Repeated-root constacyclic codes of length ℓp 5 and their duals
Short trees in polygons
Efficient Sets in Partial k -Trees
Embedding complete trees into the hypercube
Weighted lattice polynomials of independent random variables
Dynamic chromatic number of regular graphs
On the general position number of Mycielskian graphs
A characterisation of clique-width through nested partitions
Distance-constrained labellings of Cartesian products of graphs
New upper bounds on Lee codes
A sharp lower bound of the spectral radius with application to the energy of a graph
Hull and geodetic numbers for some classes of oriented graphs
Cryptography and Future Security
(F1,F)-partition of plane graphs without 4- and 5-cycles and without ext-triangular 7-cycles
On the ratio of prefix codes to all uniquely decodable codes with a given length distribution
A Complete Adaptive Algorithm for Propositional Satisfiability
Reformulation in mathematical programming: An application to quantum chemistry
Locally dense supereulerian digraphs
On a conjecture regarding spanning tree edge dependences of planar graphs
On linear-time data dissemination in dynamic rooted trees
Thin strip graphs
Cluttered orderings for the complete bipartite graph
From weight enumerators to zeta functions
Algebraic properties of soluble posets
On the radius of nonsplit graphs and information dissemination in dynamic networks
A complete characterization of paths that are m-step competition graphs
Maximum Vertex-weighted Matching in Strongly Chordal Graphs
On (3, 2)*-choosability of planar graphs without adjacent short cycles
The distance-edge-monitoring numbers of subdivision graphs
Combinatorial Variability of Vapnik-chervonenkis Classes with Applications to Sample Compression Schemes
Probing the Arrangement of Hyperplanes
Fixed points and connections between positive and negative cycles in Boolean networks
Intersection of cycles and paths in k-connected graphs
The Complexity of Harmonious Colouring for Trees
Inapproximability results and bounds for the Helly and Radon numbers of a graph
Acyclic and star colorings of cographs
On morphic generation of regular languages
On connected list colorings of graphs
On the typical case complexity of graph optimization
Signed star domatic number of a graph
Large-width bounds for learning half-spaces on distance spaces
Complementary cycles in almost regular multipartite tournaments, where one cycle has length four
Generalized competition indices of symmetric primitive digraphs
Improved exact algorithms for M AX -S AT
Total domination in maximal outerplanar graphs
On the thinness of trees
Priority Arbiter PUF: Analysis
Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms
The Forwarding Index of Communication Networks with Given Connectivity
Buneman graphs, partial splits and subtree distances
A brief history of parameterized matching problems
More ZCPS-Wh(v) and Several New Infinite Classes of Z-cyclic Whist Tournaments
Paired many-to-many disjoint path covers of hypertori
Minimum matrix representation of some key system
Cycles in cube-connected cycles graphs
Edge-removing games on graphs
On Polynomial Solvability of the High Multiplicity Total Weighted Tardiness Problem
Edge-colouring graphs with bounded local degree sums
A ternary search problem on graphs
An optimal algorithm for finding dominating cycles in circular-arc graphs
Graphs with few P 4 's under the convexity of paths of order three
The solution and applications of a combinatorial problem
Uniquely restricted matchings in subcubic graphs
The Number of Clone Orderings
Weighted fusion graphs: Merging properties and watersheds
Extremal graphs for average sizes of maximal matchings
An integer programming model for protein structure prediction using the 3D-HP side chain model
Detecting and enumerating small induced subgraphs in c-closed graphs
Gallai's question and constructions of almost hypotraceable graphs
Metric spaces in which many triangles are degenerate
The effect of machine availability on the worst-case performance of LPT
Proper 3-orientations of bipartite planar graphs with minimum degree at least 3
A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms
Algorithmic complexity of protein identification: combinatorics of weighted strings
Weakly toll convexity in graph products
Generalized bijective maps between G-parking functions, spanning trees, and the Tutte polynomial
An approximation algorithm for the hamiltonian walk problem on maximal planar graphs
Distances between sets based on set commonality
Bounded Discrete Representations of Interval Orders
On approximability of linear ordering and related NP-optimization problems on graphs
The a-graph coloring problem
On a conjecture of Foulds and Robinson about deltahedra
On isomorphism between circulant and Cartesian product of 2 cycles
Finding broadcast 2-centers of a tree under the postal model
Inverse radiation therapy planning - a multiple objective optimization approach
A decomposability index in logical analysis of data
Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
Pattern restricted Stirling k-ary words, the plateau statistic and the kernel method
Q-ary Rényi-Ulam pathological liar game with one lie
Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization
Arborescence Polytopes for Series-parallel Graphs
Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations
On the complexity of minimizing the number of late jobs in unit time open shop
Rainbow colouring of split graphs
Some results on the Wiener index related to the Šoltés problem of graphs
Improved induced matchings in sparse graphs
Using solution properties within an enumerative search to solve a sports league scheduling problem
The matching energy of random graphs