60 Search Results for "Simões, Alberto"

Volume

OASIcs, Volume 133

6th International Computer Programming Education Conference (ICPEC 2025)

ICPEC 2025, July 10-11, 2025, PORTIC, Polytechnic of Porto, Portugal

Editors: Ricardo Queirós, Mário Pinto, Filipe Portela, and Alberto Simões

Volume

OASIcs, Volume 113

12th Symposium on Languages, Applications and Technologies (SLATE 2023)

SLATE 2023, June 26-28, 2023, Vila do Conde, Portugal

Editors: Alberto Simões, Mario Marcelo Berón, and Filipe Portela

Volume

OASIcs, Volume 102

Third International Computer Programming Education Conference (ICPEC 2022)

ICPEC 2022, June 2-3, 2022, Polytechnic Institute of Cávado and Ave (IPCA), Barcelos, Portugal

Editors: Alberto Simões and João Carlos Silva

Volume

OASIcs, Volume 94

10th Symposium on Languages, Applications and Technologies (SLATE 2021)

SLATE 2021, July 1-2, 2021, Vila do Conde/Póvoa de Varzim, Portugal

Editors: Ricardo Queirós, Mário Pinto, Alberto Simões, Filipe Portela, and Maria João Pereira

Volume

OASIcs, Volume 91

Second International Computer Programming Education Conference (ICPEC 2021)

ICPEC 2021, May 27-28, 2021, University of Minho, Braga, Portugal

Editors: Pedro Rangel Henriques, Filipe Portela, Ricardo Queirós, and Alberto Simões

Volume

OASIcs, Volume 83

9th Symposium on Languages, Applications and Technologies (SLATE 2020)

SLATE 2020, July 13-14, 2020, School of Technology, Polytechnic Institute of Cávado and Ave, Portugal (Virtual Conference)

Editors: Alberto Simões, Pedro Rangel Henriques, and Ricardo Queirós

Volume

OASIcs, Volume 81

First International Computer Programming Education Conference (ICPEC 2020)

ICPEC 2020, June 25-26, 2020, ESMAD, Vila do Conde, Portugal (Virtual Conference)

Editors: Ricardo Queirós, Filipe Portela, Mário Pinto, and Alberto Simões

Volume

OASIcs, Volume 56

6th Symposium on Languages, Applications and Technologies (SLATE 2017)

SLATE 2017, June 26-27, 2017, Vila do Conde, Portugal

Editors: Ricardo Queirós, Mário Pinto, Alberto Simões, José Paulo Leal, and Maria João Varanda

Volume

OASIcs, Volume 38

3rd Symposium on Languages, Applications and Technologies

SLATE 2014, June 19-20, 2014, Bragança, Portugal

Editors: Maria João Varanda Pereira, José Paulo Leal, and Alberto Simões

Volume

OASIcs, Volume 29

2nd Symposium on Languages, Applications and Technologies

SLATE 2013, June 20-21, 2013, Porto, Portugal

Editors: José Paulo Leal, Ricardo Rocha, and Alberto Simões

Volume

OASIcs, Volume 21

1st Symposium on Languages, Applications and Technologies

SLATE 2012, June 21-22, 2012, Braga, Portugal

Editors: Alberto Simões, Ricardo Queirós, and Daniela da Cruz

Document
DOI: 10.4230/LIPIcs.ESA.2025.69
Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing

Authors: David Eppstein, Michael T. Goodrich, and Songyu (Alfred) Liu

Published in: LIPIcs, Volume 351, 33rd Annual European Symposium on Algorithms (ESA 2025)

Abstract
We provide the first approximation quality guarantees for the Cuthull-McKee heuristic for reordering symmetric matrices to have low bandwidth, and we provide an algorithm for reconstructing bounded-bandwidth graphs from distance oracles with near-linear query complexity. To prove these results we introduce a new width parameter, BFS width, and we prove polylogarithmic upper and lower bounds on the BFS width of graphs of bounded bandwidth. Unlike other width parameters, such as bandwidth, pathwidth, and treewidth, BFS width can easily be computed in polynomial time. Bounded BFS width implies bounded bandwidth, pathwidth, and treewidth, which in turn imply fixed-parameter tractable algorithms for many problems that are NP-hard for general graphs. In addition to their applications to matrix ordering, we also provide applications of BFS width to graph reconstruction, to reconstruct graphs from distance queries, and graph drawing, to construct arc diagrams of small height.
Cite as

