yusuke1997/dblp-id-title huggingface dataset:
An improvement of the bound on the improper odd chromatic number of IC-planar graphs
A case of non-convergent dual changes in assignment problems
Neighbor sum distinguishing total coloring of sparse IC-planar graphs
Graphs with Small Diameter After Edge Deletion
The localization game on oriented graphs
On explicit formulas for bandwidth and antibandwidth of hypercubes
The Distance Orientation Problem
The (1, 2)-step competition graph of a tournament
The C k -extended graft construction
Note on the bisection width of cubic graphs
On some domination colorings of graphs
The double competition hypergraph of a digraph
The signed star domination numbers of the Cartesian product graphs
Generating all minimal petri net unsolvable binary words
A characterization of block graphs
The asymptotic value of graph energy for random graphs with degree-based weights
Identifying codes on directed de Bruijn graphs
Broadcast domination and multipacking in strongly chordal graphs
Combinatorial characterization of hexagonal systems
Centers of sets of pixels
On the Number of Spanning Trees and Eulerian Tours in Iterated Line Diagraphs
An improvement on the number of simplices in
Characterization of graphs with orientable total domination number equal to |V|-1
Extremal numbers for cycles in a hypercube
Neighbor sum distinguishing total chromatic number of 2-degenerate graphs
Verification of a certificate for weakly chordal graphs
On distance-preserving elimination orderings in graphs: Complexity and algorithms
A linear-time algorithm for the longest path problem in rectangular grid graphs
On randomized algorithms for the majority problem
On generalized Vietoris' number sequences
Optimal strategies for some team games
Extremal spectral radius of degree-based weighted adjacency matrices of graphs with given order and size
Extremal broadcasting problems
A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals
On the number of almost envy-free allocations
Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic
Extremal problems on Steiner k-distances
Incoherent majorities: The McGarvey problem in judgement aggregation
Mathematical model-based security management framework for future ICT outsourcing project
Global optimization for first order Markov Random Fields with submodular priors
Asymptotic results on weakly increasing subsequences in random words
On eccentric distance sum and degree distance of graphs
on Some Geometric Methods in Scheduling Theory: A Survey
Layouts for mobility management in wireless ATM networks
A multi-scale algorithm for drawing graphs nicely
An asymptotic analysis of the evolutionary spatial prisoner's dilemma on a path
On the linear description of the Huffman trees polytope
Counting Representable Sets on Simple Graphs
Restricted power domination and fault-tolerant power domination on grids
TSP Ejection Chains
An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems
Clique-partitioned graphs
Generalized Fitch graphs: Edge-labeled graphs that are explained by edge-labeled trees
Vector bin packing with multiple-choice
A note on perfect Lee-codes
Stable Matchings and Linear Inequalities
An analytic study of the phase transition line in local sequence alignment with gaps
on the Essential Test Sets of Discrete Matrices
On the search of optimal order of variables in the synthesis of switching circuits by cascade technique
Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size
Dual-feasible functions for integer programming and combinatorial optimization: Algorithms, characterizations, and approximations
An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures
On a four-parameter generalization of some special sequences
On the connectivity of p-diamond-free vertex transitive graphs
Ramsey numbers of 4-uniform loose cycles
Distance restricted optimal pebbling in paths
On the local metric dimension of K 5 -free graphs
A note on the polytope of bipartite TSP
Occupation games on graphs in which the second player takes almost all vertices
Zero-divisor graph of a poset with respect to an automorphism
0-1 reformulations of the multicommodity capacitated network design problem
Tight and simple Web graph compression for forward and reverse neighbor queries
A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
Tree with maximum non-self-centrality number among all trees of fixed order and maximum degree
Polynomially Solvable Cases for the Maximum Stable Set Problem
On d-stable locally checkable problems parameterized by mim-width
A small step forwards on the Erdős-Sós problem concerning the Ramsey numbers R(3, k)
The Complexity of Generalized Graph Colorings
Trapezoid graphs and their coloring
Resistance distance and spanning trees of generalized multiple complete split-like graph
Graph-theoretic and polyhedral combinatorics issues and approaches in imaging sciences
A comment to: Two classes of edge domination in graphs
The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
clever or smart: Strategies for the online target date assignment problem
Randomized algorithms for finding the shortest negative cost cycle in networks
Ordered weighted average combinatorial optimization: Formulations and their properties
Simple agents learn to find their way: An introduction on mapping polygons
Maximum nullity and zero forcing number on graphs with maximum degree at most three
Hosoya index of VDB-weighted graphs
Exact algorithms for dominating set
Cross-Correlations of Linearly and Quadratically Related Geometric Sequences and GMW Sequences
Double Roman domination
Rigidity of symmetric linearly constrained frameworks in the plane
Fixed-parameter algorithms for the cocoloring problem
Non total-unimodularity neutralized simplicial complexes
On non-existence of bent-negabent rotation symmetric Boolean functions
Classes of bipartite graphs related to chordal graphs
On the number of connected convex subgraphs of a connected acyclic digraph
Equivalences and the complete hierarchy of intersection graphs of paths in a tree
Defect of an octahedron in a rational lattice
Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
Thin edges in the subgraph induced by noncubic vertices of a brace
Graph labellings with variable weights, a survey
Path Optimization for Graph Partitioning Problems
Packing (1, 1, 2, 4)-coloring of subcubic outerplanar graphs
Independent sets in bounded-degree hypergraphs
Quasi-Hamiltonian cycles in k-strong multipartite tournaments
Divisor generating functions and insertion into a heap
Domination ratio of integer distance digraphs
Sufficient conditions for a balanced bipartite digraph to be even pancyclic
Watersheds, mosaics, and the emergence paradigm
The proportional partitional Shapley value
On graphs for which the connected domination number is at most the total domination number
An efficient algorithm for computing the distance between close partitions
On finding a maximum spanning tree of bounded radius
On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets
Packing non-zero A-paths via matroid matching
The complexity of a minimum reload cost diameter problem
Orthogonal Weighted Linear L 1 and L ∞ Approximation and Applications
On the precise value of the strong chromatic index of a planar graph with a large girth
The rank of a complex unit gain graph in terms of the rank and the independence number of its underlying graph
On the tractability of defensive alliance problem
A O( nm )-Time Algorithm for Computing the Dual of a Regular Boolean Function
Quasi-best match graphs
Multi-parameter analysis of finding minors and induced subgraphs in edge-periodic temporal graphs
A map of the P-positions in 'Nim With a Pass' played on heap sizes of at most four
Multiplicative Zagreb indices of k-trees
L(2, 1)-labeling of perfect elimination bipartite graphs
Review of combinatorial problems induced by spatial forest harvesting planning
Les derivees partielles des fonctions pseudo-booleennes generalisees
A note on "Tenacity of a graph with maximum connectivity"
b9000A 1/4 Approximate Algorithm for P2/tree/Cmax
A Fast Randomized Algorithm for Partitioning a Graph into Paths of Fixed Length
A connection between the Kekulé structures of pentagonal chains and the Hosoya index of caterpillar trees
A note on total domination and 2-rainbow domination in graphs
Lower bounds for the independence and k-independence number of graphs using the concept of degenerate degrees
New tabulation and sparse dynamic programming based techniques for sequence similarity problems
General theory of information transfer: Updated
The extent to which triangular sub-patterns explain minimum rank
Italian domination of Cartesian products of directed cycles
The median function on graphs with bounded profiles
Enumeration of matchings in families of self-similar graphs
Single bend wiring on surfaces
Hard cases of the multifacility location problem
A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions
Rainbow independent sets in graphs with maximum degree two
Combinatorial problems related to origin-destination matrices
Orderings of uniquely colorable hypergraphs
Which Claw-Free Graphs are Perfectly Orderable?
Some improved bounds on communication complexity via new decomposition of cliques
Weighted well-covered graphs without C 4 , C 5 , C 6 , C 7
Wiener index and Harary index on Hamilton-connected graphs with large minimum degree
Efficient solutions to the braid isotopy problem
A note on matchings and separability
New type of coding problem motivated by database theory
Shortest paths in Sierpiński graphs
Simultaneous selection
Searching in trees
A continuous approach for the concave cost supply problem via DC programming and DCA
On real number labelings and graph invertibility
A Divisibility Property for a Subgroup of Riordan Matrices
The minimum number of maximal independent sets in graphs with given order and independence number
An alternative approach to distance geometry using L ∞ distances
Improved online algorithms for jumbled matching
Faster deterministic wakeup in multiple access channels
On the restricted homomorphism problem
On distance magic circulants of valency 6
Laplacian state transfer in edge complemented coronas
Rotation symmetric Boolean functions - Count and cryptographic properties
Preface: CALDAM 2020
Characterization of P 6 -free graphs
Monitoring edge-geodetic sets in graphs
On hereditary clique-Helly self-clique graphs
An Approximation Scheme for Strip Packing of Rectangles with Bounded Dimensions
Multiplicative Circulant Networks Topological Properties and Communication Algorithms
On dynamic coloring for planar graphs and graphs of higher genus
Exploring symmetries in cographs: Obtaining spectra and energies
Complexity of some graph-based bounds on the probability of a union of events
A Potential Reduction Approach to the Frequency Assignment Problem
Injective edge chromatic index of sparse graphs
Interval data minmax regret network optimization problems
Lexicographic permutations with restrictions
The base of the intersection of two free submonoids
Zero forcing in iterated line digraphs
Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times
A polyhedral approach to the stability of a family of coalitions
Generating Hard and Diverse Test Sets for NP-hard Graph Problems
The average expected value of a rooted graph, Monte Carlo calculation, and a power index for the voting game
A connected version of the graph coloring game
Large Cayley Graphs on an Abelian Group
Online Ramsey numbers of K1,3 versus paths
Half-integral five-terminus flows
Safe number and integrity of graphs
Irredundancy in Circular Arc Graphs
On the connectivity and superconnected graphs with small diameter
Restricted arc-connectivity of unidirectional star graphs
A scale-free graph model based on bipartite graphs
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
b-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture
on Halin Subgraphs and Supergraphs
Weighted independent sets in classes of P 6 -free graphs
Finding all the negative cycles in a directed graph
AVD-total-chromatic number of some families of graphs with Δ(G)=3
Earliest arrival flows in networks with multiple sinks
Earliness and Tardiness Scheduling Problems on a Batch Processor
Separable Partitions
Object and image indexing based on region connection calculus and oriented matroid theory
Neighbor-distinguishing indices of planar graphs with maximum degree ten
On some conjectures on biclique graphs
Preface: 13th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2015)
Eternal domination on prisms of graphs
The game of F-saturator
Shortened universal cycles for permutations
Badly-covered graphs
An s-t connection problem with adaptability
Characterization of rotation words generated by homeomorphisms on a circle
On size multipartite Ramsey numbers involving complete graphs
Invariant sets of arcs in network flow problems
Enumeration of Difference Graphs
Graphs of small rank-width are pivot-minors of graphs of small tree-width
L(j, k)-labelling and maximum ordering-degrees for trees
Comparing Zagreb indices for connected graphs
The Communication Complexity of Interval Orders
Graph parameters measuring neighbourhoods in graphs - Bounds and applications
Global defensive alliances in the lexicographic product of paths and cycles
Equitable total coloring of C m C n
A polynomial time algorithm for finding the prime factors of cartesian-product graphs
Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
Estrada index and subgraph centrality of hypergraphs via tensors
b b-chromatic numbers of powers of paths and cycles
The mixed shop scheduling problem
Non-deterministic ideal operators: An adequate tool for formalization in Data Bases
Reducibility number
Natural and extended formulations for the Time-Dependent Traveling Salesman Problem
Independent domination in subcubic bipartite graphs of girth at least six
Three-fast-searchable graphs
A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs
VPG and EPG bend-numbers of Halin graphs
On finding a large number of 3D points with a small diameter
Some tight bounds on the minimum and maximum forcing numbers of graphs
The relationship between two algorithms for decisions via sophisticated majority voting with an agenda
Facial packing vertex-coloring of subdivided plane graphs
Triple arrays and related designs
Car-sharing between two locations: Online scheduling with flexible advance bookings
The inclusion-free edge-colorings of (3, Δ)-bipartite graphs
Rounding in Symmetric Matrices and Undirected Graphs
A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs
Bounds on the resistance distance and Kirchhoff index of graphs
On the computational complexities of various Geography variants
Graph vulnerability parameters, compression, and threshold graphs
A linear algorithm for secure domination in trees
Broadcasting and Spanning Trees in de Bruijn and Kautz Networks
An asymptotically exact polynomial algorithm for equipartition problems
Exclusive and essential sets of implicates of Boolean functions
Remark on the Dimer Problem
Energy of signed digraphs
An approximation algorithm for the Generalized k-Multicut problem
Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints
Extremal problems related to Betti numbers of flag complexes
s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs
On Trades: An Update
A hybrid classifier based on boxes and nearest neighbors
Simple cubic graphs with no short traveling salesman tour
Decomposition theorem on matchable distributive lattices
Two classes of ternary codes and their weight distributions
Isolation number of maximal outerplanar graphs
The Asymptotic Optimality of Spider-Web Networks
Degree sequence realizations with given packing and covering of spanning trees
Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
On injective edge-coloring of graphs with maximum degree 4
On the Complexity of Comparing Evolutionary Trees
Domination parameters with number : Interrelations and algorithmic consequences
Optimal solutions for routing problems with profits
A new locally t-diagnosable structure under the PMC model with an application to matching composition networks
Resource augmented semi-online bounded space bin packing
Transitive orientations in bull-reducible Berge graphs
A note on the generalized steiner tree polytope
Elliptic Approximations of Propositional Formulae
The generalized assignment problem with flexible jobs
On 4- γ t γt-critical graphs of diameter two
Discretization vertex orders in distance geometry
Comparability Graph Augmentation for some Multiprocessor Scheduling Problems
A note on the computational complexity of graph vertex partition
Approximate robust optimization for the Connected Facility Location problem
Listing the bonds of a graph in O˜(n)-delay
The Stochastic Boolean Function Evaluation problem for symmetric Boolean functions
Interference patterns in bijective colorings of 2-regular graphs
Note on non-uniform bin packing games
Ear decomposition and induced even cycles
On self-clique shoal graphs
More on "Connected (n, m)-graphs with minimum and maximum zeroth-order general Randic index"
Corrigendum to "Characterization of polynomially complete quasigroups based on latin squares for cryptographic transformations" [Discrete Appl. Math. 200(2016) 5-17]
Ramsey Numbers r(K 3 , G) for Connected Graphs G of Order Seven
Interlace polynomials: Enumeration, unimodality and connections to codes
General Randić matrix and general Randić incidence matrix
Locating a semi-obnoxious covering facility with repelling polygonal regions
An improvement on the complexity of factoring read-once Boolean functions
Disjunctive programming: To: E. Balas in: P.L. Hammer, E.L. Johnson and B.H. Korete, eds., Discrete Optimization II, Ann. Discrete Math 5 (North-Holland, Amsterdam, 1979) 3-51
Distribution of the null coefficients of the differential polynomial of the tree graphs
The chromatic number of signed graphs with bounded maximum average degree
Majority dynamics with one nonconformist
Constructing bounded degree graphs with prescribed degree and neighbor degree sequences
On some graph classes related to perfect graphs: A survey
Optimal constraints aggregation method for ILP
A greedy reduction algorithm for setup optimization
Grammatical codes of trees
A new enumeration scheme for the knapsack problem
On the fractional metric dimension of graphs
Algorithms for on-line bin-packing problems with cardinality constraints
Feasibility of motion planning on acyclic and strongly connected directed graphs
Edge-stable equimatchable graphs
Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs
A revised algorithm for searching for all defective edges in a graph
Excluding a small minor
Minimal comparability completions of arbitrary graphs
Corner cuts are close to optimal: From solid grids to polygons and back
Out-arc pancyclicity of vertices in tournaments
The total interval number of a graph, III: Tree-like graphs
Domination and total domination in cubic graphs of large girth
Balanced partitions of 3-colored geometric sets in the plane
Modulo orientations with bounded independence number
Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete
Enumeration formula for (2, n)-cubes in discrete planes
Minimization of circuit registers: Retiming revisited
On the closest point to the origin in transportation polytopes
Holes in random graphs
On totally dual integral systems
Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ
On bipartization of cubic graphs by removal of an independent set
On the pushable chromatic number of various types of grids
The MIN PFS problem and piecewise linear model estimation
Spanners in randomly weighted graphs: Independent edge lengths
The list r-hued coloring of Halin graph
On generalized Fibonacci numbers and k-distance K p -matchings in graphs
Provably secure and efficient leakage-resilient certificateless signcryption scheme without bilinear pairing
Enumerating minimal dominating sets in chordal bipartite graphs
A Sufficient Condition for All Short Cycles
Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs
Counting Markov equivalence classes for DAG models on trees
Further results on the mixed metric dimension of graphs
Preface: ODSA
Approximating minimal unsatisfiable subformulae by means of adaptive core search
Distributed algorithm for approximating the maximum matching
Circumscribing Certain Polygonal Systems
An ant-based algorithm for coloring graphs
Parameterized complexity of distance labeling and uniform channel assignment problems
A hybrid algorithm for the DNA sequencing problem
Majority coloring game
Efficient embeddings of grids into grids
Finitary and cofinitary gammoids
Thue choosability of trees
An intersection problem for finite automata
Algebraic flows in regular matroids
Extremal Graphs Domination Insensitive to the Removal of k Edges
Nonblocking Self-Routing Switching Networks
A Polynomial Algorithm for an open Shop Problem with Unit Processing Times and Tree Constraints
NP-hardness of Shop-scheduling Problems with Three Jobs
Directed domination in oriented graphs
Vertex-pancyclism in the generalized sum of digraphs
Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams
Two classes of optimal p-ary few-weight codes from down-sets
Facility location problems: A parameterized view
The complexity of regular subgraph recognition
Pattern analysis for the prediction of fungal pro-peptide cleavage sites
Lift-and-project ranks of the stable set polytope of joined a-perfect graphs
Hamiltonian completions of sparse random graphs
The hunting of a snark with total chromatic number 5
The sum necessary to ensure that a degree sequence pair has an A-connected realization
Dominating maximal outerplane graphs and Hamiltonian plane triangulations
A procedural egalitarian solution for NTU-games
On reformulated Zagreb indices
Testing primitivity on partial words
Applications to cryptography of twisting commutative algebraic groups
Homotopy in digital spaces
An algorithm to analyze stability of gene-expression patterns
A new construction for Z-cyclic whist tournaments
Retractions of Finite Distance Functions Onto Tree Metrics
Spanning Local Tournaments in Locally Semicomplete Digraphs
On the pebbling numbers of Flower, Blanuša and Watkins snarks
A linear-time algorithm to compute the triangular hull of a digital object
The complexity of some graph colouring problems
Peripheral Wiener index of trees and related questions
A refined result on cross-intersecting families
Algorithms for computing the Shapley value of cooperative games on lattices
A polynomial algorithm for weighted scattering number in interval graphs
Characterizing minimally flat symmetric hypergraphs
On the variance of average distance of subsets in the Hamming space
The discrete separation theorem and price adjustment directions in markets with heterogeneous commodities
Proximity, remoteness and girth in graphs
Local search algorithms for a single-machine scheduling problem with positive and negative time-lags
Asymptotically large ( Delta , D )-graphs
A point-plane incidence theorem in matrix rings