Program for stream Graphs, telecommunication, networks (contributed)

TE-15: Survivable network design
Stream: Graphs, telecommunication, networks (contributed)
Room: 307A
Chair(s): Laura Mónica Escobar Vargas

• Polynomial-time algorithms for combinatorial optimization problems with interval data
  Xudong Hu
• Using the new software GraphsInGraphs to help finding a robust communication network
  Eglantine Camby, Gilles Caporossi, Marcia Paiva, Moises Ribeiro, Segatto Marcelo
• A methodology for transmission expansion planning problem considering reduction of the search space based on angular cuts and minimum effort criterion
  Laura Mónica Escobar Vargas, Rubén Augusto Romero Lázaro

WA-15: Content delivery
Stream: Graphs, telecommunication, networks (contributed)
Room: 307A
Chair(s): Sy-Ming Guu

• Comparison between SDN and conventional networks based on multimedia services
  David Salazar
• Protective device and isolating switch allocation for distribution reliability optimization with tie switches and distributed generators
  Jia Guo
• Broadcast domination in permutation graphs
  Eunjeong Yi
• Finding an optimal data transmission in BitTorrent-like peer-to-peer file sharing system
  Sy-Ming Guu

HA-15: Graphs, path and cycles
Stream: Graphs, telecommunication, networks (contributed)
Room: 307A
Chair(s): Tatsuo Oyama

• The most inconsistent graph of paired comparisons with ties
  Konrad Kułakowski
• On the geometric-arithmetic index with given minimum degree
  Ljiljana Pavlovic, Milica Milivojevic
• Path-counting problem and survivability function - Definition, approximation and applications
  Tatsuo Oyama, Kazuhiro Kobayashi
• P-cycle and FIPP p-cycle networks design
  Irene Loiseau, Agustín Pecorari