Sciweavers

5 search results - page 1 / 1
» A Combinatorial Characterization of Properties Preserved by ...
Sort
View
EUROPAR
2000
Springer
13 years 8 months ago
A Combinatorial Characterization of Properties Preserved by Antitokens
Balancing networks are highly distributed data structures used to solve multiprocessor synchronization problems. Typically, balancing networks are accessed by tokens, and the distr...
Costas Busch, Neophytos Demetriou, Maurice Herlihy...
ISAAC
2010
Springer
230views Algorithms» more  ISAAC 2010»
13 years 2 months ago
Seidel Minor, Permutation Graphs and Combinatorial Properties
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...
Vincent Limouzy
WINE
2007
Springer
171views Economy» more  WINE 2007»
13 years 10 months ago
Characterizing Truthful Market Design
This paper characterizes the family of truthful doublesided auctions. Despite the importance of double-sided auctions to market design, to date no characterization of truthful dou...
Mira Gonen, Rica Gonen, Elan Pavlov
JCT
2010
117views more  JCT 2010»
13 years 3 months ago
(2+2)-free posets, ascent sequences and pattern avoiding permutations
Abstract. We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2 + 2)-free posets and a certain class of involutions (or chord ...
Mireille Bousquet-Mélou, Anders Claesson, M...
EAAI
2007
154views more  EAAI 2007»
13 years 4 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
Ahlem Ben Hassine, Tu Bao Ho