[DMANET] Call for Papers - SPIRE 2010

CALL FOR PAPERS

SPIRE 2010
17th International Symposium on String Processing and Information Retrieval

October 11-13 2010

Los Cabos, Mexico

http://spire2010.natix.org

SUBMISSION DEADLINE: June 20 2010

INTRODUCTION
SPIRE 2010 is the 17th International Symposium on String Processing and
Information Retrieval. The first four editions of the conference focused
primarily on string processing and were held in South America under the
title of WSP (South American Workshop on String Processing). WSP was
transformed into SPIRE in 1998, when the scope of the conference was
broadened to include information retrieval. This was motivated by the
increasing relevance of information retrieval and its close inter-relationship
with string processing.
The last three SPIRE conference sites have been: Santiago, Chile (2007),
Melbourne, Australia (2008) and Saariselkä, Finland (2009).
The conference proceedings have been published in Springer's Lecture Notes
in Computer Science (LNCS) series since 2002. This tradition continues
also in 2010.

LOCATION

SPIRE 2010 will be co-organized by the School of Physics and Mathematics at
Universidad Michoacana, in Morelia, Mexico and the CICESE research center
in Ensenada, Mexico. The conference will take place at the premiere resort
area of Los Cabos, Mexico. With an incredible array of first-class resorts,
world class fishing, activities for the entire family and elegant dining
venues, Cabo San Lucas and San Jose del Cabo have much to offer. The
conference venue will be the Los Cabos Grand Faro Resort in San Jose del
Cabo.

TOPICS

SPIRE 2010 covers research in all aspects of string processing, information
retrieval, computational biology, pattern matching, semi-structured data,
and related applications. Typical topics of interest include (but are not
limited to):

** String Processing: Dictionary algorithms, Text searching,
Pattern matching, Text and sequence compression, Automata based string
processing.

** Information Retrieval: Information retrieval models, Indexing, Ranking
and filtering, Interface design, Visualization, Benchmarking.

** Natural language processing: Text analysis, Text mining, Machine
learning, Information extraction, Language models (both structural and
semantic), Knowledge representation.

** Search applications and usage: Cross-lingual information access systems,
Multimedia information access, Digital libraries, Collaborative retrieval
and Web related applications, Semi-structured data retrieval, Evaluation.

** Interaction of biology and computation: DNA sequencing and applications
in molecular biology, Evolution and phylogenetics, Recognition of genes and
regulatory elements, Sequence driven protein structure prediction.

** Efficient implementation of IR systems: Practical implementations with
strong experimental support, toolkits for IR systems. Algorithms and data
structures for IR.

SUBMISSION

SPIRE 2010 welcomes submissions varying from short 6-page papers up to
long 12-page papers. Submissions should be anonymous and formatted using
LNCS style. At least three reviewers will evaluate each paper based on its
originality, quality and significance of theoretical and/or practical
contribution, the validity and robustness of the methodology used, and the
overall contribution to understanding the context of the work. Any
paper may be accepted as a short or a long contribution; the former will
receive less time for presentations and fewer pages in the proceedings.

STUDENT SPONSORSHIP

Yahoo! Research has generously offered sponsorship for some student support
packages that cover SPIRE 2010 registration fees and provide partial
support for accommodation costs for volunteers. See the conference website
for more information.

INVITED SPEAKERS
SPIRE 2010 will feature invited lectures by

Gonzalo Navarro (U. Chile, Chile) and
Mark Najork (Microsoft Research)

WORKSHOPS
We are planning to host workshops on topics in both string processing and
information retrieval. The workshops will take place on October 14 2010,
the day after the main conference. More details will be posted on the
conference website.

PROGRAM COMMITTEE CO-CHAIRS

Edgar Chavez (U Michoacana/CICESE)
Stefano Lonardi (UC Riverside)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Three Postdocs at Oxford University

Postdoctoral Researcher

The Automated Formal Verification Group is advertising a post for a Grade 7 Research Assistant to work on the automated verification of concurrent programs that make use of shared memory under the direction of Daniel Kroening and Joël Ouaknine in the Oxford University Computing Laboratory.

Applicants should have (or shortly expect to receive) a PhD in Computer Science or a closely related field. The primary selection criteria are strong programming and systems skills, some experience of tool construction, and basic knowledge of program analysis. A background in theoretical computer science or mathematics is desirable. Candidates with prior experience with programming for the x86 memory model are especially encouraged to contact us, although this is by no means a necessary requirement.

The work will take place within the Verification group in the Oxford University Computing La bo ratory, which comprises, in addition to the two investigators, world-leading experts in software verification and model checking such as Marta Kwiatkowska, Tom Melham, Luke Ong, and Bill Roscoe. The posts will have a salary on the University grade 7 scale (currently £28,839 to £35,469 pa). The official ad for the post and instructions for applying can be found here:

http://www.comlab.ox.ac.uk/news/179-full.html

We expecting to advertise two additional posts for Postdocs to work on program analysis in the near future. We welcome any inquiries via e-mail to Daniel Kroening and Joël Ouaknine.

PhD Studentship

