output
20072023
most citedAcyclic edge-coloring using entropy compression

92 citations

Showing 2017Show all

7 papers · 1 filter

math.CO2017

On some Graphs with a Unique Perfect Matching

S. Chaplick, M. Fürst, F. Maffray +1

We show that deciding whether a given graph of size has a unique perfect matching as well as finding that matching, if it exists, can be done in time if is eithe…

stat.AP20171 cited

A study of variability induced by events dependency in microelectronic production

Kean Dequeant, Pierre Lemaire, Marie-Laure Espinouse +1

-Complex manufacturing systems are subject to high levels of variability that decrease productivity, increase cycle times and severely impact the systems tractability. As accurate…

q-fin.PR2017

Optimal firm's policy under lead time-and price-dependent demand: interest of customers rejection policy

Abduh Sayid, Yannick Frein, Ramzi Hammami

Considering a lead-time-and price-sensitive demand, we investigate whether a client rejection policy, modeled as M/M/1/K system, can be more profitable than an all-client acceptanc…

cs.DM20175 cited

Exact values for three domination-like problems in circular and infinite grid graphs of small height

Marwane Bouznif, Julien Darlay, Julien Moncel +1

In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are interested in finding the mi…

cs.DM20174 cited

Fleet management for autonomous vehicles: Online PDP under special constraints

Sahar Bsaybes, Alain Quilliot, Annegret K. Wagler

The VIPAFLEET project consists in developing models and algorithms for man- aging a fleet of Individual Public Autonomous Vehicles (VIPA). Hereby, we consider a fleet of cars distr…

math.CO2017

Equitable Colorings of -minor-free Graphs

Rémi De Joannis de Verclos, Jean-Sébastien Sereni

We demonstrate that for every positive integer , every K\_4-minor-free graph with maximum degree admits an equitable coloring with k colors wherek (+3)/2. This boun…