X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
computer science (26) 26
discrete mathematics (22) 22
archaeology and prehistory (19) 19
humanities and social sciences (19) 19
mathematics (16) 16
archaeology (15) 15
geosciences, multidisciplinary (14) 14
neanderthals (14) 14
[shs.archeo]humanities and social sciences/archaeology and prehistory (12) 12
operations research (12) 12
analysis (11) 11
identifying codes (11) 11
middle palaeolithic (11) 11
geography, physical (10) 10
[shs]humanities and social sciences (9) 9
discrete mathematics and combinatorics (9) 9
france (9) 9
graph theory (9) 9
algorithms (8) 8
anthropology (8) 8
combinatorics (8) 8
mathematics, applied (8) 8
site (7) 7
theoretical computer science (7) 7
[info.info-dm]computer science [cs]/discrete mathematics [cs.dm] (6) 6
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (5) 5
[ shs.archeo ] humanities and social sciences/archaeology and prehistory (5) 5
[info.info-ro]computer science [cs]/operations research [cs.ro] (5) 5
fault detection (5) 5
graphs (5) 5
index medicus (5) 5
lithic assemblages (5) 5
[ info.info-ro ] computer science [cs]/operations research [cs.ro] (4) 4
applied mathematics (4) 4
fossils (4) 4
human remains (4) 4
paleontology (4) 4
payre (4) 4
payre ardeche (4) 4
animals (3) 3
baume flandin (3) 3
bones (3) 3
cave (3) 3
computer science, theory & methods (3) 3
diet (3) 3
earth sciences (3) 3
europe (3) 3
fasciagraphs (3) 3
faunal assemblages (3) 3
flint (3) 3
geomorphology (3) 3
hunting (3) 3
middle paleolithic site (3) 3
mobility (3) 3
occupation (3) 3
optimization (3) 3
paléolithique moyen (3) 3
pecheurs ardeche (3) 3
pleistocene (3) 3
resource management (3) 3
rivers (3) 3
seasonality (3) 3
sediments (3) 3
subsistence (3) 3
subsistence strategies (3) 3
teeth (3) 3
territorial organisation (3) 3
zooarchaeology (3) 3
[math.math-co]mathematics [math]/combinatorics [math.co] (2) 2
[shs.archeo] humanities and social sciences/archaeology and prehistory (2) 2
ardeche (2) 2
behavior (2) 2
bone-collagen (2) 2
case studies (2) 2
caucasus (2) 2
caune (2) 2
caves (2) 2
chronology (2) 2
codes (2) 2
codes identifiants (2) 2
coding and information theory (2) 2
combinatoire (2) 2
combinatorial analysis (2) 2
combinatorial games (2) 2
computational theory and mathematics (2) 2
computer science - discrete mathematics (2) 2
cortex (2) 2
data encryption (2) 2
data structures, cryptology and information theory (2) 2
discrete mathematics in computer science (2) 2
early-modern humans (2) 2
economics (2) 2
evolutionary biology (2) 2
excavations (2) 2
exploitation (2) 2
fauna (2) 2
faunal exploitation (2) 2
games (2) 2
gathering outcrop (2) 2
grids (2) 2
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Discrete mathematics and theoretical computer science, ISSN 1462-7264, 05/2019, Volume 21, Issue 3
In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are... 
Computer Science | Discrete Mathematics
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 09/2006, Volume 154, Issue 14, pp. 2032 - 2039
Identifying codes were defined to model fault diagnosis in multiprocessor systems. They are also used for the design of indoor detection systems based on... 
Fault detection | Identifying codes | Graph theory
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 11/2012, Volume 160, Issue 16-17, pp. 2389 - 2396
In a graph G=(V,E), the density is the ratio between the number of edges |E| and the number of vertices |V|. This criterion may be used to find communities in... 
Community detection | Graph partition | Algorithms | Complexity | MATHEMATICS, APPLIED | COMMUNITY STRUCTURE | NETWORKS | CUTS | Partitions | Communities | Mathematical analysis | Graphs | Criteria | Density | Optimization | Computer Science | Operations Research
Journal Article
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2006, Volume 154, Issue 6, pp. 898 - 899
Let M t ( n ) denote the minimum cardinality of a t-identifying code in the n-cube. It was conjectured that for all n ⩾ 2 and t ⩾ 1 we have M t ( n ) ⩽ M t ( n... 
Identifying codes | Hypercube | identifying codes | MATHEMATICS, APPLIED | hypercube | VERTICES | Computer Science | Operations Research | Discrete Mathematics
Journal Article
Computers & Industrial Engineering, ISSN 0360-8352, 01/2014, Volume 67, Issue 1, pp. 216 - 222
•We address a scheduling problem subject to an unavailability constraint.•We study an existing interchange heuristic to minimize the total-flow time.•We... 
Computational experiments | Heuristics | Scheduling | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | WEIGHTED FLOW-TIME | COMPLETION-TIME | SINGLE-MACHINE | APPROXIMATION ALGORITHM | MINIMIZE | SUM | ENGINEERING, INDUSTRIAL | Algorithms | Computer Science | Operations Research
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 10/2018, Volume 746, pp. 19 - 35
Octal games are a well-defined family of two-player games played on heaps of counters, in which the players remove alternately a certain number of counters... 
Combinatorial games | Graphs | Subtraction games | Octal games | COMPUTER SCIENCE, THEORY & METHODS | Mathematics | Combinatorics | Computer Science | Discrete Mathematics
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 07/2016, Volume 208, pp. 27 - 40
This paper deals with optimization problems on rotagraphs and fasciagraphs. These graphs are repetitive structures that generalize grids and toroidal grids,... 
Grids | Rotagraphs | Combinatorial optimization problems | Min-Plus algebra | Constant-time algorithm | Fasciagraphs | MATHEMATICS, APPLIED | INVARIANTS | INDEX | MATRIX PERIOD | Algorithms | Repetitive structures | Mathematical analysis | Constants | Graphs | Combinatorial analysis | Optimization | Computer Science | Operations Research | Discrete Mathematics
Journal Article
Designs, Codes and Cryptography, ISSN 0925-1022, 11/2013, Volume 69, Issue 2, pp. 181 - 188
... Kovše · Michel Mollard · Julien Moncel · Aline Parreau Received: 27 June 2011 / Revised: 15 February 2012 / Accepted: 16 February 2012 / Published online: 21 March... 
Information and Communication, Circuits | Total-domination | 05C78 | Data Encryption | Mathematics | Identifying codes | Sierpiński graphs | 94B25 | Data Structures, Cryptology and Information Theory | Discrete Mathematics in Computer Science | Coding and Information Theory | Locating-dominating codes | Combinatorics | 05C69 | Codes in graphs | Computer Science | Discrete Mathematics
Journal Article
Australasian Journal of Combinatorics, ISSN 1034-4942, 2008, Volume 41, pp. 81 - 91
Journal Article
Electronic Journal of Combinatorics, ISSN 1077-8926, 2011, Volume 18, Issue 1, pp. 1 - 13
Given a connected graph G = (V, E), Let r = 1 be an integer and B-r(v) denote the ball of radius r centered at v is an element of V, i.e., the set of all... 
MATHEMATICS | MATHEMATICS, APPLIED | CODES | LOCATION DETECTION
Journal Article
European Journal of Combinatorics, ISSN 0195-6698, 2006, Volume 27, Issue 5, pp. 767 - 776
In this paper we deal with identifying codes in cycles. We show that for all r ≥ 1 , any r -identifying code of the cycle C n has cardinality at least gcd ( 2... 
MATHEMATICS | Computer Science | Operations Research | Discrete Mathematics
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2007, Volume 307, Issue 9, pp. 1094 - 1107
In this paper we deal with codes identifying sets of vertices in random networks; that is, ( 1 , ⩽ ℓ ) -identifying codes. These codes enable us to detect sets... 
Random networks | Vertex-identifying codes | MATHEMATICS | random networks | vertex-identifying codes | COVER-FREE FAMILIES | Computer Science | Discrete Mathematics
Journal Article
Electronic Journal of Combinatorics, ISSN 1077-8926, 03/2005, Volume 12, Issue 1 R, pp. 1 - 9
In this paper the problem of constructing graphs having a (1, less than or equal to l)-identifying code of small cardinality is addressed. It is known that the... 
MATHEMATICS | MATHEMATICS, APPLIED | Computer Science | Operations Research | Discrete Mathematics
Journal Article
08/2017
In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are... 
Computer Science - Discrete Mathematics
Journal Article
Integers, ISSN 1553-1732, 2019, Volume 19, p. G3
The present paper deals with connected subtraction games in graphs, which are generalization of takeaway games. In a connected subtraction game, two players... 
Computer Science | Mathematics | Combinatorics | Discrete Mathematics
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 2004, Volume 319, Issue 1, pp. 411 - 421
An identifying code of a graph is a subset of vertices C such that the sets B( v)∩ C are all nonempty and different. In this paper, we investigate the problem... 
Identifying codes | Fasciagraphs | Graph theory | identifying codes | COMPUTER SCIENCE, THEORY & METHODS | fasciagraphs | graph theory
Journal Article
Computers & industrial engineering, ISSN 0360-8352, 01/2014, Volume 67, p. 216
  This paper deals with a scheduling problem on a single machine with an availability constraint. The problem is known to be NP-complete and admits several... 
Mathematical problems | Studies | Operations research | Algorithms | Approximations | Production scheduling | Heuristic
Journal Article
No results were found for your search.

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