BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Events - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://events.ucsc.edu
X-WR-CALDESC:Events for Events
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20270314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20271107T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260413T080000
DTEND;TZID=America/Los_Angeles:20260515T170000
DTSTAMP:20260422T175945
CREATED:20260214T011406Z
LAST-MODIFIED:20260415T142739Z
UID:10009233-1776067200-1778864400@events.ucsc.edu
SUMMARY:2026 Right Livelihood International Conference
DESCRIPTION:The Right Livelihood International Conference is a five-week global conference exploring how education can strengthen democracy\, collective intelligence\, and just futures. Bringing together Right Livelihood Laureates\, students\, faculty\, and community partners across continents\, the conference combines asynchronous learning with participatory dialogue and collaborative action. Rather than advocating specific outcomes\, the conference positions education as a democratic practice and the Right Livelihood College as a steward of dialogue\, student voice\, and long-term institutional learning. \nRegistration is free and open to the public. Sign up to receive conference updates\, session links\, and participation opportunities.
URL:https://events.ucsc.edu/event/2026-right-livelihood-international-conference/
LOCATION:
CATEGORIES:Film Screening,Lectures & Presentations,Meetings & Conferences,Ph.D. Presentations,Seminars,Social Gathering,Training,Undergraduate,Workshop
ATTACH;FMTTYPE=image/png:https://events.ucsc.edu/wp-content/uploads/2026/02/World-with-dots.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260512T100000
DTEND;TZID=America/Los_Angeles:20260512T120000
DTSTAMP:20260422T175945
CREATED:20260421T160759Z
LAST-MODIFIED:20260421T160759Z
UID:10013625-1778580000-1778587200@events.ucsc.edu
SUMMARY:Chen\, Q. (CSE) - New Approximation and Online Algorithms using Novel Combinatorial Structures
DESCRIPTION:Most optimization problems face the challenge of computing an optimum solution requiring superpolynomial time. In particular\, they are classified as NP-hard problems that have no polynomial-time algorithm to date. Instead\, computer scientists turn to find an approximate solution and create numerous elegant algorithms. However\, in the modern era\, computational environments have changed drastically\, and we are not able to afford to design new algorithms for each new problem via repeated trial and error. Therefore\, systematic ways to understand the possibilities and limitations of these problems are desired. This dissertation studies several central combinatorial optimization problems\, focusing on understanding the key structural obstacles and developing unified frameworks. Mainly\, we study two types of combinatorial optimization problems:\n(1) Scheduling. The problem is associated with limited resources\, and our target is to find an allocation method to complete all jobs over time that minimizes the overall budget cost.\n(2) Network Design. Different from scheduling problems. In this problem\, we aim to find a minimum-cost topological network that supports routing for demanding communications. \nOur first work is focused on a group-to-group survivable network design problem that generalizes the classic point-to-point network to support routing between any pair of subsets of nodes. Previous research stops at limited faults\, and the difficulty comes from the way to compress the graph into a tree. We propose a new framework via capacitated tree embeddings against arbitrary faults in the network\, which gives the first polylogarithmic approximation algorithm. Further\, this framework captures nearly all the recent models proposed in the area. \nIn contrast to the offline optimization problems mentioned above\, online algorithms are natural adaptations that have been found in tremendous real applications. In online algorithms\, the algorithm wants to compete against arbitrary uncertainty\, which means the instance is unknown at first and revealed over time. We study various scheduling problems and focus on some important metrics – average flow time\, which measures the average time a job stays in the system from its arrival to completion. Real-world demands give online scheduling problems enormously different settings. Computer scientists need to repeat errors and trials to find a provably good solution. We find the key required combinatorial property is supermodularity for the residual objective\, which measures the average completion time for all alive jobs assuming they have the same arrival time. Further\, we relate supermodularity with gross-substitute/linear-substitute (GS/LS)\, which is a well-studied definition in economics. Finally\, we propose a meta-algorithm that solves all captured problems in one shot. In the end\, we revisit the proportional fairness (PF) algorithm for $L_p$-norms of flow time. By reinterpreting the previous potential function and the corresponding Fisher market\, we show that PF is competitive. \n  \nEvent Host: Qingyun Chen\, Ph.D. Candidate\, Computer Science & Engineering  \nAdvisor: Sungjin Im \nZoom: https://ucsc.zoom.us/j/92628493495?pwd=iJq8YwarrYyofPLF4AmZpwzsZnLyvt.1 \n 
URL:https://events.ucsc.edu/event/chen-q-cse-new-approximation-and-online-algorithms-using-novel-combinatorial-structures-2/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Ph.D. Presentations
ATTACH;FMTTYPE=image/jpeg:https://events.ucsc.edu/wp-content/uploads/2026/04/ph.d.-presentation-graphic-option2.jpg
GEO:37.0009723;-122.0632371
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Engineering 2 Engineering 2 1156 High Street Santa Cruz CA 95064;X-APPLE-RADIUS=500;X-TITLE=Engineering 2 1156 High Street:geo:-122.0632371,37.0009723
END:VEVENT
END:VCALENDAR