The Automated Formal Verification Group is offering a fully funded DPhil (Oxford's "PhD") position at Oxford University's Computing Laboratory. The position is associated with a project under the supervision of Daniel Kroening and Joël Ouaknine and will address the correctness of multi-threaded concurrent software. The studentship is fully funded (at EU fees level – overseas candidates will need supplementary funding) for 3½ years.

The studentship includes a stipend of at least £12,940 per year as well as provision for travel to conferences. Candidates must satisfy the usual requirements for studying for a doctorate at Oxford. The formal advertisement and instructions for applying are online at

http://www.comlab.ox.ac.uk/news/149-full.html.

[DMANET] ALGOSENSORS 2010 Deadline Extension

********************************************************************

ALGOSENSORS 2010 Call for Papers

6th International Workshop on Algorithms for Sensor Systems,
Wireless Ad Hoc Networks and Autonomous Mobile Entities

Bordeaux, France
July 5, 2010
http://www.algosensors.org

*********************************************************************

*** Due to several requests, the new submission deadline is May 5 ***

ALGOSENSORS 2010 is co-located with ICALP 2010.

Papers accepted to ALGOSENSORS will be published in the Springer LNCS
Series and the best papers also in the TCS Special Issue on ALGOSENSORS
2009/2010. Please note the broader scope of ALGOSENSORS 2010:

SCOPE:

The ALGOSENSORS workshop series aims to bring together research
contributions related to diverse algorithmic and complexity theoretic
aspects of wireless sensor networks. Starting with ALGOSENSORS 2010, we
also strongly encourage submissions about related types of networks
such as ad hoc wireless networks, mobile networks, radio networks and
distributed systems of robots. Topics include but are not limited to:

- Models for wireless networks
- Virtual infrastructures
- Infrastructure discovery
- Methods for ad-hoc deployment/topology control
- Data propagation and routing
- Data aggregation/data compression
- Error and erasure correcting codes for information dispersal
- Energy management
- Power saving schemes
- Communication protocols
- Medium access control
- Localization
- Tracking
- Fault tolerance and dependability
- Self-stabilization
- Adaptiveness and self-organization
- Game theoretic aspects
- Cryptography, security and trust
- Distributed computing issues
- Time synchronization
- Swarm computing
- Mobile robotic sensors
- Algorithms for RFID
- Obstacle avoidance

IMPORTANT DATES:

Submission deadline: May 5, 2010
Notification: June 7, 2010
Camera-ready copy: June 25, 2010

SUBMISSIONS:

Authors are invited to submit manuscripts reporting original research
on topics related to the workshop. Simultaneous submission to other
conferences is not allowed. Papers should not exceed twelve (12) pages
of text using at least 11 point size type, including references,
figures, tables, etc., preferably formatted in the LNCS style.
Additional material may be added at a clearly marked appendix to be
read at the discretion of the program committee members. Authors must
submit their papers electronically via Web page:
http://www.algosensors.org. All papers will be peer reviewed and
comments will be provided to the authors. Authors need to make sure
that for each accepted paper at least one author will attend the
workshop.

--------------------------------------------------------------------
Prof. Dr. Christian Scheideler Phone: +49-5251-606728
Institut für Informatik Fax: +49-5251-606697
Universität Paderborn Email: scheideler@upb.de
Fürstenallee 11
33102 Paderborn, Germany

http://wwwcs.uni-paderborn.de/cs/scheideler
--------------------------------------------------------------------

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

From Michael Saks: Call for participation: Barriers in Theoretical Computer Science II, August 26-30, 2010

The NSF-funded Center for Computational Intractability
(http://intractability.princeton.edu/) announces
the second in a series of workshops

Barriers in Theoretical Computer Science, in Princeton NJ, August 26-30, 2010.

http://intractability.princeton.edu/blog/2010/02/workshop-barriers-ii/

The workshop is open to any interested participant, but our capacity is
limited to about 150 participants. There will be no registration fee.
If you may be interested in attending, it would be very helpful
for you to respond as described later in this email by April 30.

The goal of this series is to identify important topics
and problems where our field seems to be "stuck" for a fundamental reason.
We hope that identifying and articulating these "barriers", and
disseminating knowledge about them to a large and diverse
audience will jump start research to remove or circumvent
these barriers. The first Barriers workshop was held in
August 2009.

As with the Barriers I, each day of Barriers II
will focus on one area of theoretical CS, but these foci will be different
than those in Barriers I. The planned topics and organizers for each day are:

Thursday August 26
Approximation Algorithms and Hardness of Approximation
Organizer: Moses Charikar

Friday August 27
Recent Advances and Challenges in Cryptography
Organizers: Shafi Goldwasser and Yuval Ishai

Saturday August 28
Quantum computation
Organizers: Scott Aaronson and Umesh Vazirani

Sunday August 29
Title: Communication and information in complexity
Organizer: Paul Beame

Monday August 30
Title: (Geo)metric algorithms
Organizer: Piotr Indyk

Please register on the web page:

http://intractability.princeton.edu/blog/2010/02/workshop-barriers-ii/

If you have suggestions or questions
concerning the specific topics, please write the topic committee
members directly.

Thank you,

The Barriers II organizing committee

Michael Saks (Chair)
Scott Aaronson
Sanjeev Arora
Paul Beame
Moses Charikar
Shafi Goldwasser
Piotr Indyk
Yuval Ishai
Robert Tarjan
Umesh Vazirani

[DMANET] ICE 2010: Call for short contributions and participation

[- Apologies for multiple copies -]

*** Call for short contributions & participation ***

3rd Interaction and Concurrency Experience
ICE 2010: Guaranteed Interactions

Satellite workshop of DisCoTec 2010
10th of June 2010
Amsterdam, The Netherlands

http://www.artist-embedded.org/artist/-ICE-10-.html

=== Highlights ===

- Invited talks by
Tom A. Henzinger (IST, Austria) and
Joost-Pieter Katoen (RWTH Aachen University, Germany)
- Travel grants for young researchers

=== Important Dates ===

- Submission of short contributions: 10 May 2010
- Notification to authors: 13 May 2010

=== Scope ===

Interaction and Concurrency Experiences (ICEs) is a series of
international scientific meetings oriented to theoretical
computer science researchers with special interest in models,
verification, tools and programming primitives for complex interactions.

The general scope is to include theoretical and applied aspects of
interactions and the synchronization mechanisms used among actors of
concurrent/distributed systems, but every experience will focus on a
different specific topic which affects several areas of computer science.

The theme of ICE'10 is ***Guaranteed Interactions***, like guaranteeing
safety, responsiveness, quality of service levels or satisfaction of
analysis hypotheses. In this context, coordination can be viewed as
imposing constraints on the interaction among the actors. Such constraints
and guarantees of their satisfaction play an important role in the
analysis of distributed systems. In order to provide such guarantees, a
number of directions are being explored to develop appropriate models,
methodologies and tools, like behavioural types, component-based model
checking, assume-guarantee and 'by construction' techniques such as glue
synthesis. Considering interaction as a first class entity is crucial for
overcoming complexity issues of distributed systems, such as state space
explosion.

Topics of interest include, but shall not be limited to:

- logic and types for interactions
- concurrent models and semantics
- techniques and tools for specification, analysis, verification of
guaranteed interaction
- programming primitives for interactions
- languages, protocols and mechanisms for sound coordination
- 'by construction' guarantees for interaction
- expressiveness results
- formal contract languages
- disciplined interactions inspired by emerging computational models
(systems biology, quantum computing, etc.)

=== Selection Procedure For Short Contributions ===

The workshop proposes an innovative paper selection mechanism based on an
interactive discussion amongst authors and PC members.

Selection of regular papers has been closed on April 30, after which
we decided to reserve some additional slots for presentation of
recent work in progress or visionary innovative ideas and approaches.

=== The Public Wiki ===

After the notification, the accepted papers will be published on a public
forum, the rationale being to initiate public discussions that will
trigger and stimulate the scientific debate of the workshop. We argue that
this will drive the workshop discussions and let perspective participants
to interact with each other well in advance with respect to the modus
operandi of more traditional events.

=== Submission Guidelines ===

Short papers must report previously unpublished work although
it is allowed that some extended versions are simultaneously
submitted to other conferences / workshops with proceedings.

Accepted short papers will be considered for inclusion in the
ICE'10 post-proceedings either in form of extended abstracts
or as full papers.

ICE'10 post-proceedings will be published in
Electronic Proceedings in Theoretical Computer Science
(http://eptcs.org/).

Submissions of short papers must be made electronically in PDF format
via EasyChair (http://www.easychair.org/conferences/?conf=ice2010)
and should not exceed 4 pages with EPTCS style (http://style.eptcs.org/).

Accepted short papers must be presented at the workshop by one of the authors.

=== Contact ===

Please write to <ice2010@di.unipi.it> for any additional information you
may need.

=== Previous editions ===

The previous two editions of ICE have been held in:
Reykjavik, Iceland, on July 6th, 2008, with focus on Synchronous and Asyn-
chronous Interactions in Concurrent/Distributed Systems, co-located with
ICALP08 (http://ice08.dimi.uniud.it/). The post proceedings were published
in ENTCS (vol.229-3).
Bologna, Italy, on August 31st, 2009, with focus on Structured Interactions,
co-located with CONCUR09 (http://ice09.dimi.uniud.it/). The post
proceedings were published in EPTCS (vol.12) and a special issue of MSCS is
now in preparation.

=== Sponsors ===

* CEA LIST (http://www-list.cea.fr)
* ArtistDesign network of excellence (http://www.artist-embedded.org)
* Institute for Programming research and Algorithmics (IPA - http://www2.win.tue.nl/ipa/)

.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Full Professor position in Discrete Mathematics

The Freie Universität Berlin invites applications for a tenured

Professorship in Discrete Mathematics (W3).

The successful applicant will be required to cover the area named above in
teaching and research. In accordance with article 100 of the Berlin Higher
Education Act (Berliner Hochschulgesetz), only applicants with substantial
academic or scientific accomplishments will be considered (i.e., junior
professors or individuals with equivalent forms of scholarly or practical
experience). The successful candidate will have an outstanding track
record of university teaching and internationally acclaimed research
activities in one or more fields within the greater research area of
discrete mathematics (including combinatorics, graph theory and
algorithms). She or he should have proven competence in one of the
application areas of the DFG Research Center MATHEON, as well as
experience acquiring funding for, and carrying out, sponsored research.
The appointee will represent the field of Discrete Mathematics and
Theoretical Computer Science at the Department and is therefore expected
to actively participate in the DFG Research Center MATHEON, the research
training group Methods for Discrete Structures, as well as the Berlin
Mathematical School. She or he is further required to assume
administrative tasks in the academic institutions concerned.

The language of instruction is mainly German, but some teaching may be
conducted in English. A non-German-speaking appointee will need to be able
to teach in German within a reasonable time frame.
The vacancy is a tenured position at the rank of W3. The successful
candidate will be appointed either as a civil servant or as a salaried
employee with comparable terms and conditions.
Freie Universität Berlin is an equal opportunity employer.

Applications quoting the reference Diskrete Mathematik must be received at
the address below by May, 27th 2010 and should include a cover letter
describing the applicant's interest in the position and relevant
experience; a curriculum vitae with three references; a list of
publications; and copies of the certificates of all academic degrees awarded.

Freie Universität Berlin
Fachbereich Mathematik und Informatik
Dekanat
Arnimallee 14
14195 Berlin, Germany

The Freie Universität Berlin is a public university with some 33,000
students and close to 450 professors or junior professors. It has 11
departments and schools structured into more than 70 institutes - not
counting the Charité medical center, which incorporates the medical
schools of both Freie Universität and Humboldt Universität. In 2007, the
findings of a government initiative to promote excellence in teaching and
research appraised Freie Universität Berlin as one of the nation's leading
institutions of higher education. Detailed information is available at
www.fu-berlin.de, www.math.fu-berlin.de and www.matheon.de.

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Schedule: 10th Haifa Graph Workshop (23-24 May) and Memorial for Uri N. Peled

10th Haifa Workshop on Interdisciplinary Applications of Graph Theory,
Combinatorics and Algorithms
In memory of Uri Natan Peled, ?"?
Caesarea Rothschild Institute, University of Haifa
May 23-25, 2010, Haifa (Israel)

Location: May 23 morning, 570 Education Building
May 23 afternoon, Safdie Auditorium, Multi-purpose Building
May 24 all day, 570 Education Building
May 25 excursion


Program:

Sunday May 23, 2010
9:00 Registration, Tea and Coffee
9:15 Greetings
9:30 Seffi Naor (Technion, Israel)
"Online Algorithms, Linear Programming, and the k-Server Problem"
10:15 break
10:30--11:45 Sessions 1 and 2

Session 1
10:30--10:55 Mark Korenblit (Holon Institute of Technology, Israel)
"The decomposition method for generating algebraic expressions of square rhomboids"
10:55--11:20 Nathan Keller (Hebrew University, Israel)
"A tight quantitative version of Arrow's impossibility theorem"
11:20--11:45 Yefim Dinitz (Ben-Gurion University, Israel)
"Hybrid Bellman-Ford-Dijkstra algorithm"

Session 2
10:30--10:55 Shiri Chechik (Weizmann Institute, Israel)
"Forbidden-Set distance labels for graphs of bounded doubling dimension"
10:55--11:20 Oren Ben-Zwi (University of Haifa, Israel)
"A hat trick"
11:20--11:45 Rami Puzis (Ben-Gurion University, Israel)
"Expressing centrality in terms of routing betweeness"

11:45 break
12:00--12:50 Sessions 3 and 4

Session 3
12:00--12:25 Noam Goldberg (Technion, Israel)
"Sparse weighted voting classifier selection and its LP relaxation"
12:25--12:50 Eugene Levener (Holon Institute of Technology and
Bar-Ilan University, Israel)
"A fully polynomial algorithm for a cyclic scheduling problem on
graphs with interval data"

Session 4
12:00--12:25 Yuval Emek (Tel-Aviv University, Israel)
"Sparse reliable graph backbones"
12:25--12:50 Michael Borokhovich (Ben-Gurion University, Israel)
"Tight bounds for algebraic gossip on graphs"

12:50 Lunch -- Caesarea Rothschild Institute, 6th floor

Remembering Uri N. Peled

Safdie Auditorium, Multipurpose Building, University of Haifa

14:00--15:30 Mathematical Lectures

14:00 Bill Cunningham (University of Waterloo, Canada)
"Split decomposition"
14:45 Gyorgy Turan (University of Illinois at Chicago and University of Szeged)
"Horn formulas - a survey of recent results"

15:30 Reception

16:00--18:15 Memorial Session and General Lectures
chairs: Martin Golumbic and Dan Peled

- Messages from friends and family; the Mathematics of Uri N. Peled

- General Lectures:

Hon. Zvi Tal (former Justice of the Supreme Court, Israel) (uncle)
"Reflections on Human Dignity" (in Hebrew)

Jonathan (Tsoni) Peled (Albert Einstein College of Medicine, Yeshiva University, USA) (son)
"Studies on Lymphoma Tumors of Mice as a Model for Human Non-Hodgkin's Lymphoma"

Elana Zion-Golumbic (Columbia University Medical Center,
and Nathan Kline Institute for Psychiatric Research, USA) (family friend)
"Selective attention at a cocktail party: Insights from intracranial EEG in humans"

The three general lectures will be for non-specialists,
reflecting the broad interests of Uri Peled, z"l
and his love for family, friends, science and the humanities.


Monday, May 24, 2010

9:00 Registration, Tea and Coffee
9:30 Ronitt Rubinfeld (Tel-Aviv University, Israel and MIT, USA)
"Maintaining a large matching or a small vertex cover"

10:15 break
10:30--11:45 Sessions 5 and 6

Session 5
10:30--10:55 Yahav Nussbaum (Tel-Aviv University, Israel)
"Linear-time recognition of probe interval graphs"
10:55--11:20 George Mertzios (Technion, Israel)
"Recent results on tolerance graphs and related classes"
11:20--11:45 Eliah Ninyo (University of Haifa, Israel)
"Characterization of alternately orientable graphs that are weakly-chordal"
Session 6
10:30--10:55 Tomer Kotek (Technion, Israel)
"A representation theorem for holonomic sequences"
10:55--11:20 Alexander Zadorojniy
"A new pivoting rule for the simplex algorithm"
11:20--11:45 Yona Cherniavsky (Ariel University Center of Samaria, Israel)
"Weighted Coxeter graphs, geometric representation and generalized numbers game"

11:45 break

12:00 Fedor Fomin (University of Bergen, Norway)
"Kernelization"

12:50 Lunch -- Caesarea Rothschild Institute, 6th floor

14:00 Alek Vainstein (University of Haifa, Israel)
"Geometry of planar directed trivalent networks"
14:45 Michael Elkin (Ben-Gurion University, Israel)
"Distributed deterministic graph coloring"

15:30 break

15:45--17:00 Sessions 7 and 8

Session 7
15:45--16:10 Bryce Zimny (University of Toronto, Canada)
"On sum coloring for restricted families of graphs"
16:10--16:35 Panagiotis Cheilaris (Ben-Gurion University, Israel)
"Graph unique-maximum and conflict-free colorings"
16:35--17:00 Moti Medina (Tel-Aviv University, Israel)
"An O(log n)-competitive online centralized randomized packet-routing
algorithms for lines"

Session 8
15:45--16:10 David Tankus (Ariel University Center of Samaria, Israel)
"Well-covered graphs without C4, C6 and C7"
16:10--16:35 Yulia Kempner (Holon Institute of Technology, Israel)
"Poly-dimension of antimatroids"
16:35--17:00 Vadim Levit (Ariel University Center of Samaria, Israel)
"On the independence polynomial of a threshold graph"

17:00 break

17:10--18:30 Sessions 9 and 10

Session 9
17:10--17:35 Irith Ben-Arroyo Hartman (Int'l. Institute for
Information Technology, Bangalore, India)
"Contractors' minimum spanning tree"
17:35--18:00 Eyal Ackerman (University of Haifa at Oranim, Israel)
"On the number of edges in graphs with orthogonal crossings"

Session 10
17:10--17:35 Yelena Yuditsky (Ben-Gurion University, Israel)
"Polychromatic coloring for half-planes"
17:35--18:00 Amir Sapir (Sapir College, Israel)
"Which multi-peg tower of hanoi problems are exponential?"
18:00--18:30 Oren Weimann (Weizmann Institute, Israel)
"Replacement paths via fast matrix multiplication"

19:00 dinner

Tuesday May 25, 2010

9:30-12:00 Informal scientific discussions
12:00- 17:00 Excursion
The Caesarea Rothschild Institute at the University of Haifa
invites you to participate in our workshop:

--------------------------------------------------------------------
10th Haifa Workshop on Interdisciplinary Applications of
Graph Theory, Combinatorics and Algorithms

Dedicated in Memory of Uri N. Peled, z"l

Sunday-Monday, May 23-24, 2010

Registration at: http://www.cri.haifa.ac.il
Program and Schedule below

INVITED SPEAKERS:

Bill Cunningham (University of Waterloo, Canada)
Michael Elkin (Ben-Gurion University, Israel)
Fedor Fomin (University of Bergen, Norway)
Seffi Naor (Technion, Israel)
Ronitt Rubinfeld (Tel-Aviv University, Israel)
Gyorgy Turan (University of Illinois / Chicago, USA)
Alek Vainshtein (University of Haifa, Israel)

PROGRAM AND SCHEDULE

10th Haifa Workshop on Interdisciplinary Applications of Graph Theory,
Combinatorics and Algorithms
In memory of Uri Natan Peled, ?"?
Caesarea Rothschild Institute, University of Haifa
May 23-25, 2010, Haifa (Israel)

Location: May 23 morning, 570 Education Building
May 23 afternoon, Safdie Auditorium, Multi-purpose Building
May 24 all day, 570 Education Building
May 25 excursion

Program:

Sunday May 23, 2010
9:00 Registration, Tea and Coffee
9:15 Greetings
9:30 Seffi Naor (Technion, Israel)
"Online Algorithms, Linear Programming, and the k-Server Problem"
10:15 break
10:30--11:45 Sessions 1 and 2

Session 1
10:30--10:55 Mark Korenblit (Holon Institute of Technology, Israel)
"The decomposition method for generating algebraic expressions of square rhomboids"
10:55--11:20 Nathan Keller (Hebrew University, Israel)
"A tight quantitative version of Arrow's impossibility theorem"
11:20--11:45 Yefim Dinitz (Ben-Gurion University, Israel)
"Hybrid Bellman-Ford-Dijkstra algorithm"

Session 2
10:30--10:55 Shiri Chechik (Weizmann Institute, Israel)
"Forbidden-Set distance labels for graphs of bounded doubling dimension"
10:55--11:20 Oren Ben-Zwi (University of Haifa, Israel)
"A hat trick"
11:20--11:45 Rami Puzis (Ben-Gurion University, Israel)
"Expressing centrality in terms of routing betweeness"

11:45 break
12:00--12:50 Sessions 3 and 4

Session 3
12:00--12:25 Noam Goldberg (Technion, Israel)
"Sparse weighted voting classifier selection and its LP relaxation"
12:25--12:50 Eugene Levener (Holon Institute of Technology and
Bar-Ilan University, Israel)
"A fully polynomial algorithm for a cyclic scheduling problem on
graphs with interval data"

Session 4
12:00--12:25 Yuval Emek (Tel-Aviv University, Israel)
"Sparse reliable graph backbones"
12:25--12:50 Michael Borokhovich (Ben-Gurion University, Israel)
"Tight bounds for algebraic gossip on graphs"

12:50 Lunch -- Caesarea Rothschild Institute, 6th floor

Remembering Uri N. Peled

Safdie Auditorium, Multipurpose Building, University of Haifa

14:00--15:30 Mathematical Lectures

14:00 Bill Cunningham (University of Waterloo, Canada)
"Split decomposition"
14:45 Gyorgy Turan (University of Illinois at Chicago and University of Szeged)
"Horn formulas - a survey of recent results"

15:30 Reception

16:00--18:15 Memorial Session and General Lectures
chairs: Martin Golumbic and Dan Peled

- Messages from friends and family; the Mathematics of Uri N. Peled

- General Lectures:

Hon. Zvi Tal (former Justice of the Supreme Court, Israel) (uncle)
"Reflections on Human Dignity" (in Hebrew)

Jonathan (Tsoni) Peled (Albert Einstein College of Medicine, Yeshiva University, USA) (son)
"Studies on Lymphoma Tumors of Mice as a Model for Human Non-Hodgkin's Lymphoma"

Elana Zion-Golumbic (Columbia University Medical Center,
and Nathan Kline Institute for Psychiatric Research, USA) (family friend)
"Selective attention at a cocktail party: Insights from intracranial EEG in humans"

The three general lectures will be for non-specialists,
reflecting the broad interests of Uri Peled, z"l
and his love for family, friends, science and the humanities.

Monday, May 24, 2010

9:00 Registration, Tea and Coffee
9:30 Ronitt Rubinfeld (Tel-Aviv University, Israel and MIT, USA)
"Maintaining a large matching or a small vertex cover"

10:15 break
10:30--11:45 Sessions 5 and 6

Session 5
10:30--10:55 Yahav Nussbaum (Tel-Aviv University, Israel)
"Linear-time recognition of probe interval graphs"
10:55--11:20 George Mertzios (Technion, Israel)
"Recent results on tolerance graphs and related classes"
11:20--11:45 Eliah Ninyo (University of Haifa, Israel)
"Characterization of alternately orientable graphs that are weakly-chordal"
Session 6
10:30--10:55 Tomer Kotek (Technion, Israel)
"A representation theorem for holonomic sequences"
10:55--11:20 Alexander Zadorojniy
"A new pivoting rule for the simplex algorithm"
11:20--11:45 Yona Cherniavsky (Ariel University Center of Samaria, Israel)
"Weighted Coxeter graphs, geometric representation and generalized numbers game"

11:45 break

12:00 Fedor Fomin (University of Bergen, Norway)
"Kernelization"

12:50 Lunch -- Caesarea Rothschild Institute, 6th floor

14:00 Alek Vainstein (University of Haifa, Israel)
"Geometry of planar directed trivalent networks"
14:45 Michael Elkin (Ben-Gurion University, Israel)
"Distributed deterministic graph coloring"

15:30 break

15:45--17:00 Sessions 7 and 8

Session 7
15:45--16:10 Bryce Zimny (University of Toronto, Canada)
"On sum coloring for restricted families of graphs"
16:10--16:35 Panagiotis Cheilaris (Ben-Gurion University, Israel)
"Graph unique-maximum and conflict-free colorings"
16:35--17:00 Moti Medina (Tel-Aviv University, Israel)
"An O(log n)-competitive online centralized randomized packet-routing
algorithms for lines"

Session 8
15:45--16:10 David Tankus (Ariel University Center of Samaria, Israel)
"Well-covered graphs without C4, C6 and C7"
16:10--16:35 Yulia Kempner (Holon Institute of Technology, Israel)
"Poly-dimension of antimatroids"
16:35--17:00 Vadim Levit (Ariel University Center of Samaria, Israel)
"On the independence polynomial of a threshold graph"

17:00 break

17:10--18:30 Sessions 9 and 10

Session 9
17:10--17:35 Irith Ben-Arroyo Hartman (Int'l. Institute for
Information Technology, Bangalore, India)
"Contractors' minimum spanning tree"
17:35--18:00 Eyal Ackerman (University of Haifa at Oranim, Israel)
"On the number of edges in graphs with orthogonal crossings"

Session 10
17:10--17:35 Yelena Yuditsky (Ben-Gurion University, Israel)
"Polychromatic coloring for half-planes"
17:35--18:00 Amir Sapir (Sapir College, Israel)
"Which multi-peg tower of hanoi problems are exponential?"
18:00--18:30 Oren Weimann (Weizmann Institute, Israel)
"Replacement paths via fast matrix multiplication"

19:00 dinner

Tuesday May 25, 2010

9:30-12:00 Informal scientific discussions
12:00- 17:00 Excursion

----------------------------

REGISTRATION

There is no registration fee -- but please register in advance
in order that we may provide sufficient refreshments.

On-line at: http://www.cri.haifa.ac.il
Follow the links to the workshop registration page
Telephone: 04-828-8337

The Workshop is open to the public.

CfPart: Petri net course

This year the Petri net conference (PETRI NETS 2010) and the ACSD 2010
are joined conferences (http://acsd-petrinets2010.di.uminho.pt).

Besides the invited speakers, affiliated workshops, and tutorials, we
offer a new 3 day long course on Petri Nets.

This new course is especially interesting for graduate and PhD
students, but also to anybody interested on a complete introduction to
Petri nets taught by some of the top experts in the field. For
participating in the entire course including the examinations, three
credit points (ects) will be given from Leiden University (The
Netherlands).

All the relevant information can be found on the addresses below.
--------------------------------
Petri Net Course
(http://acsd-petrinets2010.di.uminho.pt/?page=PetriNetCourse)

June 20-22, 2010

Venue: Sentir Falperra Hotel, Braga, Minho, Portugal
(http://acsd-petrinets2010.di.uminho.pt/?page=VisitorInfo)

Registration: http://acsd-petrinets2010.di.uminho.pt/?page=Registration
--------------------------------

Joao Paulo Barros
Publicity chair

ICDT 2011 Call For Papers

----------------------------------------------------------
Apologies if you received multiple copies of this posting.
----------------------------------------------------------

*** FIRST CALL FOR PAPERS ***

The 14th International Conference on Database Theory (ICDT 2011)
Joint conference with EDBT 2011
March 21-24, 2011, Uppsala, Sweden

* The series of ICDT conferences provides an international forum for
the communication of research advances on the theoretical foundations
of database systems. Originally biennial, the conference is now held
annually and jointly with EDBT. Now for the 14th edition, we again
call for original research papers that provide new insights in the
specification, design, or implementation of data management tools.

* ICDT 2011 - Important Dates (Tentative):

- Paper submission deadline . . . August 14, 2010
- Notification . . . . . . . . . November 3, 2010
- Conference . . . . . . . . . . March 21-24, 2011

* ICDT 2011 covers a broad range of topics. We welcome papers on
topics including, but not limited to, the following:

- Access methods and physical design
- Active databases
- Complexity and performance
- Constraint databases
- Data exchange, data integration and interoperability
- Data mining
- Data models
- Data streams
- Database programming and query languages
- Databases and information retrieval
- Probabilistic Databases
- Databases and workflow
- Databases and the Semantic Web
- Databases in e-commerce
- Databases in e-services
- Deductive databases and knowledge bases
- Distributed databases
- Integrity, security, and privacy
- Logic and databases
- Multimedia databases
- Query optimization
- Query processing
- Real-time databases
- Semi-structured, XML, and Web data
- Spatial data
- Temporal data
- Concurrency and recovery
- Transaction management
- Views and data warehousing

* Submissions guidelines:

Paper submission will be electronic. All formatting for final publication
should follow ACM guidelines.
Authors are required to submit a paper title and short abstract (about
100 words) before submitting the paper.

The length of a submission should not exceed 12 pages in ACM
double-column format.

If the authors believe more details are necessary to substantiate the
main claims of the paper, they may also include a clearly marked appendix
to be read at the discretion of the committee. Papers not conforming to
these requirements may be rejected without further consideration.

The results must be unpublished and not submitted for publication elsewhere,
including the formal proceedings of other symposia or workshops. All authors
of accepted papers will be expected to sign copyright release forms. One
author of each accepted paper will be expected to present it at the
conference.
The proceedings will appear in the ACM International Conference
Proceedings Series.

Best Paper/Student/Newcomer Awards: An award will be given to the best
paper. Also, an award will be given to the best paper written by newcomers
to the field of database theory. The latter award will preferentially
be given to a paper
written only by students; in that case the award will be called "Best
Student Paper Award". The program committee reserves the following rights:
not to give an award; to split an award among several papers; and to
define the
notion of a newcomer. Papers authored or co-authored by Program Committee
members are not eligible for an award.

* Program Chair:

- Tova Milo (Tel Aviv University)

* Program Committee:

- Foto Afrati (National Technical Universtity of Athens)
- Diego Calvanese (Free University of Bozen-Bolzano)
- Andrea Cali (University of Oxford)
- Sara Cohen (Hebrew University of Jerusalem)
- Edith Cohen (AT&T)
- Graham Cormode (AT&T)
- Rada Chirkova (North Carolina State University)
- Alin Deutsch (UC San Diego)
- Wenfei Fan (University of Edinburgh)
- Todd J. Green (UC Davis)
- Tova Milo (Tel Aviv University - PC Chair)
- Kobbi Nissim (Ben-Gurion University and Microsoft AI, Israel)
- Frank Neven (Hasselt University)
- Antonella Poggi (Università di Roma "La Sapienza")
- Ken Ross (Columbia University)
- Marie-Christine Rousset (University of Grenoble)
- Nicole Schweikardt (Goethe-University in Frankfurt/Main)
- Pierre Senellart (Télécom ParisTech)
- Cristina Sirangelo (ENS Cachan)
- Jianwen Su (UC Santa Barbara)
- Wang-Chiew Tan (IBM Research - Almaden)

[DMANET] Call for Papers - Workshop on Systems to Build Systems

[Please circulate to all those who might be interested, and accept our
apologies if you received multiple copies of this announcement]
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Call for Extended Abstracts

Workshop on Systems to Build Systems

July 18, 2010, Barcelona, SPAIN
As a part of
2010 IEEE World Congress on Computational Intelligence
http://www.wcci2010.org/

Deadline: June 7, 2010

Instructions for authors:
The Organising Committee invites you to submit your extended abstract in PDF
format to hhsubmit@lancs-initiative.ac.uk by the deadline June 7, 2010. The
extended abstract should not be longer than 2 pages or 1000 words (with
references included). The authors of the selected papers after the
presentations will be invited to submit their extended work for peer review
and possible publication in the

Special Issue of the Journal of Operational Research Society on Systems to
Build Systems

Organisers:
Prof Edmund Burke
Dr Ender Ozcan
Dr Jonathan Thompson

Purpose, aims and objectives:
The current state of the art in the development of search methodologies is
focused around the human design of bespoke systems, which are specifically
tailored to the problem solving environment in hand. A particularly
challenging goal is to develop intelligent systems which are capable of
automatically building (and/or selecting) new systems. A paradigm shift has
emerged in search methodologies over the past few years. Instead of taking
the short term approach of dealing with single problems, there is a growing
body of work that aims to raise the level of generality by adopting the long
term approach of providing a more broadly applicable solution. These types
of "systems to build systems" have the potential to significantly reduce the
resource cost that is often associated with developing bespoke systems,
since the search process is automated through adaptation/learning.

The main purpose of the workshop is to bring researchers and practitioners
together from the computer science, artificial intelligence and operational
research fields, in order to discuss new ideas, recent advances,
methodologies, frameworks, challenges and opportunities within the context
of systems to build systems.

Topics on the systems to build systems (e.g. hyper-heuristics) include (but
not limited to):
- new methodologies to build (and/or select) systems
- automated (computer aided) design of heuristics (e.g., by genetic
programming, grammatical evolution, etc.)
- adaptive and self-tuning methodologies to build systems (e.g. evolutionary
algorithms, multi-meme algorithms, adaptive operator selection, dynamic
algorithm portfolios, reactive search, and others)
- machine learning techniques to support/build systems (e.g. learning
classifier systems, data mining, reinforcement learning, neural networks,
and others)
- fuzzy systems to build systems
- applications and new challenging domains, particularly real-world problems
- foundational studies towards the understanding of systems to build systems
- classifications or categorisations of methodologies
- generality of the methodologies to build systems
- scalability issues
- issues in multi-objective, discrete and continuous methodologies to build
systems
- issues in comparison of systems to build systems over multiple problem
domains

Invited speakers:
- Prof Graham Kendall, University of Nottingham
"Hyper-heuristics: Past, Present and Future"

- Prof Erwin Pesch, University of Siegen
"Metaheuristics: New Perspectives and Real Applications"

Important dates:
- Submission: June 7, 2010
- Notification of acceptance: June 15, 2010
- Workshop: July 18, 2010

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] JELIA 2010 Final Call for Papers

*** Apologies for receiving multiple copies ***

JELIA 2010 FINAL CALL FOR PAPERS

12th European Conference on Logics in Artificial Intelligence
Helsinki, Finland, September 13-15, 2010
http://jelia2010.tkk.fi/

Logics provide a formal basis and key descriptive notation for the study
and development of applications and systems in Artificial Intelligence
(AI). With the depth and maturity of formalisms, methodologies, and
systems today, such logics are increasingly important. The European
Conference on Logics in Artificial Intelligence (or Journees
Europeennes sur la Logique en Intelligence Artificielle --- JELIA)
began back in 1988, as a workshop, in response to the need for a European
forum for the discussion of emerging work in this field. Since then,
JELIA has been organised biennially, with English as the official language,
and with proceedings published in Springer-Verlag's Lecture Notes in Artificial
Intelligence series. In 2010 the conference is organized for the first
time in Scandinavia, following previous meetings mainly taking place in
Central and Southern Europe (see the general website http://www.jelia.eu/
for details). The increasing interest in this forum, its international
level with growing participation from researchers outside Europe, and the
overall technical quality, has turned JELIA into a major biennial forum
for the discussion of logic-based approaches to AI.

Aims and Scope

The aim of JELIA 2010 is to bring together active researchers interested
in all aspects concerning the use of logics in Artificial Intelligence to
discuss current research, results, problems, and applications of both
theoretical and practical nature. JELIA strives to foster links and
facilitate cross-fertilisation of ideas among researchers from various
disciplines, among researchers from academia and industry, and between
theoreticians and practitioners.

Authors are invited to submit papers presenting original and unpublished
research in all areas related to the use of logics in Artificial
Intelligence including:

-- Abductive and inductive reasoning
-- Answer set programming
-- Applications and foundations of logic-based AI systems
-- Argumentation systems
-- Automated reasoning including satisfiability checking and its extensions
-- Computational complexity and expressiveness
-- Description logics and other logical approaches to
semantic web and ontologies
-- Hybrid reasoning systems
-- Knowledge representation, reasoning, and compilation
-- Logic programming and constraint programming
-- Logics for uncertain and probabilistic reasoning
-- Logics in machine learning
-- Logics in multi-agent systems, games, and social choice
-- Non-classical such as modal, temporal, spatial,
paraconsistent, and hybrid logics
-- Nonmonotonic reasoning, belief revision, and updates
-- Planning and diagnosis based on logic
-- Preferences
-- Reasoning about actions and causality

Important Dates

* Deadline for abstract submission: May 3, 2010
* Deadline for paper submission: May 7, 2010
* Notification of acceptance: June 11, 2010
* Camera ready copy: June 30, 2010

Paper Submission

Proceedings will be published by Springer-Verlag in the Lecture Notes on
Artificial Intelligence series. Papers should be written in English, and
should be formatted according to the standard Springer LNCS style. All
submissions must be received by 23:59 GMT on May 3, 2010 (abstract) and
May 7, 2010 (full paper), and should be electronically submitted via the
link available on the JELIA 2010 web page.

There are two categories for submissions:

A. Regular papers
Submissions should not exceed 13 pages including figures, references,
etc., and should contain original research, and sufficient detail to assess
the merits and relevance of the contribution. Submissions must not have
been previously published or be simultaneously submitted for publication
elsewhere.

B. System descriptions
Submissions should not exceed 4 pages, and should describe an implemented
system and its application area(s). A demonstration is expected to
accompany a system presentation. Papers describing systems that have
already been presented in JELIA before will be accepted only if significant
and clear enhancements to the system are reported and implemented.

Venue

The conference will be held in the main building of University of
Helsinki, located in the center of Helsinki. Founded in 1550, Helsinki has
been the Finnish capital since 1812, when it was rebuilt in the Empire
style by the orders of the Czar of Russia, hence sharing architectural
similarities with St. Petersburg even today. Located on the Baltic
peninsula centrally between the east and the west, Helsinki "the Daughter
of the Baltic" is a city full of contrasts: light and white in summer
while dark but full of warmth in winter, with a combination of high-tech,
contemporary design, and ever-present nature. Finnish design has made
Helsinki world famous, and recently Helsinki was appointed World Design
Capital 2012.

Invited Speakers

Gerhard Brewka, University of Leipzig, Germany
http://www.informatik.uni-leipzig.de/~brewka/

Adnan Darwiche, UCLA, USA
http://www.cs.ucla.edu/~darwiche/

Stephane Demri, CNRS, France
http://www.lsv.ens-cachan.fr/~demri/

Programme Co-Chairs

Tomi Janhunen, Aalto University School of Science and Technology, Finland
http://www.tcs.hut.fi/~ttj/

Ilkka Niemelä, Aalto University School of Science and Technology, Finland
http://www.tcs.hut.fi/~ini/

Further Information

Conference web page: http://jelia2010.tkk.fi/

Co-located events

European Workshop on Probabilistic Graphical Models (PGM)
http://www.helsinki.fi/pgm2010/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

CI Fellows Call for Applicants

The Computing Community Consortium (CCC) and the Computing Research Association (CRA), with anticipated funding from the National Science Foundation, are pleased to announce a new call for Computing Innovation Fellows (CIFellows) for the 2010-11 academic year.  The CIFellows Project is an opportunity for new Ph.D. graduates in computer science and closely related fields to obtain one- to two-year positions at universities, industrial research laboratories, and other organizations that advance the field of computing and its positive impact on society.  The goals of the CIFellows Project are to retain new Ph.D.s in research and teaching during challenging economic times, and to support intellectual renewal and diversity in computing fields at U.S. organizations.

This call follows a highly successful inaugural class of CIFellows for the 2009-10 academic year, in which 60 Ph.D. graduates are completing outstanding research and teaching enrichment experiences.  Six of these 2009-10 CIFellows have already received faculty appointments in part as a result of their CIFellowships, and many others are continuing in the program for a second year.

The CIFellows Project seeks to fund around 40 new positions starting during the 2010-11 academic year.  Applications are due very soon:  5 p.m. EDT on May 23, 2010.  Awards are expected to be announced by July 1, 2010.  Positions will commence in the fall.

Applications will be received beginning May 3, 2010, at http://cifellows.org.

Also:  Go to http://cifellows.org to advertise your interest in hosting a CIFellow at your organization.

Individuals who received (or will receive) Ph.D.s from U.S. institutions between May 1, 2009 and August 31, 2010 in computer science, computer engineering, information science, or a closely related field are eligible to apply.  Applicants must obtain commitments—including mentoring plans—from between one and three prospective hosts/mentors.  Hosts/mentors cannot be at the same institution as the one granting the Ph.D.  The CIFellows website (linked above) provides resources for both prospective applicants and host/mentors to announce their interests and availability.

- Greg Andrews, Chair of the CIFellows Steering Committee
- Ed Lazowska, Chair of the Computing Community Consortium Council
- Eric Grimson, Chair of the Computing Research Association
- Erwin Gianchandani, Director of the Computing Community Consortium & the CIFellows Project

MAMA 2010: Final Call for Abstracts (May 3 deadline)

[Apologies for cross-postings]

     CALL FOR ABSTRACTS  --  CALL FOR ABSTRACTS  --  CALL FOR ABSTRACTS


MAMA 2010
The Twelfth Workshop on MAthematical performance Modeling and Analysis
Held in conjunction with SIGMETRICS 2010
June 18th, 2010  -  Columbia University, New York, NY, USA

Sponsored by ACM SIGMETRICS
http://www.sigmetrics.org/sigmetrics2010/mama10cfa.shtml


The complexity of computer systems, networks and applications, as well
as the advancements in computer technology, continue to grow at a rapid
pace. Mathematical analysis, modeling and optimization are playing an
important role in research studies to investigate fundamental issues and
tradeoffs at the core of performance problems in the design and
implementation of complex computer systems, networks and applications.

The Twelfth Workshop on MAthematical performance Modeling and Analysis
(MAMA 2010) seeks to bring together researchers working on the
mathematical, methodological and theoretical aspects of performance
analysis, modeling and optimization.  It is intended to provide a forum
at SIGMETRICS conferences for talks on early research in the more
mathematical areas of computer performance analysis.  These talks tend
to be based on very recent research results (including work in progress)
or on new research results that will be otherwise submitted only to a
journal (or recently have been submitted to a journal).  Thus, part of
the goal is to complement and supplement the SIGMETRICS Conference
program with such talks without removing any theoretical contributions
from the main technical program.

This year's workshop will be held on June 18 (the day after the main
SIGMETRICS technical program). In addition to the presentation of
extended abstracts, the workshop will include time for informal
technical discussions among the speakers and attendees.

Note also that the 17th Applied Probability Day (APD) at Columbia
University will be held on the following day, June 19, 2010:
http://www.cap.columbia.edu/announcements/APD_June_2010/index.html


SUBMISSION INFORMATION

Abstract Submission Deadline:        May  3, 2010
Acceptance Notification:             May 18, 2010
Final Abstracts for Workshop:        May 25, 2010
MAMA Workshop:                       Jun 18, 2010
Final PER Extended Abstracts:        Aug 31, 2010

MAMA 2010 encourages the submission of abstracts describing early
research on the general mathematical, methodological and theoretical
aspects of performance analysis, modeling and optimization.  Authors are
asked to submit 2-3 page abstracts, using the standard ACM format (refer
to http://www.acm.org/sigs/publications/proceedings-templates), before
the above deadline.  Submissions violating these formatting guidelines
will be returned without review.  Abstracts should be submitted
electronically, as an e-mail attachment, to mss((at))watson.ibm.com.
Postscript or PDF is preferred, although other arrangements can be made
by contacting Mark Squillante (mss((at))watson.ibm.com).

Submissions will be reviewed by the MAMA program committee, from which a
number of abstracts will be selected for inclusion in the workshop
program. A version of the accepted abstracts will be provided at the
workshop. Revised versions of these abstracts will be published in a
special issue of Performance Evaluation Review (PER), with a due date
after the workshop making it possible for authors to incorporate the
results of, or simply mention, any relevant discussions at the workshop.
Authors of accepted abstracts grant ACM permission to publish them in
print and digital formats.  Note that there are no copyright issues with
PER, and thus authors retain the copyright of their work with complete
freedom to submit their work elsewhere.


TECHNICAL PROGRAM COMMITTEE

Yuliy Baryshnikov, Bell Laboratories
Sem Borst, Bell Laboratories, Eindhoven University of Technology
C.S. Chang, National Tsing Hua University
Ed Coffman, Columbia University
Jim Dai, Georgia Institute of Technology
Edmundo de Souza e Silva, Federal University of Rio de Janeiro
Ton Dieker, Georgia Institute of Technology
Nick Duffield, AT&T Labs Research
Derek Eager, University of Saskatchewan

David Gamarnik, MIT
Ayalvadi Ganesh, University of Bristol
Leana Golubchik, University of Southern California
Pete Harrison, Imperial College
Alain Jean-Marie, University of Montpellier, INRIA
Frank Kelly, University of Cambridge
Guy Latouche, Universite Libre de Bruxelles
Zhen Liu, Nokia Research Center
Yingdong Lu, IBM T.J. Watson Research Center
John Lui, The Chinese University of Hong Kong
Michel Mandjes, CWI, University of Amsterdam
Petar Momcilovic, University of Michigan
Dick Muntz, University of California at Los Angeles
Philippe Nain, INRIA
David Nicol, University of Illinois
Sindo Nunez Queija, University of Amsterdam, CWI
Alexandre Proutiere, Microsoft Research
Ana Radovanovic, Google Research
Kavita Ramanan, Brown University
Philippe Robert, INRIA
Devavrat Shah, MIT
Mayank Sharma, IBM T.J. Watson Research Center
Evgenia Smirni, College of William and Mary
Mark Squillante, IBM T.J. Watson Research Center
R. Srikant, University of Illinois
Don Towsley, University of Massachusetts
Cathy Xia, Ohio State University
David Yao, Columbia University
Assaf Zeevi, Columbia University
Bert Zwart, CWI

Additional information about the MAMA 2010 Workshop can be found at the
SIGMETRICS 2010 web site:
http://www.sigmetrics.org/sigmetrics2010/mama10cfa.shtml
For more information about the workshop, please contact Mark Squillante
(mss((at))watson.ibm.com).

COCOON-2010 Call for Participations

[Please feel free to forward this message to your colleagues, students,
and others who might be interested. Apologies to those who receive this
multiple times.]

*******************************
CALL FOR PARTICIPATION
*******************************

THE 16TH INTERNATIONAL COMPUTING AND COMBINATORICS CONFERENCE (COCOON 2010)
July 19-21, Nha Trang, Vietnam - http://www.cise.ufl.edu/cocoon2010/

Dear Colleagues,

You are cordially invited to attend the The 16th International Computing
and Combinatorics Conference (COCOON 2010), to be held in Nha Trang,
Vietnam during July 19-21, 2010.

As a premier international forum on theoretical computer science, COCOON
has been dedicated to addressing the challenges in the areas of
Computational Complexity, Cryptography Theory, Data Structure and
Algorithms. In order to extend its most cordial invitation to researchers
around the world, in this year COCOON will be held in Vietnam, which is
one of the most beautiful countries in South East Asia.

REGISTRATIONS OPEN AT :
http://www.cise.ufl.edu/cocoon2010/registration.html
Early registration: May 17, 2010

INVITED SPEAKERS
* Manuel Blum (Carnegie Mellon University, USA)
+ The 1995 winner of the A.M. Turing Award
+ Member of the U.S. National Academy of Sciences and Engineering

* Oscar H. Ibarra (University of California,Santa Barbara, USA)
+ The 2007 winner of Blaise Pascal Medal in Computer Science
+ Fellow of the AAAS, ACM, and IEEE

LIST OF ACCEPTED PAPERS AND PROGRAMS :
http://www.cise.ufl.edu/cocoon2010/program.html

We look forward to seeing you in Vietnam in July!

------------------------------------------
COCOON TPC Co-chairs,
My T. Thai, Ph.D.
Sartaj Sahni, Ph.D.

CISE Department
University of Florida
http://www.cise.ufl.edu/cocoon2010

[DMANET] COCOON-2010 Call for Participations

[Please feel free to forward this message to your colleagues, students,and
others who might be interested. Apologies to those who receive this multiple
times.]

*******************************
CALL FOR PARTICIPATION
*******************************

THE 16TH INTERNATIONAL COMPUTING AND COMBINATORICS CONFERENCE (COCOON 2010)
July 19-21, Nha Trang, Vietnam - http://www.cise.ufl.edu/cocoon2010/

Dear Colleagues,

You are cordially invited to attend the The 16th International Computing
and Combinatorics Conference (COCOON 2010), to be held in Nha Trang,
Vietnam during July 19-21, 2010.

As a premier international forum on theoretical computer science, COCOON
has been dedicated to addressing the challenges in the areas of
Computational Complexity, Cryptography Theory, Data Structure and
Algorithms. In order to extend its most cordial invitation to researchers
around the world, in this year COCOON will be held in Vietnam, which is
one of the most beautiful countries in South East Asia.

REGISTRATIONS OPEN AT :
http://www.cise.ufl.edu/cocoon2010/registration.html
Early registration: May 17, 2010

INVITED SPEAKERS
* Manuel Blum (Carnegie Mellon University, USA)
+ The 1995 winner of the A.M. Turing Award
+ Member of the U.S. National Academy of Sciences and Engineering

* Oscar H. Ibarra (University of California,Santa Barbara, USA)
+ The 2007 winner of Blaise Pascal Medal in Computer Science
+ Fellow of the AAAS, ACM, and IEEE

LIST OF ACCEPTED PAPERS AND PROGRAMS :
http://www.cise.ufl.edu/cocoon2010/program.html

We look forward to seeing you in Vietnam in July!

------------------------------------------
COCOON TPC Co-chairs,
My T. Thai, Ph.D.
Sartaj Sahni, Ph.D.

CISE Department
University of Florida
http://www.cise.ufl.edu/cocoon2010
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] PhD or Postdoctoral Position -- Zuse Institute Berlin

The Konrad-Zuse-Zentrum f�r Informationstechnik Berlin (Zuse Institute
Berlin - ZIB) is a non-university research institute under public law of
the state of Berlin. In close interdisciplinary cooperation with the
Berlin universities as well as national and international scientific
institutions, ZIB conducts research and development in the field of
information technology, applied mathematics, and computer science.
The department Optimization invites applications for a

PhD Student or PostDoc Position (f/m)

- Vgr. IIa/Ib BAT/Anwendungs-TV Land Berlin -
Application code: WA 11/10

Within an interdisciplinary project on scientific questions related to
the development of innovative mathematical optimization algorithms for
the design of robust communications networks.

Research Topics

* Network planning with uncertain traffic matrices
* Network planning of multiple technological layers
and routing protocols
* Development of mathematical models for multi-layer networks
including survivability and robustness requirements
* Development of sophisticated optimzation algorithms
* Computation of networks with guaranteed solution quality

Requirements

* a university degree in mathematics, computer science or
communications engineering with excellent knowledge in
applied mathematics
* interest in application oriented research & development
* a strong interest in integer programming and polyhedreal theory
* excellent programming skills in C/C++ or Java under Microsoft
Windows or Linux
* experience in the development of reusable software code
* very good communication skills in English

The successful candidate will work in an inspiring and pleasant
environment and will receive adequate professional support. We offer a
challenging scientific task, a high degree of autonomy and
state-of-the-art technical infrastructure. Candidates are encouraged to
pursue a doctoral degree in conjunction with their work at ZIB. The
position will be initially financed for a period of two years with the
possibility of extension. The salary is based upon wage group IIa/Ib as
per Berlin Collective Agreement for the Public Sector.
We prefer to balance the number of female and male employees in our
institute. Thus, we kindly encourage female candidates to apply to this
job offer.

Handicapped persons will be given preference to other equally qualified
candidates.

Please send your application, referring to application code WA 11/10
(ROBUKOM), including CV and all relevant documents until 07 May 2010 to

Konrad-Zuse-Zentrum f�r Informationstechnik Berlin (ZIB)
- Verwaltung -,
Takustr. 7,
14195 Berlin, Germany

or via e-mail to our personnel department (jobs{at}zib.de).

You will find additional information on our web site:
http://www.zib.de/Optimization
For technical information, please contact Dr. Axel Werner, phone +49 30
84185-356, E-Mail: werner{at}zib.de.

[DMANET] PhD or Postdoctoral Position -- Zuse Institute Berlin

The Konrad-Zuse-Zentrum f�r Informationstechnik Berlin (Zuse Institute
Berlin - ZIB) is a non-university research institute under public law of
the state of Berlin. In close interdisciplinary cooperation with the
Berlin universities as well as national and international scientific
institutions, ZIB conducts research and development in the field of
information technology, applied mathematics, and computer science.
The department Optimization invites applications for a

PhD Student or PostDoc Position (f/m)

- Vgr. IIa/Ib BAT/Anwendungs-TV Land Berlin -
Application code: WA 10/10
Within an interdisciplinary project on scientific questions related to
the development of innovative mathematical optimization methods for the
design and the operation of railway networks.

Research Topics

* Mixed-integer linear programming models for railway track
allocation problems
* Development of mathematical models and algorithms for aggregation
and disaggregation of railway networks in space and time
* Development of sophisticated optimization algorithms
* Investigation of large-scale real-world networks

Requirements

* a university degree in mathematics or computer science with
excellent knowledge in applied mathematics
* interest in application oriented research & development
* a strong interest in integer programming and polyhedreal theory
* excellent programming skills in C/C++ or Java under Microsoft
Windows or Linux
* experience in the development of reusable software code
* very good communication skills in English
* willingness to cooperate with academic and industrial partners
* willingness to spend a three-month internship at our industrial
partner in Frankfurt/Main at the beginning of the project.

The successful candidate will work in an inspiring and pleasant
environment and will receive adequate professional support. We offer a
challenging scientific task, a high degree of autonomy and
state-of-the-art technical infrastructure. Candidates are encouraged to
pursue a doctoral degree in conjunction with their work at ZIB. The
position will be initially financed for a period of two years with the
possibility of extension. The salary is based upon wage group IIa/Ib as
per Berlin Collective Agreement for the Public Sector.
We prefer to balance the number of female and male employees in our
institute. Thus, we kindly encourage female candidates to apply to this
job offer.

Handicapped persons will be given preference to other equally qualified
candidates.

Please send your application, referring to application code WA 10/10
(KOSMOS), including CV and all relevant documents until 07 May 2010 to

Konrad-Zuse-Zentrum f�r Informationstechnik Berlin (ZIB)
- Verwaltung -,
Takustr. 7,
14195 Berlin, Germany

or via e-mail to our personnel department (jobs{at}zib.de).

You will find additional information on our web site:
http://www.zib.de/Optimization
For technical information, please contact Dr. Armin F�genschuh, phone
+49 30 84185-205, E-Mail: fuegenschuh{at}zib.de.

[DMANET] IEEE ISWCS 2010 - Last CFP

Dear all colleagues,

You are invited to contribute your recent work on cognitive radio & networks
to the following conference - ISWCS 2010.

----------------------------------------------------------------------------

The IEEE Seventh International Symposium on Wireless Communication Systems -
ISWCS 2010 -

19-22 September 2010, York, United Kingdom

http://www.iswcs.org/iswcs2010/index.html

Paper submission deadline: 30 April 2010 (midnight - UK time)

The IEEE ISWCS 2010 will be held from 19 until 22 September 2010 at the
Exhibition Centre of the University of York, York, United Kingdom. This is
one of the biggest events in Europe in the area of wireless communications
and will be held in York, the 2nd most visited city in the UK and European
Tourism City of the Year in 2007.

The conference is technically sponsored by the IEEE Vehicular Technology
Society and the IEEE Communications Society and will bring together
individuals from academia, government, and industry to discuss and exchange
ideas in the fields of wireless and mobile communications, networking and
signal processing employed to support the needs of the Information Society.
The conference will feature world-class plenary speakers, special sessions,
tutorials, workshops, and technical and application sessions.

We invite the submission of original, unpublished technical papers in the
following areas:

- Cognitive radio
- Communication theory
- Signal processing
- Networking, protocols
- Antennas and propagation
- Wireless sensor networks
- Multimedia systems

Prospective authors are encouraged to submit a 5-page full paper (or a
2-page extended abstract including results) through the conference web site
using the Trackchair system.

Keynote speakers:

Prof. Paulo Diniz, Federal University of Rio de Janeiro - Title:
High-Throughput Block Transceivers

Prof. Josef Nossek, TU Munich - Title: Do Communications Engineers Need
Circuit Theory?

Prof. Ali H. Sayed, UCLA - Title: Adaptive Networks and Bio-Inspired
Cognition

Prof. Andreas Mitschele-Thiel, TU Ilmenau - Title: Self-organisation in
Mobile Communication Systems

Prof. David Gesbert, EURECOM - Title: Cooperation in Cellular Networks:
Taking a New Look at Interference

Tutorials:

High-quality half-day tutorials given by international experts covering
different aspects of wireless communications will be announced soon and will
be free for all delegates of ISWCS.

Important Date:

Paper submission deadline: 30 April 2010 (midnight - UK time)

Best Paper Awards:

The two best papers of the symposium will receive awards and prizes
sponsored by Wiley

Further information about ISWCS 2010 can be found at

<http://www.iswcs.org/iswcs2010/index.html>
http://www.iswcs.org/iswcs2010/index.html

Dr. Rodrigo de Lamare and Dr. Paul Mitchell
General chairs ISWCS 2010

=====================================================

Honggang ZHANG, Professor, Ph.D.

Department of Information Science & Electronic Engineering

Zhejiang University

Zheda Road 38, Hangzhou 310027, CHINA

Tel: +86-571-87952022 Fax: +86-571-87952022

Email: honggangzhang@zju.edu.cn

Website 1: http://mypage.zju.edu.cn/en/honggangzhang

Website 2: http://sites.google.com/site/honggangzhanglabs/

=====================================================

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

E.W. Beth Dissertation Award 2010 - deadline extended

E. W. Beth Dissertation Prize: 2010 call for nominations

Deadline extended: May 16, 2010 !!!

Since 2002, FoLLI (the Association for Logic, Language, and Information,
http://www.folli.org) awards the E.W. Beth Dissertation Prize to
outstanding
dissertations in the fields of Logic, Language, and Information. We
invite
submissions for the best dissertation which resulted in a Ph.D. degree
in the
year 2009. The dissertations will be judged on technical depth and
strength,
originality, and impact made in at least two of three fields of Logic,
Language, and Computation. Interdisciplinarity is an important feature
of
the theses competing for the E.W. Beth Dissertation Prize.

Who qualifies.

Nominations of candidates are admitted who were awarded a Ph.D. degree
in
the areas of Logic, Language, or Information between January 1st,
2009 and
December 31st, 2009. There is no restriction on the nationality of the
candidate
or the university where the Ph.D. was granted. After a careful
consideration,
FoLLI has decided to accept only dissertations written in English.
Dissertations
produced in 2009 but not written in English or not translated will be
allowed
for submission, after translation, also with the call next year (for
2010).
The present call for nominations for the E.W. Beth Dissertation Award
2010 will
also accept nominations of full English translations of theses
originally
written in another language than English and defended in 2008 or 2009.

Prize.

The prize consists of:

-a certificate

-a donation of 2500 euros provided by the E.W. Beth Foundation

-an invitation to submit the thesis (or a revised version of it) to
the FoLLI
Publications on Logic, Language and Information (Springer). For further
information on this series see the FoLLI site.

How to submit.

Only electronic submissions are accepted. The following documents are
required:

1. The thesis in pdf or ps format (doc/rtf not accepted);

2. A ten page abstract of the dissertation in ascii or pdf format;

3. A letter of nomination from the thesis supervisor. Self-nominations
are not
admitted: each nomination must be sponsored by the thesis supervisor.
The letter
of nomination should concisely describe the scope and significance of
the
dissertation and state when the degree was officially awarded;

4. Two additional letters of support, including at least one letter
from a
referee not affiliated with the academic institution that awarded the
Ph.D.
degree.

All documents must be submitted electronically to buszko@amu.edu.pl.
Hard copy
submissions are not admitted. In case of any problems with the email
submission
or a lack of notification within three working days, nominators should
write to
buszko@amu.edu.pl.

Important dates:

Deadline for Submissions: April 30, 2010 (extended: May 16, 2010)
Notification of Decision: July 20, 2010.

Committee :

Natasha Alechina (Nottingham)
Lev Beklemishev (Moscow)
Wojciech Buszkowski (chair) (Poznan)
Didier Caucal (IGM-CNRS)
Nissim Francez (Haifa)
Alexander Koller (Saarbruecken)
Alberto Policriti (Udine)
Ian Pratt-Hartmann (Manchester)
Rob van der Sandt (Nijmegen)
Colin Stirling (Edinburgh)
Rineke Verbrugge (Groningen)
Heinrich Wansing (Dresden)

Second Announcement BLAST 2010

*****************************************************************
*********** Second Announcement BLAST 2010 ************
*****************************************************************

The third meeting of the BLAST (Boolean Algebras, Lattices, Algebra,
Set Theory, and Topology) conferences will be held in Boulder,
Colorado from June 2, 2010 to June 6, 2010. There will be invited talks
by Mohamed Bekkali, Ken Kunen, Ralph McKenzie, David Milovich, Grigor
Sargsyan, Juris Steprans, and Friedrich Wehrung. There will also be
tutorials by Andreas Blass, Gary Gruenhage, Matatyahu Rubin, and Ross Willard.

The purpose of this email is to inform you briefly about registration,
abstract submission, the conference proceedings, accommodation, and
support. More detailed information can be found at

http://euclid.colorado.edu/~kasterma/blast/index.php

REGISTRATION:

Registration fee: $90 (on or before May 10, 2010),
$110 (after May 10, 2010).
Banquet fee: $30 (per person).

To register, please follow the link to RegOnline on the conference
web page at

http://euclid.colorado.edu/~kasterma/blast/registration.php

If you have any problems with registering via RegOnline, please contact
us at

blast@colorado.edu

ABSTRACTS:
Participants who wish to give a talk, must submit a title and abstract for
the talk by May 31, 2010 via Atlas at

http://atlas-conferences.com/cgi-bin/abstract/submit/cbap-01

Abstracts submitted after May 24, 2010, will not appear in the booklet
of abstracts. Abstracts may be viewed at

http://atlas-conferences.com/cgi-bin/abstract/cbap-01

PROCEEDINGS:
A special issue of the journal Order will be devoted to publishing a
proceedings of this conference. The usual journal reviewing process will be
used, and the usual high standards of Order will be applied to submissions.
The submission deadline for the proceedings is tentatively set at
September 1, 2010. (This date will be finalized by the time of the
conference.)

ACCOMMODATION:

Hotels:
Special conference rates have been arranged for the participants of
BLAST 2010 in two hotels:

Best Western Boulder Inn (800-233-8469 or 303-449-3800)
and
Boulder Outlook Hotel (800-542-0304 or 303-443-3322)

The room blocks/rates are available until May 1, 2010, or when sold
out. Please identify yourself with BLAST 2010 when you make a reservation.
Reservations must be guaranteed by a valid individual credit card.

Residence Halls:
Room and board packages have been arranged for the participants of
BLAST 2010 in the Residence Halls of the University of Colorado.
The reservation deadline for the residence halls is May 21, 2010.

Please visit the conference web page at

http://euclid.colorado.edu/~kasterma/blast/accomodation.php

for information on room rates and for the on-campus lodging reservation form
for the residence halls.

SUPPORT:
There is a limited amount of financial support, which will be directed
toward graduate students and recent Ph.D.'s. To apply for support, send
an email of request to blast@colorado.edu. Your request should mention
your status (graduate student or year of Ph.D.), affiliation (if any),
point of origin of your trip to Boulder. Please indicate whether you plan
to give a talk. If you are a graduate student, arrange for a brief
email of endorsement from your faculty advisor to be sent to
blast@colorado.edu.

If you have any questions, please contact us at

blast@colorado.edu

Best regards,
the organizing committee:
Bart Kastermans, Keith Kearnes, Don Monk, and Agnes Szendrei.

[DMANET] Special Issue of Discrete Applied Mathematics on Combinatorial Optimization

*Call for Papers
*

*
Special Issue of Discrete Applied Mathematics on

Combinatorial Optimization*

We invite submissions of novel research articles for a forthcoming issue
of /Discrete Applied Mathematics/ on Combinatorial Optimization.

This special issue will be dedicated to the International Symposium on
Combinatorial Optimization that was held in Hammamet,Tunisia, March 24-26, 2010.
However it is also open to papers which have not been presented at the conference.

High quality research papers are solicited to address theoretical as
well as practical issues of Combinatorial Optimization.
Topics of interest include, but are not limited to:

* Approximation algorithms
* Cutting planes algorithms
* Polyhedral combinatorics
* Local search algorithms
* Computational complexity
* Graph and network algorithms
* Linear and integer programming
* Interior point methods

The deadline for submission of full papers is *July 31, 2010*.

All articles will be thoroughly refereed according to the high standards
of the journal

For their submissions, the authors should follow the "Guide for Authors"
of the journal website http://ees.elsevier.com/dam/
The article type for this issue is *Special Iss: Combinatorial Optimization*
and selecting this article type will ensure that the submission is sent to
the editors of the special issue.

Guest Editors:

Dominique de Werra, dominique.dewerra@epfl.ch
Nelson Maculan, maculan@cos.ufrj.br
A. Ridha Mahjoub, mahjoub@lamsade.dauphine.fr

-----------------------------------------
A. Ridha Mahjoub
Laboratoire LAMSADE
Université Paris Dauphine
Place du Maréchal de Lattre de Tassigny
75775 Paris Cedex 16
France
Tel: +33 (0)1 44 05 48 96
Fax: +33 (0)1 44 05 40 91
E-mail: mahjoub@lamsade.dauphine.fr
URL: http://www.lamsade.dauphine.fr/~mahjoub

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] POSTGRADUATE STUDENTSHIP in Mathematics, with emphasis on combinatorial algorithms

POSTGRADUATE STUDENTSHIP in Mathematics, especially discrete mathematics,
with emphasis on combinatorial algorithms,
at the Centre for Mathematical Sciences, Faculty of Science.
Lund University, Sweden

See
http://www.science.lu.se/upload/LUPDF/natvet/Utlysningar/100520_1076e.pdf
for more details.

Reference number: 1076
Starting Date: September 1, 2010
Information: Andrzej Lingas, phone 046-222 4519, Andrzej.Lingas@cs.lth.se

N.B. Application no later than May 20, 2010.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Berlin-Poznan Seminar on Discrete Mathematics, TU Berlin, 4 June 2010

-----------------------------------------------------------------
Call for participation

Berlin-Poznan Seminar on Discrete Mathematics
Friday, 4 June 2010
Technische Universitaet Berlin

http://www.math.tu-berlin.de/MDS/BPSeminar2010.pdf
-----------------------------------------------------------------

The Berlin-Poznan Seminar is a joint seminar organized by the three Berlin Universities (FU, HU and TU Berlin) and the
Adam Mickiewicz University in Poznan. The topics include discrete mathematics and algorthims, enumerative, extremal and
probabilistic combinatorics. It is supported by DFG within the Research Training Group (Graduiertenkolleg) "Methods for
Discrete Structures" and the Berlin Mathematical School and by the Adam Mickiewicz University in Poznan.

-------
Program
-------
Friday, 4 June 2010

09:00 - 09:10 Openning
09:10 - 10:00 Tomasz Luczak
The structure of dense H-free graphs
10:00 - 10:40 Tibor Szabo
TBA
10:40 - 11:20 Katarzyna Rybaczyk
On relations between G(n,p) and the random intersection graph
11:20 - 13:00 Lunch break
13:00 - 13:40 Hiep Han
Weak quasi-randomness for uniform hypergraph
13:40 - 14:20 Rafal Witkowski
Graph multicoloring in frequency assignment problem
14:20 - 15:00 Kolja Knauer
Lattices and polytopes from graphs
15:00 – Closing/coffee

--------
Location
--------

Technische Universitaet Berlin
Institut fuer Mathematik
Strasse des 17. Juni 136, D-10623 Berlin
Lecture Room MA 415

-------
Contact
-------
Mihyun Kang, kang@math.tu-berlin.de

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************