X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (16) 16
computer science (13) 13
algorithms (10) 10
mathematics, applied (9) 9
mathematics - combinatorics (6) 6
poset (6) 6
coloring (5) 5
first-fit (5) 5
graphs (5) 5
on-line (5) 5
chain partition (4) 4
geometry (4) 4
posets (4) 4
theory of computation (4) 4
algorithm (3) 3
chain partitioning (3) 3
chromatic number (3) 3
computer science - discrete mathematics (3) 3
graph theory (3) 3
theoretical computer science (3) 3
1st-fit (2) 2
apexes (2) 2
combinatorial nullstellensatz (2) 2
combinatorics (2) 2
computational complexity (2) 2
convex and discrete geometry (2) 2
discrete mathematics (2) 2
discrete mathematics and combinatorics (2) 2
discrete mathematics in computer science (2) 2
game theory (2) 2
games (2) 2
integers (2) 2
long incomparable chains (2) 2
matching (2) 2
mathematical analysis (2) 2
on-line dimension (2) 2
online (2) 2
robber (2) 2
semi-order (2) 2
trees (2) 2
universities and colleges (2) 2
upper bounds (2) 2
05c57 (1) 1
06a07 (1) 1
1-2-3 conjecture (1) 1
68w27 (1) 1
[ info ] computer science [cs] (1) 1
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (1) 1
[info]computer science [cs] (1) 1
acyclic chromatic index (1) 1
acyclic edge colorings (1) 1
additive coloring (1) 1
additives (1) 1
algebra and number theory (1) 1
algorithm analysis and problem complexity (1) 1
algorithme graphe (1) 1
analysis (1) 1
approximate matchings (1) 1
approximation algorithms (1) 1
approximation methods (1) 1
arboricity (1) 1
bipartite graph (1) 1
bipartite matchings (1) 1
bismuth (1) 1
bounded expansion (1) 1
bounds (1) 1
cellular communication (1) 1
chain partitions (1) 1
chains (1) 1
clustering algorithms (1) 1
color (1) 1
combinatorial analysis (1) 1
computación (1) 1
computation by abstract devices (1) 1
computational biology (1) 1
computational theory and mathematics (1) 1
computer algorithms (1) 1
computer algorithms congresses (1) 1
computer logic (1) 1
computer science - data structures and algorithms (1) 1
computer science congresses (1) 1
computer science, theory & methods (1) 1
computer software (1) 1
computer vision (1) 1
computers (1) 1
congresses (1) 1
dimension (1) 1
discrete-time systems (1) 1
dynamic graph algorithms (1) 1
electronic books (1) 1
engineering design (1) 1
entropy (1) 1
entropy compression (1) 1
euclidean geometry (1) 1
feeds (1) 1
game (1) 1
game chromatic number (1) 1
geometry and topology (1) 1
gpgpu (1) 1
graham's problem (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Discrete Applied Mathematics, ISSN 0166-218X, 02/2019, Volume 255, pp. 15 - 20
A majority coloring of a graph is a coloring of its vertices such that for each vertex v, at least half of the neighbors of v have different color than v. Let... 
Game chromatic number | Majority game chromatic number | Majority coloring | MATHEMATICS, APPLIED | CHROMATIC NUMBER | Coloring | Graphs | Graph theory | Apexes | Game theory
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 12/2018, Volume 251, pp. 30 - 39
The main topic of this paper is motivated by a localization problem in cellular networks. Given a graph G we want to localize a walking agent by checking his... 
MATHEMATICS, APPLIED | ROBBER | Geometry | Euclidean geometry | Cellular communication | Apexes | Upper bounds | Graphs | Graph theory | Trees (mathematics) | Position (location) | Game theory | Computer Science | Discrete Mathematics
Journal Article
Theory of Computing Systems, ISSN 1432-4350, 2/2018, Volume 62, Issue 2, pp. 337 - 348
The shortest augmenting path (Sap) algorithm is one of the most classical approaches to the maximum matching and maximum flow problems, e.g., using it Edmonds... 
Approximate matchings | Online matchings | Bipartite matchings | Computer Science | Dynamic graph algorithms | Theory of Computation | Shortest augmenting paths | MATHEMATICS | COMPUTER SCIENCE, THEORY & METHODS | Computer science | Algorithms | Trees | Matching | Shortest path algorithms | Graph theory | Upper bounds
Journal Article
Combinatorica, ISSN 0209-9683, 2/2015, Volume 35, Issue 1, pp. 1 - 38
The main question in the on-line chain partitioning problem is to decide whether there exists an on-line algorithm that partitions posets of width at most w... 
Mathematics, general | 68W27 | Mathematics | Combinatorics | 05C57 | 06A07 | MATHEMATICS | POSETS | LONG INCOMPARABLE CHAINS | 1ST-FIT | ORDERS | Computer science | Algorithms
Journal Article
Electronic Journal of Combinatorics, ISSN 1077-8926, 09/2017, Volume 24, Issue 3
A majority coloring of a digraph is a coloring of its vertices such that for each vertex v, at most half of the out-neighbors of v have the same color as v. A... 
MATHEMATICS | MATHEMATICS, APPLIED
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2018, Volume 10807, pp. 201 - 216
Conference Proceeding
ARS MATHEMATICA CONTEMPORANEA, ISSN 1855-3966, 2019, Volume 16, Issue 1, pp. 111 - 117
The 1-2-3 conjecture states that every simple graph (with no isolated edges) has an edge weigthing by numbers 1, 2, 3 such that the resulting weighted vertex... 
MATHEMATICS | MATHEMATICS, APPLIED | Oriented hypergraphs | 1-2-3 conjecture | list weighting | combinatorial nullstellensatz
Journal Article
Applicable Analysis and Discrete Mathematics, ISSN 1452-8630, 4/2016, Volume 10, Issue 1, pp. 73 - 87
A of a 𝑘-uniform hypergraph 𝐻 is a vertex coloring such that no two vertices in the same edge share the same color, and each 𝑘-element subset of colors... 
Integers | Entropy | Hypergraphs | Vertices | Uniform hypergraphs | Harmonious coloring | Vertex-distinguishing coloring | vertex-distinguishing coloring | MATHEMATICS | MATHEMATICS, APPLIED | uniform hypergraphs | BOUNDS | CHROMATIC NUMBER
Journal Article
Discrete Mathematics, ISSN 0012-365X, 03/2018, Volume 341, Issue 3, pp. 781 - 785
In this paper we introduce and study two graph coloring problems and relate them to some deep number-theoretic problems. For a fixed positive integer k... 
Coloring | Graham's problem | MATHEMATICS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 05/2019, Volume 342, Issue 5, pp. 1343 - 1350
The arboricity of a graph G is the least number of colors needed to color the edges of G so that no cycle is monochromatic. We consider a higher order analog... 
Arboricity | Bounded expansion | Acyclic chromatic index | Entropy compression | MATHEMATICS | ACYCLIC EDGE COLORINGS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 03/2018, Volume 341, Issue 3, pp. 781 - 785
In this paper we introduce and study two graph coloring problems and relate them to some deep number-theoretic problems. For a fixed positive integer k... 
Coloring | Graham’s problem
Journal Article
03/2018
An on-line chain partitioning algorithm receives the points of the poset from some externally determined list. Being presented with a new point the algorithm... 
Journal Article
Electronic Journal of Combinatorics, ISSN 1077-8926, 05/2018, Volume 25, Issue 2
Bosek and Krawczyk exhibited an online algorithm for partitioning an online poset of width w into w(14lgw) chains. We improve this to w(6.5lgw+7) with a... 
Poset | Partially ordered set | First-fit | Ladder | Regular poset | Online chain partition | INTERVAL-GRAPHS | MATHEMATICS | MATHEMATICS, APPLIED | POSETS | LONG INCOMPARABLE CHAINS | ALGORITHM | 1ST-FIT
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2015, Volume 9499, pp. 59 - 71
Conference Proceeding
Order, ISSN 0167-8094, 3/2016, Volume 33, Issue 1, pp. 29 - 38
We study a min-max relation conjectured by Saks and West: For any two posets P and Q the size of a maximum semiantichain and the size of a minimum unichain... 
Geometry | Semiantichain | Unichain | Poset duality | Discrete Mathematics in Computer Science | Saks-West conjecture | Mathematics | Theory of Computation | MATHEMATICS | CHAIN PARTITIONS | POSETS | PRODUCTS | SETS | PARTIAL ORDERS | SPERNER K-FAMILIES | Computer science | Computer Science
Journal Article
SIAM Journal on Discrete Mathematics, ISSN 0895-4801, 2013, Volume 27, Issue 1, pp. 126 - 140
One of the simplest heuristics for obtaining a proper coloring of a graph is the first-fit algorithm. First-fit visits each vertex of the graph in the... 
Grundy number | Poset | First-fit | Incomparability graphs | Chain partitioning | MATHEMATICS, APPLIED | POSETS | chain partitioning | incomparability graphs | CHROMATIC NUMBER | GRUNDY | CHAINS | poset | ONLINE | first-fit | Coloring | Graphs | Algorithms | Mathematical analysis | Heuristic
Journal Article
ELECTRONIC JOURNAL OF COMBINATORICS, ISSN 1077-8926, 12/2018, Volume 25, Issue 4
One important problem in a network G is to locate an (invisible) moving entity by using distance-detectors placed at strategical locations in G. For instance,... 
MATHEMATICS | MATHEMATICS, APPLIED | ROBBER | Computer Science | Discrete Mathematics | Computational Complexity
Journal Article
09/2018
An on-line chain partitioning algorithm receives the vertices of a poset one at a time, and when a vertex is received, irrevocably assigns it to one of the... 
Computer Science - Data Structures and Algorithms
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 12/2011, Volume 38, pp. 173 - 179
Using natural numbers for identifying chains, First-Fit algorithm processes elements of a poset P in some order and for each element it assigns the smallest... 
chain partition | on-line algorithm | poset | first-fit | Poset | First-fit | On-line algorithm | Chain partition | Algorithms
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 9/2014, Volume 30, Issue 5, pp. 1087 - 1098
An additive coloring of a graph G is an assignment of positive integers $${\{1,2,\ldots ,k\}}$$ { 1 , 2 , … , k } to the vertices of G such that for every two... 
Additive coloring | Mathematics | Engineering Design | Combinatorics | Planar graphs | MATHEMATICS | COMBINATORIAL NULLSTELLENSATZ | Computer science | Graphs | Integers | Coloring | Additives | Proving | Texts | Combinatorial analysis | Sums
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.