- Publication
- Research
-
This site was generated using julia StaticWebPages.jl
Duōyú Rén
Duōyú Rén
十年不學無「術」，此地質木無「文」。以下均爲頁面模板材料。Duōyú Rén HERE IS THE TEMPLATE PAGE. Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nullam diam mi, ornare vel ullamcorper ut, posuere id leo. Fusce rutrum placerat ipsum eu suscipit.
Maecenas dictum mauris id purus porttitor sodales vulputate sollicitudin eros. Vivamus tempus arcu eu cursus tempus. In ac ex nec dui dictum rhoncus id porttitor dolor. In dui risus, ullamcorper quis ipsum nec, pretium ornare tortor.
His current research project involves Aliquam non condimentum tellus. In fringilla vitae arcu a ultricies. Ut aliquam rutrum tortor, ac gravida purus. Sed vel sapien in augue aliquam porttitor.
Email: ner.uyoud@sogol
@inproceedings{parmentier2019introducing,
organization = {Springer},
pages = {684--696},
doi = {10.1007/978-3-030-36683-4_55},
booktitle = {International Conference on Complex Networks and Their Applications},
author = {Parmentier, Pimprenelle and Viard, Tiphaine and Renoust, Benjamin and Baffier, Jean-Francois},
year = {2019},
labels = {conference, preprint, software},
title = {Introducing multilayer stream graphs and layer centralities}
}
@article{bae2018gapplanar,
pages = {36 - 52},
author = {Bae, Sang Won and Baffier, Jean-Francois and Chun, Jinhee and Eades, Peter and Eickmeyer, Kord and Grilli, Luca and Hong, Seok-Hee and Korman, Matias and Montecchiani, Fabrizio and Rutter, Ignaz and Tóth, Csaba D.},
journal = {Theoretical Computer Science},
labels = {journal, preprint},
title = {Gap-planar graphs},
doi = {10.1016/j.tcs.2018.05.029},
keywords = {Beyond planarity -gap-planar graphs, Density results, Complete graphs, Recognition problem, -planar graphs, -quasiplanar graphs},
issn = {0304-3975},
year = {2018},
url = {http://www.sciencedirect.com/science/article/pii/S0304397518303670},
volume = {745},
abstract = {We introduce the family of k-gap-planar graphs for k≥0, i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge is assigned at most k of its crossings. This definition is motivated by applications in edge casing, as a k-gap-planar graph can be drawn crossing-free after introducing at most k local gaps per edge. We present results on the maximum density of k-gap-planar graphs, their relationship to other classes of beyond-planar graphs, characterization of k-gap-planar complete graphs, and the computational complexity of recognizing k-gap-planar graphs.}
}
We introduce the family of k-gap-planar graphs for k≥0, i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge is assigned at most k of its crossings. This definition is motivated by applications in edge casing, as a k-gap-planar graph can be drawn crossing-free after introducing at most k local gaps per edge. We present results on the maximum density of k-gap-planar graphs, their relationship to other classes of beyond-planar graphs, characterization of k-gap-planar complete graphs, and the computational complexity of recognizing k-gap-planar graphs.
@inproceedings{baffier2018experimental,
pages = {19:1--19:13},
booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)},
author = {Baffier, Jean-Francois and Diez, Yago and Korman, Matias},
editor = {D'Angelo, Gianlorenzo},
labels = {conference, preprint, software},
title = {Experimental Study of Compressed Stack Algorithms in Limited Memory Environments},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
doi = {10.4230/LIPIcs.SEA.2018.19},
address = {Dagstuhl, Germany},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
year = {2018},
volume = {103}
}
@inproceedings{baffier2018bilevel,
pages = {105 - 114},
doi = {10.1016/j.endm.2018.01.012},
booktitle = {Electronic Notes in Discrete Mathematics},
author = {Baffier, Jean-Francois and Poirion, Pierre-Louis and Suppakitpaisarn, Vorapong},
note = {8th International Network Optimization Conference - INOC 2017},
year = {2018},
volume = {64},
labels = {conference, software},
title = {Bilevel Model for Adaptive Network Flow Problem}
}
@article{renoust2017multiplex,
pages = {23},
author = {Renoust, Benjamin and Claver, Vivek and Baffier, Jean-Francois},
day = {18},
month = {Jul},
journal = {Applied Network Science},
labels = {journal, software},
title = {Multiplex flows in citation networks},
number = {1},
doi = {10.1007/s41109-017-0035-2},
year = {2017},
volume = {2}
}
@article{baffier2016parametric,
pages = {20 - 36},
author = {Baffier, Jean-Francois and Suppakitpaisarn, Vorapong and Hiraishi, Hidefumi and Imai, Hiroshi},
journal = {Discrete Optimization},
labels = {journal, software},
title = {Parametric multiroute flow and its application to multilink-attack network},
doi = {10.1016/j.disopt.2016.05.002},
keywords = {Graph and network algorithm, Approximation algorithm, Network flow, Network interdiction, Multiroute flow, Parametric optimization},
issn = {1572-5286},
note = {SI: ISCO 2014},
year = {2016},
url = {http://www.sciencedirect.com/science/article/pii/S1572528616300330},
volume = {22},
abstract = {We investigate variants of the max-flow problem in a network under k attacks. The network interdiction problem is to find the minimum max-flow value among (mk) networks that can be obtained by deleting each set of k links. The adaptive network flow problem is to find a flow of the network such that the flow value is maximum against any set of k links attack, when deleting the corresponding flow to those k links in the original flow. First, we prove that max-(k+1)-route flow is a (k+1)-approximation for both problems. Also, we develop a polynomial-time heuristic algorithm for both cases, called the iterative multiroute flow. Then in a second phase, we investigate properties of the function taking the real value h to the max h-route flow value, and apply the result to solve both of the problems. We show that the function is piecewise hyperbolic, and modify a standard parametric optimization technique to find this function. The running time of the algorithm is O(λT), when λ is a source–sink edge connectivity of our network and T the computation time of a max-flow algorithm. We show that for some instances, when h is optimally chosen, the max- h-route flow is an exact solution for both problems.}
}
We investigate variants of the max-flow problem in a network under k attacks. The network interdiction problem is to find the minimum max-flow value among (mk) networks that can be obtained by deleting each set of k links. The adaptive network flow problem is to find a flow of the network such that the flow value is maximum against any set of k links attack, when deleting the corresponding flow to those k links in the original flow. First, we prove that max-(k+1)-route flow is a (k+1)-approximation for both problems. Also, we develop a polynomial-time heuristic algorithm for both cases, called the iterative multiroute flow. Then in a second phase, we investigate properties of the function taking the real value h to the max h-route flow value, and apply the result to solve both of the problems. We show that the function is piecewise hyperbolic, and modify a standard parametric optimization technique to find this function. The running time of the algorithm is O(λT), when λ is a source–sink edge connectivity of our network and T the computation time of a max-flow algorithm. We show that for some instances, when h is optimally chosen, the max- h-route flow is an exact solution for both problems.
| Visitors | Views | |
|---|---|---|
| The Page | ... | ... |
| The Site | ... | ... |