yusuke1997/dblp-id-title huggingface dataset:
Exact and heuristic solution approaches for the Integrated Job Scheduling and Constrained Network Routing Problem
A Decision Method for Parikh Slenderness of Context-free Languages
Minimizing a Submodular Function Arising From a Concave Function
Superconnectivity of regular graphs with small diameter
On digraphs of excess one
Fast recognition of a Digital Straight Line subsegment: Two algorithms of logarithmic time complexity
A deterministic version of the game of zombies and survivors on graphs
22-clique-bond of stable set polyhedra
A note on antimagic orientations of even regular graphs
Minimum embedded-link-cut split k-ary n-cubes
Domination ratio of a family of integer distance digraphs with arbitrary degree
Preface: Linear optimization
On the reformulated reciprocal sum-degree distance of graph transformations
Random Walks and Electrical Resistances in Products of Graphs
Complexity of coloring graphs without paths and cycles
Forbidden induced subgraph characterization of circle graphs within split graphs
A Relation Between the Knapsack, Group Knapsack Problems
Cycles of length 1 modulo 3 in graph
Restricted connectivity of Cayley graph generated by transposition trees
Selecting Jobs for Scheduling on a Machine Subject to Failure
Seymour's second neighborhood conjecture for m-free, k-transitive, k-anti-transitive digraphs and some approaches
Old and new results on packing arborescences in directed hypergraphs
Graphs with maximal induced matchings of the same size
An algorithm to find maximum area polygons circumscribed about a convex polygon
Counting humps and peaks in generalized Motzkin paths
An FPT algorithm for the vertex cover P 4 problem
Maximal pivots on graphs with an application to gene assembly
Homothetic polygons and beyond: Maximal cliques in intersection graphs
On chordal phylogeny graphs
Semi-transitive orientations and word-representable graphs
Unique response Roman domination in graphs
Universal solvability of interval max-plus matrix equations
New families of graphs without short cycles and large size
On disjunction convex hulls by big-M lifting
Edges incident with a vertex of degree greater than four and the number of contractible edges in a 4-connected graph
Reoptimizing the 0-1 knapsack problem
The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding Spanning Trees in Hypergraphs
Constructing new families of transmission irregular graphs
On the semi-proper orientations of graphs
Global cycle properties in locally connected, locally traceable and locally hamiltonian graphs
Preface: Concept Lattices and Applications: Recent Advances and New Opportunities
A novel giant-subgraph phase-transition in sparse random k -partite graphs
Monotonicity paradoxes in the theory of elections
Independent domination in the graph defined by two consecutive levels of the n-cube
Efficient automatic simulation of parallel computation on networks of workstations
Minimum cut bases in undirected networks
The balanced minimum evolution problem under uncertain data
A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs
Computing partial hypergraphs of bounded width
An ABC-Problem for location and consensus functions on graphs
Necessary conditions and frame constructions for Z-cyclic patterned starter whist tournaments
On a Graph-theoretical Model for Cyclic Register Allocation
Extremal vertex-degree function index with given order and dissociation number
An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices
Linear k-arboricities on trees
A Three-dimensional Matching Model for Perishable Production Scheduling
Persistency in combinatorial optimization problems on matroids
A Parallel Algorithm for Computing Steiner Trees in Strongly Chordal Graphs
On non-repetitive sequences of arithmetic progressions: The cases k∈{4, 5, 6, 7, 8}
Strong Elimination Ordering of the Total Graph of a Tree
An algorithm for the difference between set covers
An inductive proof of Dirac's theorem on Hamilton cycles
Effectifs des diverses sequences de polyedres 3-valents convexes ayant moins de 11 faces et de polyedres sans face triangulaire ayant de 11 a 14 faces
A note on the stability results of the number of cliques in graphs with given matching number
Diclique digraphs
Equality of domination and transversal numbers in hypergraphs
An axiomatic study of Majority-rule (+ ) and associated consensus functions on hierarchies
Extremal results on the spectral radius of function-weighted adjacency matrices
Stable Matchings with Couples
Capture times in the bridge-burning cops and robbers game
Paths, trees and matchings under disjunctive constraints
Recognizing Helly Edge-Path-Tree graphs and their clique graphs
Inequalities for the Grundy chromatic number of graphs
Hamiltonian connectedness in 3-connected line graphs
Obtaining splits from cut sets of tight spans
Single Machine Scheduling Subject To Precedence Delays
On the chromatic index of join graphs and triangle-free graphs with large maximum degree
On stars in caterpillars and lobsters
On finding augmenting graphs
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
Using dual feasible functions to construct fast lower bounds for routing and location problems
Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs
Packing directed cycles efficiently
Jump number of dags having Dilworth number 2
A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
Hardness of k-anonymous microaggregation
The multiple originator broadcasting problem in graphs
A note on an alternating upper bound for random walks on semigroups
The generalized matcher game
A unified approach to word occurrence probabilities
Probabilistic analysis of two k-cluster problems
Online 2-stage stable matching
Online variable-sized bin packing
The complexity of generalized clique packing
New exact approaches and approximation results for the Penalized Knapsack Problem
Cutting Numbers for the Forward Loop Backward Hop Network
Fun-Sort--or the chaos of unordered binary search
Cliques and extended triangles. A necessary condition for planar clique graphs
On claw-free graphs with all but four eigenvalues equal to 0 or -1
The cost-to-time ratio problem for large or infinite graphs
Extensions of the combinatorial game (K, t)-Wythoff
A Bicriterion Approach to Preemptive Scheduling of Parallel Machines with Controllable Job Processing Times
Capacity restricted optimal pebbling in graphs
Secure GCM implementation on AVR
Convex hulls of samples from spherically symmetric distributions
A recursion formula for resistance distances and its applications
Universality for polynomial invariants for ribbon graphs with half-ribbons
On incidence coloring conjecture in Cartesian products of graphs
Combinatorial properties of boundary NLC graph languages
Asymptotic number of symmetries in locally restricted trees
Canonical equation sets for classes of concordant polytopes
Some digraph classes that meet the directed path partition conjecture
On atom-bond connectivity index of connected graphs
On the minimum spectral radius of graphs with given order and dissociation number
Kirchhoffian indices for weighted digraphs
Disjoint cycles in hypercubes with prescribed vertices in each cycle
Matrix and combinatorics solutions of Boolean differential equations
Non-edge orientation and vertex ordering characterizations of some classes of bigraphs
Functorial hierarchical clustering with overlaps
On the Zagreb index inequality of graphs with prescribed vertex degrees
Optimal linear labelings and eigenvalues of graphs
Path-independence and closure operators with the anti-exchange property
On the Co-PI and Laplacian Co-PI eigenvalues of a graph
The number of independent sets in unicyclic graphs with a given diameter
Proving the conjecture of O'Donnell in certain cases and disproving its general validity
A new note on 1-planar graphs with minimum degree 7
Resolution complexity of random constraint satisfaction problems: Another half of the story
Facial packing edge-coloring of plane graphs
The generalized 4-connectivity of pancake graphs
The r-hued coloring of K4(7)-minor free graphs
Solution of the knight's Hamiltonian path problem on chessboards
Approximation Algorithms for Partitioning Small Items in Unequal Bins to Minimize the Total Size
Formal Concept Analysis for General Objects
Matching preclusion for direct product of regular graphs
The minimum weight of the Grassmann codes C(k, n),
The algorithm and complexity of secure domination in 3-dimensional box graphs
A generalization of the Haemers-Mathon bound for near hexagons
Gale diagrams of convex polytopes and positive spanning sets of vectors
b-coloring of tight graphs
Spatial classification
Ramsey-remainder for convex sets and the Erdös-Szekeres theorem
Critical independent sets of König-Egerváry graphs
Competitive algorithms for the bicriteria k-server problem
Average-case analysis of incremental topological ordering
Influence and interaction indexes for pseudo-Boolean functions: A unified least squares approach
Fly-automata for checking MSO2 graph properties
Comparison of column generation models for channel assignment in cellular networks
A branch-and-price algorithm for the Minimum Sum Coloring Problem
Quasi M-convex and L-convex functions--quasiconvexity in discrete optimization
Dichotomy for tree-structured trigraph list homomorphism problems
Graphs with degree sequence {(m-1)m,(n-1)n} and {mn,nm}
Critically indecomposable graphs
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case
Optimal Multiple Interval Assignments in Frequency Assignment and Traffic Phasing
Routings for Involutions of a Hypercube
Graphs G in which G-N[v] has a prescribed property for each vertex v
Hamiltonian cycle and path of folded hypercube with faulty matchings
Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs
Edge-disjoint properly colored cycles in edge-colored complete graphs
The nucleolus of homogeneous games with steps
Paired (n-1)-to-(n-1) disjoint path covers in bipartite transposition-like graphs
Removable edges in Halin graphs
Graphs with exactly three main eigenvalues
On q-nearly bent Boolean functions
The Minimum Flow Cost Hamiltonian Cycle Problem: A comparison of formulations
Single machine scheduling with assignable due dates
A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
On a conjecture of the Randić index and the minimum degree of graphs
Recognizing Renamable Generalized Propositional Horn Formulas Is NP-complete
Finding dominating induced matchings in S1, 1, 5-free graphs in polynomial time
A note on the set union knapsack problem
On near optimal colorable graphs
The hyper-Wiener index of the generalized hierarchical product of graphs
Combinatorial optimization: theory, computation, and applications
Saturation numbers of joins of graphs
Cycles generated by sequential iterations
Catastrophic Faults in Reconfigurable Systolic Linear Arrays
Average stretch analysis of compact routing schemes
Further results on the deficiency of graphs
On the General Randić index of polymeric networks modelled by generalized Sierpiński graphs
Vicinal orders of trees
Weighted efficient domination for some classes of H-free and of (H1, H2)-free graphs
Rank-width: Algorithmic and structural results
Separable and equatable hypergraphs
Alliance free sets in Cartesian product graphs
Two degree-distance based topological descriptors of some product graphs
Erratum to "Intersecting codes and separating codes": [Discrete Applied Mathematics 128 (2003) 75-83]
Weighted Finite Transducers in Image Processing
On Wiener and multiplicative Wiener indices of graphs
Remarks on planar edge-chromatic critical graphs
On the equivalence between some local and global Chinese postman and traveling salesman graphs
Domination and Total Domination on Asteroidal Triple-free Graphs
Multilevel clustering models and interval convexities
On the Minimal Covering of Infinite Sets
The Skeleton of the Symmetric Traveling Salesman Polytope
Sequencing with general precedence constraints
Tool switching problems with tool order constraints
A note on a conjecture of Wu, Xu and Xu
Primal-dual algrorithms for the assignment problem
On (1, 2)-step competition graphs of bipartite tournaments
Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov-Jacobson energy model
The b-chromatic Number of a Graph
Laplacian spectra of regular graph transformations
The effect of side-information on smooth entropy
Kemeny's constant and Kirchhoffian indices for conjoined highly symmetric graphs
Decomposition theorems for square-free 2-matchings in bipartite graphs
Partially directed snake polyominoes
Three results towards approximation of special maximum matchings in graphs
An algorithm computing combinatorial specifications of permutation classes
A Generalization of maximal independent sets
Saturated systems of homogeneous boxes and the logical analysis of numerical data
A note on reconfiguring tree linkages: trees can lock
On cube-free ω-words generated by binary morphisms
Facets of the K-partition Polytope
NP-completeness of a family of graph-colouring problems
Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine
Parameterized Complexity of Vertex Colouring
Strongly Orderable Graphs a Common Generalization of Strongly Chordal and Chordal Bipartite Graphs
On the global rigidity of tensegrity graphs
Colorful two-piercing theorem for boxes
Mahonian STAT on rearrangement class of words
Stability measure for a generalized assembly line balancing problem
Distances and diameters on iterated clique graphs
2-stage robust MILP with continuous recourse variables
An extension of Lehman's theorem and ideal set functions
The steepest descent gravitational method for linear programming
How to Survive While Visiting a Graph
The binding number of a graph and its cliques
The Underlying Graph of a Line Digraph
Minimum degree and size conditions for the graphs of proper connection number 2
Sufficient conditions for 2-rainbow connected graphs
Parameterized graph cleaning problems
The complexity of two graph orientation problems
Coding for write-unidirectional memories and conflict resolution
Searching with lies under error cost constraints
Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
On the discrete version of Picone's identity
Two dependent probabilistic chip-collecting games
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
Settlement fund circulation problem
Ramsey and Gallai-Ramsey numbers for multiple triangles of graphs and their multiplicities
Covering symmetric semi-monotone functions
Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra
Triangle-free signed graphs with small negative inertia index
Edge metric dimension and mixed metric dimension of planar graph Qn
Counting r×s rectangles in (Catalan) words
A study of scheduling problems with preemptions on multi-core computers with GPU accelerators
Non-existence results for vectorial bent functions with Dillon exponent
Polyhedral Analysis and Decompositions for Capacitated Plant Location-type Problems
Advances in Combinatorial Optimization
On characteristics of ancestral character-state reconstructions under the accelerated transformation optimization
On the WalkerMaker-WalkerBreaker games
On the complexity of robust multi-stage problems with discrete recourse
A Maiorana-McFarland type construction for resilient Boolean functions on n variables ( n even) with nonlinearity >2 n -1 -2 n /2 +2 n /2-2
Submodular + Supermodular function maximization with knapsack constraint
A minimum broadcast graph on 63 vertices
Sensitivity Analysis for Knapsack Problems: A Negative Result
Matching anti-forcing polynomials of catacondensed hexagonal systems
Recognizing unit multiple interval graphs is hard
Two machine mixed shop scheduling problem with controllable machine speeds
Exact-2-relation graphs
Cops and an Insightful Robber
Discrete function expansions in integer powers
Radio-k-labeling of cycles for large k
The Basic Cyclic Scheduling Problem with Linear Precedence Constraints
Uniform forcing and immune sets in graphs and hypergraphs
On the Linear Relaxation of the 2-node Connected Subgraph Polytope
Antimagic orientations of graphs with given independence number
Complexity of independency and cliquy trees
Linear-time algorithms for three domination-based separation problems in block graphs
An extended result of Kleitman and Saks concerning binary trees
Inference of an oscillating model for the yeast cell cycle
Discrete relaxations of combinatorial programs
Sparse orthogonal matrices and the Haar wavelet
on the Geometric Separability of Boolean Functions
An e-approximation scheme for combinatorial optimization problems with minimum variance criterion
On the model-checking of monadic second-order formulas with edge set quantifications
Computing sharp bounds for hard clustering problems on trees
Matrix partitions of split graphs
A Special Case for Subset Interconnection Designs
Representing a concept lattice by a graph
Indicated coloring game on Cartesian products of graphs
A modified bootstrap percolation on a random graph coupled with a lattice
Optimal discovery of repetitions in 2D
An application of the Turán theorem to domination in graphs
On a directed variation of the 1-2-3 and 1-2 Conjectures
The (alpha, beta, s, t)-diameter of graphs: A particular case of conditional diameter
Eigenvalue multiplicity in regular graphs
On blockers and transversals of maximum independent sets in co-comparability graphs
Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016
The geometric-arithmetic index and the chromatic number of connected graphs
Adjacency on Combinatorial Polyhedra
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks
A note on line digraphs and the directed max-cut problem
Naturally submodular digraphs and forbidden digraph configurations
Valid Inequalities and Separation for Capacitated Fixed Charge Flow Problems
On the metric dimension, the upper dimension and the resolving number of graphs
No-hole L(2, 1)-colorings
Graph models and their efficient implementation for sparse Jacobian matrix determination
Labeling constructions using digraph products
Covering t-sets with (t+2)-sets
Noisy colored point set matching
A Predetermined Algorithm for Detecting a Counterfeit Coin with a Multi-arms Balance
Distinguished representatives for equivalent labelled stratified graphs and applications
Orientable burning number of graphs
Finding the two-core of a tree
A survey of online knapsack problems
Trees with equal total domination and game total domination numbers
The Point-to-point Connection Problem - Analysis and Algorithms
Conditional fractional matching preclusion of n-dimensional torus networks
On the differential and Roman domination number of a graph with minimum degree two
Three-dimensional orthogonal graph drawing algorithms
Coloring mixed hypertrees
Forcing brushes
Stability of two player game structures
Integer linear programming approaches for non-unique probe selection
Representability in mixed integer programmiing, I: Characterization results
Generalized neighbourhoods and a class of perfectly orderable graphs
On budget-constrained coverage in Multi-Interface networks: Branchwidth and treewidth perspectives
The lower bound of the weightwise nonlinearity profile of a class of weightwise perfectly balanced functions
Medians in median graphs
On fairness of D0L systems
k-NLC Graphs and Polynomial Algorithms
Signed star k-subdomination numbers in graphs
The competition graphs of oriented complete bipartite graphs
Decompositions of graphs of functions and fast iterations of lookup tables
Axiomatic characterizations of the symmetric coalitional binomial semivalues
On the geodetic iteration number of the contour of a graph
Intersection graphs of L-shapes and segments in the plane
Perfect Italian domination in trees
Interplay between resiliency and polynomial degree - Recursive amplification, higher order sensitivity and beyond
The partial order competition dimensions of bipartite graphs
2-satisfiability and Diagnosing Faulty Processors in Massively Parallel Computing Systems
Ratewise-optimal non-sequential search strategies under constraints on the tests
Scheduling sports competitions with a given distribution of times
Note on the multiplicative Zagreb indices
Phase transitions of PP-complete satisfiability problems
Listing maximal H-free subgraphs
Resolution Remains Hard Under Equivalence
From tree-decompositions to clique-width terms
On linear coloring of planar graphs with small girth
Extended cooperative networks games
P3-convexity on graphs with diameter two: Computing hull and interval numbers
Rainbow independent sets on dense graph classes
Shortest distances as enumeration problem
Algorithmic aspects of broadcast independence
Numerical representation of PQI interval orders
An efficient lattice reduction using reuse technique blockwisely on NTRU
Charm bracelets and their application to the construction of periodic Golay pairs
Random bipartite Ramsey numbers of long cycles
On the NP-hardness of edge-deletion and -contraction problems
Graphs, networks, and linear unbiased estimates
Optimal strong (kappa, d)-orientation of complete k-partite graphs
Optimal interleaving schemes for correcting two-dimensional cluster errors
A condition for the strong regularity of matrices in the minimax algebra
Quasiharmonic classification of infinite networks
Packing 3-vertex paths in claw-free graphs and related topics
Minimum number of affine simplices of given dimension
On the solution of discrete bottleneck problems
The delay of circuits whose inputs have specified arrival times
A quadratic algorithm for road coloring
Nonlinear functions in abelian groups and relative difference sets
1.5-approximation algorithm for the 2-Convex Recoloring problem
H-sequences and 2-step coreness in graphs
Gossiping and broadcasting versus computing functions in networks
On a Problem of P. Erds
A new condition on dominated pair degree sum for a digraph to be supereulerian
On indices of Wiener and anti-Wiener type
Total domination changing and stable graphs upon vertex removal
A Lagrangian heuristic for a train-unit assignment problem
Connected graph searching in chordal graphs
Locally complete consistent F-augmented contexts: A category-theoretic representation of algebraic L-domains
Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups
Complexity results for common due date scheduling problems with interval data and minmax regret criterion
On the Complexity of Some Edge-partition Problems for Graphs
Polyhedral combinatorics of the K-partitioning problem with representative variables
Algebraic bounds for heterogeneous site percolation on directed and undirected graphs
Conjunctive query pattern structures: A relational database model for Formal Concept Analysis
Robust cycle bases do not exist for if
On upper bounds for multiple domination numbers of graphs
Note on a zero net-regular signed graph
The challenges of unbounded treewidth in parameterised subgraph counting problems
Resistance distance and Kirchhoff index in dihedral Cayley graphs
Exact vertex forwarding index of the Strong product of complete graph and cycle
Graceful colorings of graphs with maximum degree three
Constructing the relative neighborhood graph in 3-dimensional Euclidean space
Embedding planar 5-graphs in three pages
Stable skew partition problem
Quasi-median graphs from sets of partitions
Exact enumeration of rooted 3-connected triangular maps on the projective plane
Online scheduling on three uniform machines
On the max min of the algebraic degree and the nonlinearity of a Boolean function on an affine subspace
Enumeration of rooted binary perfect phylogenies
The matching-connectivity of a graph
Optimal embeddings of odd ladders into a hypercube
On equistable, split, CIS, and related classes of graphs
Multicolor induced Ramsey numbers