David Eppstein, Michael T. Goodrich, and Songyu (Alfred) Liu. Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing. In 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 351, pp. 69:1-69:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{eppstein_et_al:LIPIcs.ESA.2025.69,
  author =	{Eppstein, David and Goodrich, Michael T. and Liu, Songyu (Alfred)},
  title =	{{Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing}},
  booktitle =	{33rd Annual European Symposium on Algorithms (ESA 2025)},
  pages =	{69:1--69:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-395-9},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{351},
  editor =	{Benoit, Anne and Kaplan, Haim and Wild, Sebastian and Herman, Grzegorz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.69},
  URN =		{urn:nbn:de:0030-drops-245373},
  doi =		{10.4230/LIPIcs.ESA.2025.69},
  annote =	{Keywords: Graph algorithms, graph theory, graph width, bandwidth, treewidth}
}
Document
DOI: 10.4230/OASIcs.ICPEC.2025.1
Exploring Mutation Testing for Teaching Introductory Programming

Authors: Pedro Vasconcelos

Published in: OASIcs, Volume 133, 6th International Computer Programming Education Conference (ICPEC 2025)

Abstract
This paper proposes the use of introductory programming assignments based on mutation testing where students are asked to write tests rather than code. We believe such exercises can be used to teach code reading skills before students could write the corresponding programs on their own. Furthermore, feedback for such exercises can be automatically generated using testing tools. We have extended an existing web-based system for programming exercises with such mutation testing assignments and show some example use cases. This is on-going work that has yet to be validated in the classroom.
Cite as

Pedro Vasconcelos. Exploring Mutation Testing for Teaching Introductory Programming. In 6th International Computer Programming Education Conference (ICPEC 2025). Open Access Series in Informatics (OASIcs), Volume 133, pp. 1:1-1:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{vasconcelos:OASIcs.ICPEC.2025.1,
  author =	{Vasconcelos, Pedro},
  title =	{{Exploring Mutation Testing for Teaching Introductory Programming}},
  booktitle =	{6th International Computer Programming Education Conference (ICPEC 2025)},
  pages =	{1:1--1:8},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-393-5},
  ISSN =	{2190-6807},
  year =	{2025},
  volume =	{133},
  editor =	{Queir\'{o}s, Ricardo and Pinto, M\'{a}rio and Portela, Filipe and Sim\~{o}es, Alberto},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICPEC.2025.1},
  URN =		{urn:nbn:de:0030-drops-240319},
  doi =		{10.4230/OASIcs.ICPEC.2025.1},
  annote =	{Keywords: mutation testing, programming education}
}
Document
DOI: 10.4230/OASIcs.ICPEC.2025.6
Enhancing Creative Thinking Through Gamification in LMS Environments

Authors: Maria João Varanda Pereira, Luís M. Alves, Adina Cocu, Sandra M. Dingli, Montse Meneses, and Ramon Vilanova

Published in: OASIcs, Volume 133, 6th International Computer Programming Education Conference (ICPEC 2025)

Abstract
Gamification in educational context involves applying game design elements and principles to enhance the learning experience. By incorporating the motivational features of games, it aims to engage students and support educational goals. The work presented in this article is part of ThinkGame Erasmus+ project. The project’s goal is to encourage the use of Learning Management System (LMS) tools, such as lessons, wikis, and online tests to create gamified experiences in programming classes. These innovative strategies are intended to boost student motivation and creativity by incorporating compelling narratives, adaptable challenges, collaborative tasks, and continuous feedback. Another important challenge addressed in the project was fostering creativity among teachers, encouraging them to transform conventional, non-gamified resources into engaging and thought-provoking activities for students. A case study composed of ten gamified experiences was developed at Polytechnic Institute of Bragança, one of the project partners, during one semester in Imperative Programming subject.
Cite as

