yusuke1997/dblp-id-title huggingface dataset:
A transform property of Kloosterman sums
Area-efficient planar straight-line drawings of outerplanar graphs
On kernel-less clique-acyclic orientations of minimally imperfect graphs
Cube-free resonance graphs
On the bend-number of planar and outerplanar graphs
Generalized matroid matching
Möbius Inversion on a Poset of a Graph and Its Acyclic Subgraphs
Acyclic choosability of IC-planar graphs
A note on degree conditions for Ramsey goodness of paths
On Lagrangian relaxation for constrained maximization and reoptimization problems
The Complexity of Colouring Symmetric Relational Systems
The minimum number of minimal codewords in an [n, k]-code and in graphic codes
Some results on vulnerability parameters and Wiener-type indices
Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc Graphs
On spectral invariants of the α-mixed adjacency matrix
Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
Some basic properties of multiple Hamiltonian covers
On characterizing the critical graphs for matching Ramsey numbers
Slash and burn on graphs - Firefighting with general weights
A sharp threshold for the renameable-Horn and the q-Horn properties
The train frequency compatibility problem
On using SAT solvers for graph computations
Post classes characterized by functional terms
On the complexity of the dual method for maximum balanced flows
Some connections between learning and optimization
The pseudograph (r, s, a, t)-threshold number
Balancing modular transfer lines with serial-parallel activation of spindle heads at stations
On the generalized Wiener polarity index of trees with a given diameter
On Tuza's conjecture in dense graphs
Locally identifying coloring in bounded expansion classes of graphs
LAGOS'11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina - 2011
Sharp bounds on the Arithmetic-geometric index of graphs and line graphs
On the tractability of (k, i)-coloring
Semi-proper interval graphs
C-programming problems: a class of non-linear optimization problems
The restrictive H -coloring problem
The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability
A characterization problem on underlying graphs of line digraphs
Classification of digital n-manifolds
On the Grundy number of graphs with few P 4 's
Reliability analysis of exchanged hypercubes based on the path connectivity
Optimal popular matchings
Dense subsets of asymptotic bases
Universal retrieval trees
Distinct spreads in vector spaces over finite fields
Completing colored graphs to meet a target property
Inverse multi-objective combinatorial optimization
Panelling Planar Graphs
Some minimum broadcast graphs
Optimal Paths in Network Games with P Players
Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture
Total 2-domination of proper interval graphs
On S-packing edge-colorings of cubic graphs
On maximum matchings in König-Egerváry graphs
Free multiflows in bidirected and skew-symmetric graphs
Equivalence of some LP-based lower bounds for the Golomb ruler problem
L(p, q)-labeling of a graph embeddable on the torus
An Exact Algorithm for the 0- 1 Collapsing Knapsack Problem
Antidirected Hamilton cycles in k -hypertournaments
Efficient enumeration of transversal edge-partitions
Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes
Seymour's second neighborhood conjecture for 5-anti-transitive oriented graphs
Weighted Coxeter graphs and generalized geometric representations of Coxeter groups
Fast Equi-partitioning of Rectangular Domains Using Stripe Decomposition
First fit decreasing scheduling on uniform multiprocessors
Two kinds of generalized connectivity of dual cubes
Decidability and density in two-symbol grammar forms
An on-line bin-batching problem
Generalized latin squares I
Decompositions for edge-coloring join graphs and cobipartite graphs
Enumerating grammar-based extractions
Sparse recovery with integrality constraints
Splicing Representations of Strictly Locally Testable Languages
The Hosoya polynomial decomposition for catacondensed benzenoid graphs
A faster parameterized algorithm for Pseudoforest Deletion
Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem
Balanced flows for transshipment problems
An 8-approximation algorithm for L(2,1)-labeling of unit disk graphs
On the complexity of enumerating pseudo-intents
The largest eigenvalue of C-k-free signed graphs
Trade-offs among degree, diameter, and number of paths
Total k-domination in Cartesian product of complete graphs
Efficient implementation of a shifting algorithm
(3, 1)-Choosability of toroidal graphs with some forbidden short cycles
Some parallel algorithms on interval graphs
On the generation of powers by OS schemes
Optimal Point-to-point Broadcast Algorithms Via Lopsided Trees
Spectra of the Mycielskian of a signed graph and related products
Degree-constrained Spanners for Multidimensional Grids
Extremal trees with fixed order and diameter for average size of maximal matchings
Sparse obstructions for minor-covering parameters
Fisher information distance: A geometrical reading
Deadline Scheduling of Multiprocessor Tasks
Acyclic edge coloring of graphs
Locating battery charging stations to facilitate almost shortest paths
Polarity of chordal graphs
A cryptanalytic observation concerning systems based on language theory
Finding spanning trees with perfect matchings
Work-preserving Emulations of Shuffle-exchange Networks: An Analysis of the Complex Plane Diagram
On the weighted k-path vertex cover problem
On the star decomposition of a graph: Hardness results and approximation for the max-min optimization problem
Strong lower bounds for the prize collecting Steiner problem in graphs
Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
Characterization of the inverse of a particular circulant matrix by means of a continued fraction
Distance restricted optimal pebbling in cycles
Enumeration and maximum number of maximal irredundant sets for chordal graphs
The bivariate Ising polynomial of a graph
Supply chain scheduling: Sequence coordination
Clique divergent clockwork graphs and partial orders
The complexity of modular decomposition of Boolean functions
Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies
Entity authentication schemes using braid word reduction
Variable neighborhood search for the maximum clique
Linear delay enumeration and monadic second-order logic
Minimal graphs for 2-factor extension
A linear time algorithm for the nullity of vertex-weighted block graphs
A Dawson-like clustering of human mitochondrial DNA sequences based on protein coding region
Classification by Polynomial Surfaces
Vertex pancyclic graphs
Strong cuts from compatibility relations for the Dial-a-Ride Problem
On the orientation of graphs and hypergraphs
k-p-Infix codes and semaphore codes
On edge-sets of bicliques in graphs
The sandwich problem for cutsets: Clique cutset, k-star cutset
Eccentricity spectral radius of t-clique trees with given diameter
The high order spectral extremal results for graphs and their applications
On star 5-colorings of sparse graphs
Graph layering by promotion of nodes
Betweenness structures of small linear co-size
Recognition of Tractable Satisfiability Problems through Balanced Polynomial Representations
On the Euclidean two Paths Problem
Parallel algorithms for fractional and maximal independent sets in planar graphs
A new constraint-based description of the steady-state flux cone of metabolic networks
Quasi-centers and radius related to some iterated line digraphs, proofs of several conjectures on de Bruijn and Kautz graphs
New constant dimension subspace codes from improved parallel subcode construction
Extremal polygonal chains with respect to the Kirchhoff index
Zero forcing and maximum nullity for hypergraphs
Total rainbow connection of digraphs
Treewidth for Graphs with Small Chordality
On the dependence of the maximum cycle mean of a matrix on permutations of the rows and columns
Minors of simplicial complexes
On the algebraic connectivity of token graphs and graphs under perturbations
Degree-based function index for graphs with given diameter
Efficient edge domination in regular graphs
Achievable sets, brambles, and sparse treewidth obstructions
Bounds for the connected domination number of maximal outerplanar graphs
Constructing Colorings for Diagrams
Total colorings of planar graphs without intersecting 5-cycles
Separating signatures in signed planar graphs
Cluster connectivity of hypercube-based networks under the super fault-tolerance condition
Elemantary Sequences, Sub-Fibonacci Sequences
On offset Hamilton cycles in random hypergraphs
Some generalized type functional dependencies formalized as equality set on matrices
Partition into cliques for cubic graphs: Planar case, complexity and approximation
2-limited broadcast domination in subcubic graphs
Whist Tournaments - Three Person Property
Transmission schedules for hypercube interconnection in WDM optical passive star networks
Disproofs of three conjectures on the power domination of graphs
The clique number of the exact distance t-power graph: Complexity and eigenvalue bounds
Unital designs in planes of order 16
On the security of p-party protocols
Approximate envy-freeness in graphical cake cutting
Extended framework for constructing (complete) permutations by specifying their coordinate functions
Matchings and cycle covers in random digraphs
Upper bounds and approximation results for the k-slow burning problem
Efficient minimization of higher order submodular functions using monotonic Boolean functions
Online sum-paintability: Slow-coloring of trees
Bus Interconnection Networks
Directed elimination games
Bit-optimal Decoding of Codes Whose Tanner Graphs Are Trees
An improved upper bound for planar Turán number of double star S2,5
Best semi-online algorithms for unbounded parallel batch scheduling
Two Results on the Bit Extraction Problem
Searching for two counterfeit coins with two-arms balance
Global cycle properties of locally isometric graphs
Cluster graph modification problems
The convexity spectra of graphs
Vertex connectivity of the power graph of a finite cyclic group
The partition bargaining problem
Axiomatic characterization of the interval function of a bipartite graph
Parallelograms and the VC-dimension of the distance sets
Proximity thresholds for matching extension in the torus and Klein bottle
A note on breaking small automorphisms in graphs
Violator spaces: Structure and algorithms
A benchmark set for the reconstruction of hv-convex discrete sets
Graph spectra as a systematic tool in computational biology
On the binary solitaire cone
FPT implicit enumeration of active schedules
On extremal factors of de Bruijn-like graphs
On large regular (1,1,k)-mixed graphs
On the connectivity and the diameter of betweenness-uniform graphs
Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
Degree sequences and graphs with disjoint spanning trees
Tantrix TM rotation puzzles are intractable
On structural properties of trees with minimal atom-bond connectivity index
Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
Prokaryote clustering based on DNA curvature distributions
Absolute retracts of bipartite graphs
Bisections of graphs without K2, l
Region merging with topological control
Transitive systems and conclusive partial orders
Trees with three leaves are (n+1)-unavoidable
On a distance-constrained graph labeling to model cooperation
Graph classes and Ramsey numbers
Random-order bin packing
Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations
Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking
Complexity analysis of job-shop scheduling with deteriorating jobs
Derived neighborhoods and frontier orders
Decomposable trees: a polynomial algorithm fortripodes
Equivalence of permutation polytopes corresponding to strictly supermodular functions
Algorithms for sequential generation of combinatorial structures
Nonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3
Note on the problem of gossiping in multidimensional grids
Batching and delivery in semi-online distribution systems
Partial domination of maximal outerplanar graphs
Optimal and near-optimal broadcast in random graphs
The minimum reload s-t path, trail and walk problems
Stochastic spanning tree problem
Improper sum-list colouring of 2-trees
Generalized bent Boolean functions and strongly regular Cayley graphs
Cardinality Constrained Boolean Quadratic Polytope
On the total versions of 1-2-3-Conjecture for graphs and hypergraphs
An enumeration of equilateral triangle dissections
Average-case complexity of a branch-and-bound algorithm for Min Dominating Set
Quasimetric spaces with few lines
On asymptotic packing of geometric graphs
Constructive characterizations of the value function of a mixed-integer program II
On the independence number and the chromatic number of generalized preferential attachment models
Monotonically labelled Motzkin trees
Nonexistence of near-extremal formally self-dual even codes of length divisible by 8
A lower bound on the modified Randić index of line graphs
A stabilized column generation scheme for the traveling salesman subtour problem
Connectivity of Vertex and Edge Transitive Graphs
On the facets of the simple plant location packing polytope
Searching for mobile intruders in circular corridors by two 1-searchers
Perfect 7-cycle systems
Asymptotic Results on Suborthogonal "B"-decompositions of Complete Digraphs
Efficient algorithms for finding critical subgraphs
Wirelength of embedding complete multipartite graphs into certain graphs
Results about the total chromatic number and the conformability of some families of circulant graphs
Clique Covering and Clique Partition in Generalizations of Line Graphs
Global Roman domination in graphs
A Tutte polynomial for signed graphs
Bounds on weak roman and 2-rainbow domination numbers
Legendre sums and codes related to QR codes
Deciding the existence of a cherry-picking sequence is hard on two trees
Explicit Expressions for the Central Characters of the Symmetric Group
Integral mixed unit interval graphs
Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index
On the complexity of monotone dualization and generating minimal hypergraph transversals
On CCE graphs of doubly partial orders
Redundancy estimates for the Lempel-Ziv algorithm of data compression
Paroids: A Canonical Format for Combinatorial Optimization
The fault-diameter and wide-diameter of twisted hypercubes
Selected topics from the theory of intersections of balls
The generalized microscopic image reconstruction problem
Proper conflict-free coloring of sparse graphs
Partition games
Pyramidal Tours with Step-backs and the Asymmetric Traveling Salesman Problem
Special Issue of DAM on the Vapnik-chervonenkis Dimension
A new model and algorithms in firefighting theory
On injective edge coloring for a class of graphs with maximum degree 5
An easy counting lemma
On partitioning minimum spanning trees
How many attackers can selfish defenders catch?
A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty
Some sum-product type estimates for two-variables over prime fields
Equivalent constraints for discrete sets
The deterministic product location problem under a pick-by-order policy
On open-separating dominating codes in graphs
The optimal rubbling number of ladders, prisms and Möbius-ladders
A new reduction method in integer programming
A short note on supersaturation for oddtown and eventown
L (2, 1)L(2, 1)-labeling of oriented planar graphs
Planar graphs with girth 20 are additively 3-choosable
Graph r-hued colorings - A survey
Interchange Graphs and the Hamiltonian Cycle Polytope
Roman {3}-domination (double Italian domination)
Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
Moplex orderings generated by the LexDFS algorithm
Remarks on strategies in combinatorial games
Stable Marriage and Indifference
Recognizing the P 4 -structure of Bipartite Graphs
Restraints permitting the largest number of colourings
Interval incidence coloring of bipartite graphs
Planar graphs without 4- and 6-cycles are (3,4)-colorable
Structural properties of the minimum cut of partially-supplied graphs
Recursive MDS matrices over finite commutative rings
Collision-free routing problem with restricted L-path
Parameterized algorithmics for linear arrangement problems
Balanced vertex-orderings of graphs
On the number of perfect matchings in the line graph of a traceable graph
A faster FPTAS for knapsack problem with cardinality constraint
On the value of a random minimum spanning tree problem
Elementary proofs of (relatively) recent characterizations of Eulerian graphs
Iterative behaviour of one-dimensional threshold automata
Computing Matrix Period in Max-min Algebra
A note on characterization of the induced matching extendable Cayley graphs generated by transpositions
Computing with an algebraic-perturbation variant of Barvinok's algorithm
The Rotation Graphs of Perfect Matchings of Plane Bipartite Graphs
Reflectiveness and compression of threshold transformations
A sufficient condition for planar graphs with girth 5 to be (2, 4)-colorable
Precedence thinness in graphs
Uniquely 2-list colorable graphs
Independent Roman -domination in graphs
A distance-labelling problem for hypercubes
General sum-connectivity index of unicyclic graphs with given maximum degree
Tilted Sperner families
Excessive factorizations of bipartite multigraphs
On a variant of Flory model
Anti-Ramsey numbers for cycles in n-prisms
Some Results on Visibility Graphs
An extension of Christofides heuristic to the k-person travelling salesman problem
Minimization of ordered, symmetric half-products
Weighted efficient domination problem on some perfect graphs
A Bound and Bound algorithm for the zero-one multiple knapsack problem
The convex dimension of a graph
The statistical analysis for Sombor indices in a random polygonal chain networks
Minimizing maximum indegree
Signed domatic number of a graph
Fairly allocating contiguous blocks of indivisible items
The Difficulty of Constructing a Leaf-labelled Tree Including or Avoiding Given Subtrees
Broadcasting in cycle prefix digraphs
On basic chordal graphs and some of its subclasses
Generation of Molecular Graphs Based on Flexible Utilization of the Available Structural Information
Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
Finding all minimum cost flows and a faster algorithm for the K best flow problem
The Lattices of Closure Systems, Closure Operators, and Implicational Systems on a Finite Set: A Survey
Burning number of caterpillars
Discrepancy inequalities for directed graphs
A Lower Bound for Tree Resolution
Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs
Anomalous behavior in bin packing algorithms
The underlying line digraph structure of some (0, 1)-matrix equations
A note on Cheeger inequalities for uniform hypergraphs
A tournament of order 14 with disjoint Banks and Slater sets
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
Homomorphically Full Graphs
Hereditary Nordhaus-Gaddum graphs
Characterizing and computing the structure of clique intersections in strongly chordal graphs
Expected rank and randomness in rooted graphs
Maximal Value of the Zeroth-order Randic Index
Domination Number of the Cross Product of Paths
Occupation times for two-state Markov chains
Chromatic Number of Prime Distance Graphs
A Monge Property for the D-dimensional Transportation Problem
Semi-independence number of a graph and the existence of Hamiltonian circuits
How tree-based is my network? Proximity measures for unrooted phylogenetic networks
A Characterization of Signed Hypergraphs and Its Applications to VLSI Via Minimization and Logic Synthesis
Maximization coloring problems on graphs with few P 4
A notion of vertex equitability for proper labellings
Locating sets of vertices on Hamiltonian cycles
The number of subtrees in graphs with given number of cut edges
Equitable neighbour-sum-distinguishing edge and total colourings
Some simple optimization techniques for self-organized public key management in mobile ad hoc networks
Conditional matching preclusion for regular bipartite graphs and their Cartesian product
The worst case number of questions in Generalized AB game with and without white-peg answers
Ranking trees based on global centrality measures
An optimization problem on graphs
Singularities in Negami's splitting formula for the Tutte polynomial
Checking the admissibility of odd-vertex pairings is hard
On some algorithmic problems regarding the hairpin completion
Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations
Tabu search and finite convergence
A new approach to gross error detection for GPS networks
Minimum 3-geodetically connected graphs
Points by degree and orbit size in chemical trees, II
Critical vertices and edges in H-free graphs
Average distance and domination number revisited
Hybrid grids and the Homing Robot
Improved approximation for maximum edge colouring problem
Relating dissociation, independence, and matchings
Construction of infinite de Bruijn arrays
L1-norm ball for CSIDH: Optimal strategy for choosing the secret key space
Essential upper bounds on the total domination number
Green functions on product networks
Normal 6-edge-colorings of some bridgeless cubic graphs
Weak degeneracy of planar graphs without 4- and 6-cycles
Finding paths in graphs avoiding forbidden transitions
Strong thinning and polyhedric approximation of the surface of a voxel object
On the computational complexity of the order polynomial
Planar k-cycle resonant graphs with k=1, 2
Graph polynomials and paintability of plane graphs
Nonadaptive algorithms for threshold group testing
Directed tree structure of the set of Kekulé patterns of generalized polyhex graphs
Factors, spectral radius and toughness in bipartite graphs
Unified extremal results for k-apex unicyclic graphs (trees)
Randomized algorithms and upper bounds for multiple domination in graphs and networks
A generalization of an independent set with application to (K p ;k)-stable graphs
Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem
Integrated production and delivery scheduling with disjoint windows
Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies
On the coverings of the d-cube for d<=6
Scheduling a Divisible Task in a Two-dimensional Toroidal Mesh
Recurrence relations for the spectrum polynomial of a matroid
On the complexity of the flow coloring problem
A fast algorithm for the maximum clique problem
An Algorithm to Find Two Distance Domination Parameters in a Graph
Two - ø - Tolerance Competition Graphs
Oriented diameter of star graphs
Infinitely many minimal classes of graphs of unbounded clique-width
Addendum to "Vertex adjacencies in the set covering polyhedron" [Discrete Appl. Math. 218(2017) 40-56]
A superpolynomial lower bound for strategy iteration based on snare memorization
Chromatic Scheduling and Frequency Assignment
Boundary enumerator polynomial of hypercubes in Fibonacci cubes
Extracting pure network submatrices in linear programs using signed graphs
Containment properties of product and power graphs
The complexity of recognizing minimally tough graphs
Labeling outerplanar graphs with maximum degree three
LAD models, trees, and an analog of the fundamental theorem of arithmetic
Ladder orderings of pairs and RAID performance
Exact lambda-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
(d, n)-packing colorings of infinite lattices
Restricted matching in plane triangulations and near triangulations