Published in: LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)
Vikrant Ashvinkumar, Sepehr Assadi, Chengyuan Deng, Jie Gao, and Chen Wang. Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural Balance. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 275, pp. 58:1-58:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{ashvinkumar_et_al:LIPIcs.APPROX/RANDOM.2023.58, author = {Ashvinkumar, Vikrant and Assadi, Sepehr and Deng, Chengyuan and Gao, Jie and Wang, Chen}, title = {{Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural Balance}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)}, pages = {58:1--58:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-296-9}, ISSN = {1868-8969}, year = {2023}, volume = {275}, editor = {Megow, Nicole and Smith, Adam}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.58}, URN = {urn:nbn:de:0030-drops-188830}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.58}, annote = {Keywords: Streaming algorithms, structural balance, pseudo-randomness generator} }
Published in: LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023)
Sayan Bandyapadhyay, William Lochet, Saket Saurabh, and Jie Xue. Minimum-Membership Geometric Set Cover, Revisited. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 11:1-11:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{bandyapadhyay_et_al:LIPIcs.SoCG.2023.11, author = {Bandyapadhyay, Sayan and Lochet, William and Saurabh, Saket and Xue, Jie}, title = {{Minimum-Membership Geometric Set Cover, Revisited}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {11:1--11:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.11}, URN = {urn:nbn:de:0030-drops-178610}, doi = {10.4230/LIPIcs.SoCG.2023.11}, annote = {Keywords: geometric set cover, geometric optimization, approximation algorithms} }
Published in: LIPIcs, Volume 236, 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)
Hao-Ren Wang, Kuan-Hua Tu, Jie-Hong Roland Jiang, and Christoph Scholl. Quantifier Elimination in Stochastic Boolean Satisfiability. In 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 236, pp. 23:1-23:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{wang_et_al:LIPIcs.SAT.2022.23, author = {Wang, Hao-Ren and Tu, Kuan-Hua and Jiang, Jie-Hong Roland and Scholl, Christoph}, title = {{Quantifier Elimination in Stochastic Boolean Satisfiability}}, booktitle = {25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)}, pages = {23:1--23:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-242-6}, ISSN = {1868-8969}, year = {2022}, volume = {236}, editor = {Meel, Kuldeep S. and Strichman, Ofer}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2022.23}, URN = {urn:nbn:de:0030-drops-166970}, doi = {10.4230/LIPIcs.SAT.2022.23}, annote = {Keywords: Stochastic Boolean Satisfiability, Quantifier Elimination, Decision Procedure} }
Published in: LIPIcs, Volume 235, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022)
Jie Wang, Dingding Chen, Ziyu Chen, Xiangshuang Liu, and Junsong Gao. Completeness Matters: Towards Efficient Caching in Tree-Based Synchronous Backtracking Search for DCOPs. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 39:1-39:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{wang_et_al:LIPIcs.CP.2022.39, author = {Wang, Jie and Chen, Dingding and Chen, Ziyu and Liu, Xiangshuang and Gao, Junsong}, title = {{Completeness Matters: Towards Efficient Caching in Tree-Based Synchronous Backtracking Search for DCOPs}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {39:1--39:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.39}, URN = {urn:nbn:de:0030-drops-166685}, doi = {10.4230/LIPIcs.CP.2022.39}, annote = {Keywords: DCOP, Cache, Any-space Algorithms, Complete Search Algorithms} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, and Hao-Tsung Yang. On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 2:1-2:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{afshani_et_al:LIPIcs.SoCG.2022.2, author = {Afshani, Peyman and de Berg, Mark and Buchin, Kevin and Gao, Jie and L\"{o}ffler, Maarten and Nayyeri, Amir and Raichel, Benjamin and Sarkar, Rik and Wang, Haotian and Yang, Hao-Tsung}, title = {{On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {2:1--2:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.2}, URN = {urn:nbn:de:0030-drops-160109}, doi = {10.4230/LIPIcs.SoCG.2022.2}, annote = {Keywords: Approximation, Motion Planning, Scheduling} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Haitao Wang and Jie Xue. Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 60:1-60:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{wang_et_al:LIPIcs.SoCG.2019.60, author = {Wang, Haitao and Xue, Jie}, title = {{Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {60:1--60:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-104-7}, ISSN = {1868-8969}, year = {2019}, volume = {129}, editor = {Barequet, Gill and Wang, Yusu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.60}, URN = {urn:nbn:de:0030-drops-104649}, doi = {10.4230/LIPIcs.SoCG.2019.60}, annote = {Keywords: Single-source shortest paths, Weighted unit-disk graphs, Geometric graph algorithms} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Jie Xue, Yuan Li, Saladi Rahul, and Ravi Janardan. Searching for the Closest-Pair in a Query Translate. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 61:1-61:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{xue_et_al:LIPIcs.SoCG.2019.61, author = {Xue, Jie and Li, Yuan and Rahul, Saladi and Janardan, Ravi}, title = {{Searching for the Closest-Pair in a Query Translate}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {61:1--61:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-104-7}, ISSN = {1868-8969}, year = {2019}, volume = {129}, editor = {Barequet, Gill and Wang, Yusu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.61}, URN = {urn:nbn:de:0030-drops-104659}, doi = {10.4230/LIPIcs.SoCG.2019.61}, annote = {Keywords: Closest pair, Range search, Geometric data structures, Translation query} }
Published in: OASIcs, Volume 66, 2018 Imperial College Computing Student Workshop (ICCSW 2018)
Bingnan Luo, Jie Shen, Yujiang Wang, and Maja Pantic. The iBUG Eye Segmentation Dataset. In 2018 Imperial College Computing Student Workshop (ICCSW 2018). Open Access Series in Informatics (OASIcs), Volume 66, pp. 7:1-7:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{luo_et_al:OASIcs.ICCSW.2018.7, author = {Luo, Bingnan and Shen, Jie and Wang, Yujiang and Pantic, Maja}, title = {{The iBUG Eye Segmentation Dataset}}, booktitle = {2018 Imperial College Computing Student Workshop (ICCSW 2018)}, pages = {7:1--7:9}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-097-2}, ISSN = {2190-6807}, year = {2019}, volume = {66}, editor = {Pirovano, Edoardo and Graversen, Eva}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2018.7}, URN = {urn:nbn:de:0030-drops-101883}, doi = {10.4230/OASIcs.ICCSW.2018.7}, annote = {Keywords: dataset, eye, segmentation, landmark, pixel-level} }
Published in: LIPIcs, Volume 9, 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)
Jiun-Jie Wang and Xin He. Compact Visibility Representation of Plane Graphs. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 141-152, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{wang_et_al:LIPIcs.STACS.2011.141, author = {Wang, Jiun-Jie and He, Xin}, title = {{Compact Visibility Representation of Plane Graphs}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {141--152}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.141}, URN = {urn:nbn:de:0030-drops-30064}, doi = {10.4230/LIPIcs.STACS.2011.141}, annote = {Keywords: plane graph, plane triangulation, visibility representation, st-orientation} }
Published in: Dagstuhl Seminar Proceedings, Volume 7151, Geometry in Sensor Networks (2007)
Jie Gao, Sol Lederer, and Yue Wang. Discovery of Sensor Network Layout using Connectivity Information. In Geometry in Sensor Networks. Dagstuhl Seminar Proceedings, Volume 7151, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{gao_et_al:DagSemProc.07151.2, author = {Gao, Jie and Lederer, Sol and Wang, Yue}, title = {{Discovery of Sensor Network Layout using Connectivity Information}}, booktitle = {Geometry in Sensor Networks}, pages = {1--14}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7151}, editor = {Subhash Suri and Roger Wattenhofer and Peter Widmayer}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07151.2}, URN = {urn:nbn:de:0030-drops-11149}, doi = {10.4230/DagSemProc.07151.2}, annote = {Keywords: Sensor Networks, Localization, Delaunay complex, Rigidity} }
Feedback for Dagstuhl Publishing