Maria João Varanda Pereira, Luís M. Alves, Adina Cocu, Sandra M. Dingli, Montse Meneses, and Ramon Vilanova. Enhancing Creative Thinking Through Gamification in LMS Environments. In 6th International Computer Programming Education Conference (ICPEC 2025). Open Access Series in Informatics (OASIcs), Volume 133, pp. 6:1-6:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{pereira_et_al:OASIcs.ICPEC.2025.6,
  author =	{Pereira, Maria Jo\~{a}o Varanda and Alves, Lu{\'\i}s M. and Cocu, Adina and Dingli, Sandra M. and Meneses, Montse and Vilanova, Ramon},
  title =	{{Enhancing Creative Thinking Through Gamification in LMS Environments}},
  booktitle =	{6th International Computer Programming Education Conference (ICPEC 2025)},
  pages =	{6:1--6:17},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-393-5},
  ISSN =	{2190-6807},
  year =	{2025},
  volume =	{133},
  editor =	{Queir\'{o}s, Ricardo and Pinto, M\'{a}rio and Portela, Filipe and Sim\~{o}es, Alberto},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICPEC.2025.6},
  URN =		{urn:nbn:de:0030-drops-240369},
  doi =		{10.4230/OASIcs.ICPEC.2025.6},
  annote =	{Keywords: Creative Thinking, Gamification, LMS, Teaching Programming}
}
Document
DOI: 10.4230/OASIcs.ICPEC.2025.7
A Generative Artificial Intelligence Tool to Correct Programming Exercises

Authors: Filipe Portela

Published in: OASIcs, Volume 133, 6th International Computer Programming Education Conference (ICPEC 2025)

Abstract
This paper presents an innovative strategy for assessing programming exercises in higher education, leveraging generative artificial intelligence (GAI) to support automated grading while ensuring transparency, fairness, and pedagogical relevance. The proposed approach is framed within the TechTeach paradigm and integrates multiple tools - HackerRank for code development, Google Forms and Sheets for submission and prompt generation, and the ChatGPT API for intelligent evaluation. The correction process is personalised using student-specific variables (e.g., student ID, birth date, performance in group work), which are dynamically embedded into the statement and prompt. The GAI algorithm evaluates the code and performs authorship verification using peer-assessed effort data, enabling the detection of potential plagiarism or misuse of AI tools. A case study was conducted in the 2023/2024 edition of the Web Programming course at the University of Minho, which involved 118 students. Results indicate that the method produced consistent and meaningful grades, reflecting a balanced perception of difficulty from students. The system also includes a gamification mechanism (Grade Rescue) for managing contested cases. The achieved findings (>90% of students approved the exercise model) support the viability of GAI-based evaluation as a scalable and effective solution for programming education, while maintaining academic integrity and enhancing the student experience.
Cite as

Filipe Portela. A Generative Artificial Intelligence Tool to Correct Programming Exercises. In 6th International Computer Programming Education Conference (ICPEC 2025). Open Access Series in Informatics (OASIcs), Volume 133, pp. 7:1-7:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{portela:OASIcs.ICPEC.2025.7,
  author =	{Portela, Filipe},
  title =	{{A Generative Artificial Intelligence Tool to Correct Programming Exercises}},
  booktitle =	{6th International Computer Programming Education Conference (ICPEC 2025)},
  pages =	{7:1--7:16},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-393-5},
  ISSN =	{2190-6807},
  year =	{2025},
  volume =	{133},
  editor =	{Queir\'{o}s, Ricardo and Pinto, M\'{a}rio and Portela, Filipe and Sim\~{o}es, Alberto},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICPEC.2025.7},
  URN =		{urn:nbn:de:0030-drops-240376},
  doi =		{10.4230/OASIcs.ICPEC.2025.7},
  annote =	{Keywords: TechTeach, Information Systems, Higher Education, Generative AI, Code Exercises}
}
  • Refine by Type
  • 49 Document/PDF
  • 11 Volume
  • 6 Document/HTML

  • Refine by Publication Year
  • 9 2025
  • 5 2023
  • 5 2022
  • 10 2021
  • 9 2020
  • Show More...

  • Refine by Author
  • 43 Simões, Alberto
  • 19 Queirós, Ricardo
  • 11 Portela, Filipe
  • 8 Pinto, Mário
  • 7 Henriques, Pedro Rangel
  • Show More...

  • Refine by Series/Journal
  • 1 LIPIcs
  • 48 OASIcs

  • Refine by Classification
  • 9 Applied computing → Education
  • 9 Computing methodologies → Natural language processing
  • 4 Computing methodologies → Language resources
  • 4 Information systems → World Wide Web
  • 4 Theory of computation → Formal languages and automata theory
  • Show More...

  • Refine by Keyword
  • 10 Preface
  • 10 Table of Contents
  • 9 Conference Organization
  • 8 Front Matter
  • 2 Frontmatter
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact