Filetype
Doctoral student Contact details Email: katja [dot] garson [at] svet [dot] lu [dot] seOrganisation Department of Political Science Service point: 31 WebpageKatja Garsons profile in Lund University research portalOther affiliations Member of Strategic Research Area BECC: Biodiversity and Ecosystem services in a Changing ClimatePolitical ScienceMain research areasEnvironmental politicsMore-than-huma
https://www.svet.lu.se/en/katja-garson - 2026-05-07
Professor Contact details Email: kerstin [dot] svensson [at] soch [dot] lu [dot] se Phone: +46 46 222 04 61Organisation School of Social Work Room number: 427 Service point: 28 WebpageKerstin Svenssons profile in Lund University research portalOther affiliations Profile area member LU Profile Area: Human rights Professor Professions and Organisation Professor Civil Society and Social MovementsTeac
https://www.soch.lu.se/en/kerstin-svensson - 2026-05-07
Doctoral student Contact details Email: layan [dot] amouri [at] soch [dot] lu [dot] se Phone: +46 46 222 33 31Organisation School of Social Work Visiting address: Allhelgona kyrkogata 8, Lund Room number: 117 Service point: 31 WebpageLayan Amouris profile in Lund University research portalMy research project will explore how ethnic cultural associations can support the integration of newly arrived
https://www.soch.lu.se/en/layan-amouri - 2026-05-07
Professor emeritus Contact details Email: sven [dot] kristersson [at] mhm [dot] lu [dot] seOrganisation Teachers (Malmö Academy of Music) WebpageSven Kristerssons profile in Lund University research portalProfessor emeritus of Vocals Publications Displaying of publications. Sorted by year, then title. Filter by type AllBookConference paperDissertationJournal article Filter Lecture recital som mult
https://www.mhm.lu.se/en/sven-kristersson - 2026-05-07
Doctoral student I am doing research on Galactic Archeology, using Gaia to reveal the secrets of the Milky way Galaxy. Contact details Email: simon [dot] alinder [at] fysik [dot] lu [dot] seOrganisation Astrophysics Room number: A406 Service point: 14 WebpageSimon Alinders profile in Lund University research portalI am currently working on the phase spiral, a phenomenon where stars in the Milky Wa
https://www.astro.lu.se/simon-alinder - 2026-05-07
Doctoral student Contact details Email: rafael_antonio [dot] lopez [at] fysik [dot] lu [dot] seOrganisation Particle and nuclear physics Room number: K339 Service point: 14 WebpageRafael Antonio Lopez profile in Lund University research portalThe journey of nuclear physics over the past century has unraveled mysteries of celestial formations and the diversity of elements on Earth. From tapping int
https://www.particle-nuclear.lu.se/rafael-antonio-lopez - 2026-05-07
Postdoctoral fellow Contact details Email: wen [dot] pan_fagerlin [at] fek [dot] lu [dot] seOrganisation Accounting and Corporate Finance Service point: 10 WebpageWen Pan Fagerlins profile in Lund University research portal Publications Displaying of publications. Sorted by year, then title. Filter by type AllConference paperDissertationJournal article Filter The adaptation of management control s
https://www.lusem.lu.se/wen-pan-fagerlin - 2026-05-07
Postdoctoral fellow Contact details Email: alexandra [dot] huang-kokina [at] fek [dot] lu [dot] seOrganisation Organizational Studies Service point: 10 WebpageAlexandra Huang-Kokinas profile in Lund University research portal Publications Displaying of publications. Sorted by year, then title. Filter by type AllConference paper: abstractJournal article Filter Opera for the People: Exploring Artist
https://www.lusem.lu.se/alexandra-huang-kokina - 2026-05-07
https://www.lusem.lu.se/calendar/study-abroad-fair-0 - 2026-05-08
A proof system P is said to be automatable in time f(N) if there exists an algorithm that given as input an unsatisfiable formula F outputs a refutation of F in the proof system P in time f(N), where N is the size of the smallest P-refutation of F plus the size of F. Atserias and Bonet (ECCC 2002), observed that tree-like k-DNF resolution is automatable in time Nc·k log N for a universal constant
We introduce lower-bound certificates for classical planning tasks, which can be used to prove the unsolvability of a task or the optimality of a plan in a way that can be verified by an independent third party. We describe a general framework for generating lower-bound certificates based on pseudo-Boolean constraints, which is agnostic to the planning algorithm used. As a case study, we show how
