Published in: OASIcs, Volume 112, 4th International Computer Programming Education Conference (ICPEC 2023)
Tiago Romão, Pedro Pestana, and Leonel Morgado. A Systematic Review of Teacher-Facing Dashboards for Collaborative Learning Activities and Tools in Online Higher Education. In 4th International Computer Programming Education Conference (ICPEC 2023). Open Access Series in Informatics (OASIcs), Volume 112, pp. 13:1-13:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{romao_et_al:OASIcs.ICPEC.2023.13, author = {Rom\~{a}o, Tiago and Pestana, Pedro and Morgado, Leonel}, title = {{A Systematic Review of Teacher-Facing Dashboards for Collaborative Learning Activities and Tools in Online Higher Education}}, booktitle = {4th International Computer Programming Education Conference (ICPEC 2023)}, pages = {13:1--13:12}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-290-7}, ISSN = {2190-6807}, year = {2023}, volume = {112}, editor = {Peixoto de Queir\'{o}s, Ricardo Alexandre and Teixeira Pinto, M\'{a}rio Paulo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICPEC.2023.13}, URN = {urn:nbn:de:0030-drops-185095}, doi = {10.4230/OASIcs.ICPEC.2023.13}, annote = {Keywords: Dashboards, collaborative tools, collaborative activities, online learning, e-learning, computer-supported collaborative learning} }
Published in: LIPIcs, Volume 240, 15th International Conference on Spatial Information Theory (COSIT 2022)
Panagiotis Mavros, Saskia Kuliga, Ed Manley, Hilal Rohaidi Fitri, Michael Joos, and Christoph Hölscher. Collaborative Wayfinding Under Distributed Spatial Knowledge (Short Paper). In 15th International Conference on Spatial Information Theory (COSIT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 240, pp. 25:1-25:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{mavros_et_al:LIPIcs.COSIT.2022.25, author = {Mavros, Panagiotis and Kuliga, Saskia and Manley, Ed and Fitri, Hilal Rohaidi and Joos, Michael and H\"{o}lscher, Christoph}, title = {{Collaborative Wayfinding Under Distributed Spatial Knowledge}}, booktitle = {15th International Conference on Spatial Information Theory (COSIT 2022)}, pages = {25:1--25:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-257-0}, ISSN = {1868-8969}, year = {2022}, volume = {240}, editor = {Ishikawa, Toru and Fabrikant, Sara Irina and Winter, Stephan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.COSIT.2022.25}, URN = {urn:nbn:de:0030-drops-169105}, doi = {10.4230/LIPIcs.COSIT.2022.25}, annote = {Keywords: navigation, wayfinding, collaboration, dyad, online} }
Published in: OASIcs, Volume 81, First International Computer Programming Education Conference (ICPEC 2020)
Davide R. Carneiro and Rui J. R. Silva. Game Elements, Motivation and Programming Learning: A Case Study. In First International Computer Programming Education Conference (ICPEC 2020). Open Access Series in Informatics (OASIcs), Volume 81, pp. 5:1-5:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{carneiro_et_al:OASIcs.ICPEC.2020.5, author = {Carneiro, Davide R. and Silva, Rui J. R.}, title = {{Game Elements, Motivation and Programming Learning: A Case Study}}, booktitle = {First International Computer Programming Education Conference (ICPEC 2020)}, pages = {5:1--5:10}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-153-5}, ISSN = {2190-6807}, year = {2020}, volume = {81}, editor = {Queir\'{o}s, Ricardo and Portela, Filipe and Pinto, M\'{a}rio and Sim\~{o}es, Alberto}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICPEC.2020.5}, URN = {urn:nbn:de:0030-drops-122924}, doi = {10.4230/OASIcs.ICPEC.2020.5}, annote = {Keywords: Motivation, Programming, Genetic Algorithms} }
Published in: OASIcs, Volume 81, First International Computer Programming Education Conference (ICPEC 2020)
Ceres Morais, Daniela Pedrosa, Mario Madureira Fontes, José Cravino, and Leonel Morgado. Detailing an e-Learning Course on Software Engineering and Architecture Using BPMN. In First International Computer Programming Education Conference (ICPEC 2020). Open Access Series in Informatics (OASIcs), Volume 81, pp. 17:1-17:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{morais_et_al:OASIcs.ICPEC.2020.17, author = {Morais, Ceres and Pedrosa, Daniela and Fontes, Mario Madureira and Cravino, Jos\'{e} and Morgado, Leonel}, title = {{Detailing an e-Learning Course on Software Engineering and Architecture Using BPMN}}, booktitle = {First International Computer Programming Education Conference (ICPEC 2020)}, pages = {17:1--17:8}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-153-5}, ISSN = {2190-6807}, year = {2020}, volume = {81}, editor = {Queir\'{o}s, Ricardo and Portela, Filipe and Pinto, M\'{a}rio and Sim\~{o}es, Alberto}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICPEC.2020.17}, URN = {urn:nbn:de:0030-drops-123045}, doi = {10.4230/OASIcs.ICPEC.2020.17}, annote = {Keywords: educational planning, BPMN, e-learning, programming courses, MVC, software engineering education} }
Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, and Lars Rohwedder. Online Bin Covering with Limited Migration. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 18:1-18:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{berndt_et_al:LIPIcs.ESA.2019.18, author = {Berndt, Sebastian and Epstein, Leah and Jansen, Klaus and Levin, Asaf and Maack, Marten and Rohwedder, Lars}, title = {{Online Bin Covering with Limited Migration}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {18:1--18:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-124-5}, ISSN = {1868-8969}, year = {2019}, volume = {144}, editor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.18}, URN = {urn:nbn:de:0030-drops-111391}, doi = {10.4230/LIPIcs.ESA.2019.18}, annote = {Keywords: online algorithms, dynamic algorithms, competitive ratio, bin covering, migration factor} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Drago Bokal, Zdeněk Dvořák, Petr Hliněný, Jesús Leaños, Bojan Mohar, and Tilo Wiedera. Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 14:1-14:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bokal_et_al:LIPIcs.SoCG.2019.14, author = {Bokal, Drago and Dvo\v{r}\'{a}k, Zden\v{e}k and Hlin\v{e}n\'{y}, Petr and Lea\~{n}os, Jes\'{u}s and Mohar, Bojan and Wiedera, Tilo}, title = {{Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c \langle= 12}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {14:1--14: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.14}, URN = {urn:nbn:de:0030-drops-104183}, doi = {10.4230/LIPIcs.SoCG.2019.14}, annote = {Keywords: graph drawing, crossing number, crossing-critical, zip product} }
Published in: LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Jiehua Chen, Hendrik Molter, Manuel Sorge, and Ondrej Suchý. Cluster Editing in Multi-Layer and Temporal Graphs. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 24:1-24:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{chen_et_al:LIPIcs.ISAAC.2018.24, author = {Chen, Jiehua and Molter, Hendrik and Sorge, Manuel and Such\'{y}, Ondrej}, title = {{Cluster Editing in Multi-Layer and Temporal Graphs}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {24:1--24:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.24}, URN = {urn:nbn:de:0030-drops-99729}, doi = {10.4230/LIPIcs.ISAAC.2018.24}, annote = {Keywords: Cluster Editing, Temporal Graphs, Multi-Layer Graphs, Fixed-Parameter Algorithms, Polynomial Kernels, Parameterized Complexity} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, and Szymon Torunczyk. First-Order Interpretations of Bounded Expansion Classes. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 126:1-126:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{gajarsky_et_al:LIPIcs.ICALP.2018.126, author = {Gajarsk\'{y}, Jakub and Kreutzer, Stephan and Nesetril, Jaroslav and Ossona de Mendez, Patrice and Pilipczuk, Michal and Siebertz, Sebastian and Torunczyk, Szymon}, title = {{First-Order Interpretations of Bounded Expansion Classes}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {126:1--126:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.126}, URN = {urn:nbn:de:0030-drops-91300}, doi = {10.4230/LIPIcs.ICALP.2018.126}, annote = {Keywords: Logical interpretations/transductions, structurally sparse graphs, bounded expansion} }
Published in: LIPIcs, Volume 31, 18th International Conference on Database Theory (ICDT 2015)
Xiaocheng Hu, Yufei Tao, Yi Yang, Shengyu Zhang, and Shuigeng Zhou. On The I/O Complexity of Dynamic Distinct Counting. In 18th International Conference on Database Theory (ICDT 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 31, pp. 265-276, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{hu_et_al:LIPIcs.ICDT.2015.265, author = {Hu, Xiaocheng and Tao, Yufei and Yang, Yi and Zhang, Shengyu and Zhou, Shuigeng}, title = {{On The I/O Complexity of Dynamic Distinct Counting}}, booktitle = {18th International Conference on Database Theory (ICDT 2015)}, pages = {265--276}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-79-8}, ISSN = {1868-8969}, year = {2015}, volume = {31}, editor = {Arenas, Marcelo and Ugarte, Mart{\'\i}n}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2015.265}, URN = {urn:nbn:de:0030-drops-49895}, doi = {10.4230/LIPIcs.ICDT.2015.265}, annote = {Keywords: distinct counting, lower bound, external memory} }
Feedback for Dagstuhl Publishing