yusuke1997/dblp-id-title huggingface dataset:
A particle swarm optimization method for semi-obnoxious line location problem with rectilinear norm
The last-mile delivery vehicle routing problem with handling cost in the front warehouse mode
Optimal scheduling ratio of recycling waste paper with NSGAII based on deinked-pulp properties prediction
Procurement, traceability and advance cash credit payment transactions in supply chain using blockchain smart contracts
Workflow structuring and reengineering method for design process
Optimising production efficiency: Managing flexibility in Industry 4.0 systems via simulation
A cooperative swarm intelligence algorithm based on quantum-inspired and rough sets for feature selection
Mixed-integer linear programming approach for product design for life-cycle profit
Predicting and analyzing technology convergence for exploring technological opportunities in the smart health industry
Foundations for an Intelligence-driven Information Security Risk-management System
Reasoning about Discontinuance of Information System Use
Complexity and Flexibility in Information Systems Design and Implementation
Should We Stay or Should We Go? Analyzing Continuance of Cloud Enterprise Systems
An Experimental Study of the Attention-based View of Idea Integration: The Need for a Multi-level Dependent Variable
Integrating Wearable Devices and Recommendation System: Towards a Next Generation Healthcare Service Delivery
mHealth Engineering: A Technology Review
Building Up Knowledge through Meta-analysis: A Review and Reinterpretation
Predator-prey / Obligate Mutualism in Information System Security and Usage
Enhancing Reflexivity in Software Development Teams: Should We Focus on Autonomy or Interdependence?
Using a Work System Perspective to Expand BPM Research Use Cases
What Determines User Attitudes in IS Research? A Meta-analytic Structural Equation Modeling Approach
Designing Innovative Education through Action Design Research: Method and Application for Teaching Design Activities in Large Lecture Environments
If You Build It, Will They Use It? Challenges in Adoption and Use of Patient-centered E-health
Ambidexterity in Information Systems Research: Overview of Conceptualizations, Antecedents, and Outcomes
Stuck in the Past? The Moderation Effect of Personal Nostalgia on the Attitude Behavior Relationship in IS Adoption Contexts
Mobile Service Support based on Smart Glasses
The Development of an Integrated Model of EMR Adoption: Incorporating the Organization Artifact
Between a Rock and a Hard Place: Facing Dilemmas in IT Risk Management
Structuring Digital Transformation: A Framework of Action Fields and its Application at ZEISS
Understanding Coordination in the Information Systems Domain: Conceptualization and Implications
Projectability in Design Science Research
Special Issue Editorial: Enterprise Systems Frontiers
Editorial: IT-enabled Organization Design
Social Shaping Leadership in Enterprise System Acquisition and Development: The Influence of Reference Users in Xizi Holdings
Incentive Policies for Facilitating Knowledge Sharing in an Enterprise Social Network
A Platform-based Design Approach for Flexible Software Components
Government IS Implementation: A Framework for Stakeholder Orientation
Mutual Trust between the Chief Information Officer and Chief Executive Officer: Insights from an Exploratory Interview Study
Factors that Affect the Success of Security Education, Training, and Awareness Programs: A Literature Review
Identifying Challenges in Business Rules Management Implementations regarding the Elicitation, Design, and Specification Capabilities at Dutch Governmental Institutions
Using New Lenses in Information Systems Research
The Role of Enterprise Systems in Fostering Innovation in Contemporary Firms
How to Structure Business Transformation Projects: The Case of Infineon's Finance IT Roadmap
How Do They Differ? Analyzing the Motivations of Posters and Lurkers for Participation in Enterprise Social Networks
Hospital-wide Process-oriented Organization of Care: The Case of Turku University Central Hospital
Organizational Learning and ERP Post-implementation Phase: A Situated Learning Perspective
Research Mode and Contribution in Interorganizational Information Systems Research
Selecting Communication Artifacts for Requirements Engineering
Lean Management in IT Organizations: A Ranking-type Delphi Study of Implementation Success Factors
Stimulating Discourse on Topical Themes in Information Systems Research
A new lower bound on the double domination number of a graph
New Results on the Completion Time Variance Minimization
Minor-obstructions for apex sub-unicyclic graphs
On cover-structure graphs
Edge and total coloring of interval graphs
Minimum convex partition of a constrained point set
Probabilistic Estimates for the Generalized Maximum Satisfiability Problem
The universality of iterated hashing over variable-length strings
On some properties of base-matroids
A characterization of uniquely representable interval graphs
Quasi-concave functions on meet-semilattices
On two eccentricity-based topological indices of graphs
Remarks on odd colorings of graphs
Some Democratic Secret Sharing Schemes
On the Number of Abelian Square-free Words on Four Letters
Making a tournament k-arc-strong by reversing or deorienting arcs
Transforming a graph into a 1-balanced graph
A note on greedy algorithms for the maximum weighted independent set problem
Independent domination versus packing in subcubic graphs
Multithread interval scheduling with flexible machine availabilities: Complexity and efficient algorithms
Reliability measure of multiprocessor system based on enhanced hypercubes
Algorithms for computing the Folk rule in minimum cost spanning tree problems with groups
The maximum traveling salesman problem on van der Veen matrices
The Turán number of the square of a path
Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines
Preemptive Scheduling with Variable Profile, Precedence Constraints and Due Dates
On the ranks of O'N and Ly
A simple algorithm to find the steps of double-loop networks
A characterization of balanced Boolean functions with optimal algebraic immunity
On the limit of the sequence {Cm(D)}m=1∞ for a multipartite tournament D
Uniqueness of currents in infinite resistive networks
On linear and circular structure of (claw, net)-free graphs
A correct proof of the McMorris-Powers' theorem on the consensus of phylogenies
Sparse connectivity certificates via MA orderings in graphs
On r-equitable chromatic threshold of Kronecker products of complete graphs
On the global forcing number of hexagonal systems
Introduction to partially ordered patterns
Graphs with minimum fractional domatic number
On a conjecture of Graham and Lovász about distance matrices
Transitive reduction of a nilpotent boolean matrix
On redundant locating-dominating sets
A general two-sided matching market with discrete concave utility functions
"A posteriori" evaluation of bin packing approximation algorithms
A note on the multiple-recursive matrix method for generating pseudorandom vectors
Generation of Key Predistribution Schemes Using Secret Sharing Schemes
A construction of uniquely colourable graphs with equal colour class sizes
Scheduling jobs with release dates on parallel batch processing machines
Simple linear-time algorithms for counting independent sets in distance-hereditary graphs
Gallai-Ramsey numbers for books
On NP-hard graph properties characterized by the spectrum
1-planarity of complete multipartite graphs
Sequential Colorings and Perfect Graphs
On the existence of graphs which can colour every regular graph
Completing partial latin squares with prescribed diagonals
The global forcing number of the parallelogram polyhex
On disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs
On the number of components of (k, g)-cages after vertex deletion
A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint
Bin packing and multiprocessor scheduling problems with side constraint on job types
The price of connectivity for feedback vertex set
on Determining Non-isotopic Configurations of Points on a Circle
On cryptographic protocols employing asymmetric pairings - The role of Ψ revisited
An impossible combinatorial counting method in distance geometry
Upper bounds on the average eccentricity of K3-free and C4-free graphs
The (conditional) matching preclusion for burnt pancake graphs
Extremal numbers of leaves for trees with fixed diameter and maximum degree
Improved bounds for harmonic-based bin packing algorithms
k-tuple total domination in graphs
Finding a homotopy base for directed paths in an acyclic graph
An application of discrete mathematics in the design of an open pit mine
Path-kipas Ramsey numbers
Pareto-optimal patterns in logical analysis of data
Upper bounds on the signed total domatic number of graphs
Maxima of the Q-index of leaf-free graphs with given size
Minimum fill-in and treewidth of split+ke and split+kv graphs
On simplified NP-complete variants of Monotone3-Sat
Assistance and interdiction problems on interval graphs
An improved lower bound for the Seidel energy of trees
Minimum length word-representants of word-representable graphs
List backbone colouring of graphs
An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem
A note on fundamental, non-fundamental, and robust cycle bases
Approximation algorithms for some position-dependent scheduling problems
Scheduling of Conditional Executed Jobs on Unrelated Processors
String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
A new sufficient condition for pancyclability of graphs
Deterministic symmetric rendezvous with tokens in a synchronous torus
Cover numbers by certain graph families
A formulation of the wide partition conjecture using the atom problem in discrete tomography
An efficient algorithm for finding a two-pair, and its applications
Linear and combinatorial sharing problems
Clutter nonidealness
Repetition-free longest common subsequence of random sequences
Rainbow connection number and graph operations
The absolute center of a unicyclic network
The complexity of solution-free sets of integers for general linear equations
The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings
Some notes on disjunctive short sum: polychromatic nim
On a family of trees with minimal atom-bond connectivity index
Flip paths between lattice triangulations
Linear kernels for k-tuple and liar's domination in bounded genus graphs
Partitioning a graph into disjoint cliques and a triangle-free graph
The Dudeney-Stockmeyer Conjecture
Affine equivalence in the AES round function
On the total forcing number of a graph
On the complexity of the Cable-Trench Problem
Counting 4×4 matrix partitions of graphs
Computing distance moments on graphs with transitive Djoković-Winkler relation
Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT
XSAT and NAE-SAT of linear CNF classes
Tree-width of graphs without a 3×3 grid minor
Counting preimages of TCP reordering patterns
Vertex-disjoint stars in K1, r-free graphs
On the b-chromatic number of regular graphs
Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs
Edge-intersection graphs of grid paths: The bend-number
Many-to-one simulation in E0L forms is decidable
Construction methods for generalized bent functions
On monochromatic component size for improper colourings
Matching preclusion for k-ary n-cubes with odd k ≥ 3
Shrinking generators based on σ-LFSRs
Maximal polyomino chains with respect to the Kirchhoff index
On the difference between the Szeged index and the Wiener index of cacti
Some extremal problems on the distance involving peripheral vertices of trees with given matching number
The Relationship between the Gossip Complexity in Vertex-Disjoint Paths Mode and the Vertex Bisection Width
Vertex-degree-based topological indices over starlike trees
Sequences of radius k for complete bipartite graphs
Mixed Logical-linear Programming
Structural parameterization for minimum conflict-free colouring
Independent tree spanners: fault-tolerant spanning trees with constant distance guarantees
The Copeland Measure of Condorcet Choice Functions
Structural parameters, tight bounds, and approximation for (k, r)-center
Complexity of problems in games, graphs and algebraic equations
Vectorial bent functions weakly/strongly outside the completed Maiorana-McFarland class
Computational aspects of monotone dualization: A brief survey
A new construction of broadcast graphs
Classes of regular and context-free languages over countably infinite alphabets
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems
On a Riemann hypothesis analogue for selfdual weight enumerators of genus less than 3
Comparing the p-independence number of regular graphs to the q-independence number of their line graphs
On a certain class of power- and energy-related scheduling problems
On the Complexity of the Embedding Problem for Hypercube Related Graphs
Branchwidth of chordal graphs
An approximation algorithm for the longest cycle problem in solid grid graphs
The Expected Number of Symmetries in Locally Restricted Trees II
A study on load-balanced variants of the bin packing problem
Game of pure chance with restricted boundary
The list distinguishing number of Kneser graphs
Using Local Adaptations to Reconfigure a Spanning Tree of a Network
A simple proof of the multiplicativity of directed cycles of prime power length
Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
An O∗(2.619k) algorithm for 4-Path Vertex Cover
On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes
Optimal strategies for equal-sum dice games
Complexity of the packing coloring problem for trees
The maximum number of cliques in graphs with given fractional matching number and minimum degree
Dynamic monopolies in tori
Some approaches for solving the general ( t , k )-design existence problem and other related problems
A rounding theorem for unique binary tomographic reconstruction
Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope
On the Δ-interval and the Δ-convexity numbers of graphs and graph products
A Representation Theorem of the Suffixes of Characteristic Sequences
Chemical graphs enumeration and chemical reactivity: thermodynamic and kinetic considerations
Analysis on the strip-based projection model for discrete tomography
Multi-source spanning trees: algorithms for minimizing source eccentricities
Accretion centers: A generalization of branch weight centroids
Computing the differential of a graph: Hardness, approximability and exact algorithms
A characterization of competition graphs
Tight isolated toughness bound for fractional (k, n)-critical graphs
Spanning paths in graphs
Alternating kernels
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
Complexity of the generalized conjugacy problem
Reciprocal degree distance and graph properties
Inexact tree pattern matching with 1-degree edit distance using finite automata
Edge isoperimetric method: At least 2/3 of h-extra edge-connectivity of a kind of cube-based graphs concentrates on 2n-1
Efficiently solvable special cases of bottleneck travelling salesman problems
The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function
On the vertex k k-path cover
A network theory approach to the rigidity of skeletal structures part II. Laman's theorem and topological formulae
Bounded-call broadcasting
Determining structural similarity of chemicals using graph-theoretic indices
Sequential and simultaneous aggregation of diophantine equations
Orientable domination in product-like graphs
The NLC-width and clique-width for powers of graphs of bounded tree-width
Minimal obstructions for a matrix partition problem in chordal graphs
Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions
Connectivity of Consecutive- d Digraphs
The orbits of twisted cubes
Some degree and distance-based invariants of wreath products of graphs
Patterns in trees
Finding the maximum and minimum elements with one lie
Hypercube Embedding of Generalized Bipartite Metrics
An upper bound on the sum of powers of the degrees of simple 1-planar graphs
Distance-two labellings of Hamming graphs
Cacti with n-vertices and t cycles having extremal Wiener index
The combinatorics of tandem duplication
Y-equivalence and rhombic realization of projective-planar quadrangulations
Extremal Hosoya index and Merrifield-Simmons index of hexagonal spiders
On the complexity and approximation of the maximum expected value all-or-nothing subset
Phorma: perfectly hashable order restricted multidimensional arrays
Tenacity of a graph with maximum connectivity
The location-dispatching problem: Polyhedral results and content delivery network design
Extremal problems for ordered hypergraphs: small patterns and some enumeration
On Harary index of graphs
LDPC codes from Singer cycles
A Simple as Correct Algorithm for Deciding If a Graph Has a Perfect Matching
Fault-tolerant routings in Kautz and de Bruijn networks
Maximal Irredundant Functions
Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs
on the Integral Dicycle Packings and Covers and the Linear ordering Polytope
Rainbow and Gallai-Rado numbers involving binary function equations
The localization game on Cartesian products
Analysis on Yu et al.'s dynamic algorithm for canonic DBC
On monotonicity in Maker-Breaker graph colouring games
Going Wide with the 1-2-3 Conjecture
Fibonacci (p, r)-cubes which are median graphs
A ternary search problem on two disjoint sets
A Nice Class for the Vertex Packing Problem
Rectangle-visibility Representations of Bipartite Graphs
Some results on (strong) total proper connection number of some digraphs
The total bondage number of grid graphs
Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems
Complexity of rainbow vertex connectivity problems for restricted graph classes
Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars
The Minimum Spanning Tree Problem on a Planar Graph
Maximum-entropy remote sampling
Multiple parallel-batch machines scheduling with additive resource assignment and machine available times
Stage-graph Representations
Two-graphs and NSSDs: An algebraic approach
Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph
Routing sets in the integer lattice
Facial unique-maximum edge and total coloring of plane graphs
The average Steiner (3,2)-eccentricity of trees
Integral trees with diameter 6
Approximating Boolean functions by OBDDs
Group testing and fault detection for replicated files
Topological relations between separating circles
Approximating maximum uniquely restricted matchings in bipartite graphs
The decomposition of a square into rectangles of minimal perimeter
Average Distance and Domination Number
Polynomial reduction of time-space scheduling to time scheduling
Bounds on the index of the signless Laplacian of a graph
Some advances on the set covering polyhedron of circulant matrices
Reformulations and complexity of the clique interdiction problem by graph mapping
The most vital nodes with respect to independent set and vertex cover
Batch Scheduling and Common Due-date Assignment on a Single Machine
On the characteristic polynomial of the adjacency matrix of the subdivision graph of a graph
Local symmetries in the period-doubling sequence
A note on extension properties and representations of matroids
In-depth analysis of granular local search for capacitated vehicle routing
Clique-width of path powers
Perfect error-correcting databases
House of Graphs 2.0: A database of interesting graphs and more
Scale-sensitive Dimensions and Skeleton Estimates for Classification
An algorithm for a separable integer programming problem with cumulatively bounded variables
Algorithms for Weakly Triangulated Graphs
Distance Laplacian spectra of graphs: A survey
Eulerian subgraphs and Hamilton-connected line graphs
Optimal covering designs: complexity results and new bounds
Relationship between the edge-Wiener index and the Gutman index of a graph
On interval colouring reorientation number of oriented graphs
Local Irregularity Conjecture vs. cacti
House-swapping with divorcing and engaged pairs
On the distance function approach to color image enhancement
Circular a Avoiding Sequences with Prescribed Sum
Consecutive occurrences with distance constraints
New transience bounds for max-plus linear systems
Enumeration aspects of maximal cliques and bicliques
Modulo 5-orientations and degree sequences
Reachability in arborescence packings
Null decomposition of unicyclic graphs
The directed pendant-tree 3-connectivity of symmetric compositions
On the embedding of cone graphs in the line with distinct distances between neighbors
The Base-matroid and Inverse Combinatorial Optimization Problems
A note on the restricted edge connectivity and perfect matchings of regular graphs
Characterization and recognition of P 4 -sparse graphs partitionable into k independent sets and l cliques
On the asymptotic existence of partial complex Hadamard matrices and related combinatorial objects
Antimagic labeling of biregular bipartite graphs
Projective DNF formulae and their revision
Optimum Partitioning into Intersections of Ring Families
Diameter vulnerability of GC graphs
On k-repetition freeness of length uniform morphisms over a binary alphabet
Algorithms for Interval Catch Digraphs
On the sum of all distances in bipartite graphs
Optimal design of switched Ethernet networks implementing the Multiple Spanning Tree Protocol
Variants of the majority problem
The edge-Wiener index and the edge-hyper-Wiener index of phenylenes
Minimizing Phylogenetic Number To Find Good Evolutionary Trees
Linear sections of the general linear group: A geometric approach
Scheduling two irregular polygons
On Paths Avoiding Forbidden Pairs of Vertices in a Graph
Partitioning problems in dense hypergraphs
The indefinite zero-one quadratic problem
A New Sufficient Condition for a Digraph to Be Hamiltonian
Planar Turán number of the disjoint union of cycles
Total domishold graphs: A generalization of threshold graphs, with connections to threshold hypergraphs
On the submodularity of multi-depot traveling salesman games
Approximation algorithm for minimum connected 3-path vertex cover
Spectral characterization of the complete graph removing a path of small length
Totally optimal decision rules
Limits of k-dimensional poset sequences
Approximation Algorithms and Relaxations for a Service Provision Problem on a Telecommunication Network
Navigating between packings of graphic sequences
On the sizes of generalized cactus graphs
An improvement to Chvátal and Thomassen's upper bound for oriented diameter
On the Consecutive Ones Property
Gray codes for non-crossing partitions and dissections of a convex polygon
Proof of Berge's path partition conjecture for k ≤ λ - 3
Maximal cubic graphs with diameter 4
Some results on minimum saturated graphs
SAT distributions with planted assignments and phase transitions between decision and optimization problems
List star edge coloring of sparse graphs
On the Definition and the Construction of Pockets in Macromolecules
Strong intractability results for generalized convex recoloring problems
Unique list-colourability and the fixing chromatic number of graphs
Graphs on Alphabets as Models for Large Interconnection Networks
On Edge-colored Interior Planar Graphs on a Circle and the Expected Number of RNA Secondary Structures
Erratum to "An improved randomized approximation algorithm for maximum triangle packing" [Discrete Appl. Math. 157 (2009) 1640-1646]
A short note on the sum of k largest distance eigenvalues of bipartite graphs
On indicated coloring of lexicographic product of graphs