This page lists the research symposium conducted by the Department of CSE, IIT Palakkad. The symposium is usually a full day event consisting mainly of research talks on completed or on-going research problems by the research scholars (and occasionally by faculty) of the department.
Program schedule for Research Symposium 2024
Coordinates
- When ? - 02 March, 9.00 AM to 4.00 PM
- Where ? - Room 203 and 204, Samgatha Building, Nila Campus, IIT Palakkad
- Coordinators - Kevin, Kutty Malu, Lijo, Chilanka
Talk Schedule
Time | Title | Speaker |
---|---|---|
9:00 AM - 9:10 AM | Welcome | |
9:10 AM - 9:55 AM | Invited talk 1 - Flexible list colorings: Maximizing the number of requests satisfied | Dr. Rogers Mathew |
Â | 10 minutes of Q +A | |
10:05 AM - 10:50 AM | Invited talk 2 - Some recent work on fractional intersecting families | Brahadeesh Sankarnarayanan |
Â | 10 minutes of Q +A | |
11:10 AM - 11:20 AM | Tea break | |
11:20 AM - 11:40 AM | Arborescences and Shortest Path Trees when Colors Matter | Ardra PS |
11:40 AM - 12:00 PM | Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction | Kutty Malu |
12:00 PM - 12:20 AM | Face-hitting Dominating Sets in Planar Graphs | Lijo M Jose |
12:40 PM - 1:00 PM | STGraph: A framework for temporal graph neural networks | Kevin Jude Concessao |
01:00 PM - 02:00 PM | Lunch | |
02.00 PM - 02.20 PM | Scheduling Slice Requests in 5G Networks | Dr. Albert Sunny |
02.20 PM - 02.40 PM | Tiny-VBF: Resource-Efficient Vision Transformer based Lightweight Beamformer for Ultrasound Single-Angle Plane Wave Imaging | Abdul Rahoof |
02.40 PM - 03.00 PM | Standalone Nested Loop Acceleration on CGRAs for Signal Processing Applications | Chilankamol Sunny |
03:00 PM - 04:00 PM | Interactive Session |
Invited talk 1
Abstract: In classical vertex coloring we wish to color the vertices of a graph $G$ with up to $m$ colors from $[m]$ so that adjacent vertices receive different colors, a so-called âproper $m$-coloringâ. List coloring is a well-known variation of classical vertex coloring that was introduced independently by Vizing and Erdos, Rubin, and Taylor in the 1970s. For list coloring, we associate a âlist assignmentâ $L$ with a graph $G$ such that each vertex $v$ in $G$ is assigned a list of colors $L(v)$ (we say $L$ is a list assignment for $G$). An â$L$-coloringâ of $G$ is a function $f$ with domain $V(G)$ such that $f(v)$ is a member of $L(v)$ for every vertex $v$ in $G$. We say that $G$ is â$L$-colorableâ if there exists a proper $L$-coloring of $G$: an $L$-coloring where adjacent vertices receive different colors. A list assignment $L$ for $G$ is called a â$k$-assignmentâ if $|L(v)|=k$ for each vertex $v$ in $G$. We say $G$ is â$k$-choosableâ or â$k$-list colorableâ if $G$ is $L$-colorable whenever $L$ is a $k$-assignment for $G$. The âlist chromatic numberâ of $G$ is the smallest $k$ such that $G$ is $k$-choosable.
Flexible list coloring was introduced in [Dvorak, Norin, and Postle. âList coloring with requestsâ, J.Graph Theory (2019)] in order to address a situation in list coloring where we still seek a proper list coloring, but a preferred color is given for some subset of vertices and we wish to color as many vertices in this subset with its preferred colored as possible, a flexible version of the classical precoloring extension problem. In this talk, we explore the notion of Flexible list colorings. This talk is based on the paper [Kaul, Mathew, Mudrock, and Pelsmajer. âFlexible list colorings: Maximizing the number of requests satisfiedâ, to appear in J. Graph Theory].
About the speaker: Dr. Rogers Mathew is an Associate Professor in the Department of Computer Science and Engineering, IIT Hyderabad. His research interests are in the areas of combinatorics, graph theory, and graph algorithms.
Invited talk 2
Abstract: For a fraction $\theta = a/b$ in $(0,1)$, a family $\mathcal{F}$ of subsets of $[n]$ is called a âfractional $\theta$-intersecting familyâ if, for every pair of distinct sets $A, B$ in $\mathcal{F}$, we have $|A \cap B| = \theta|A|$ or $\theta|B|$. The natural extremal question is: How large can a Î¸-intersecting family over $[n]$ be?
This notion was introduced in BalachandranâMathewâMishra (Electron. J. Combin. 26 (2019), #P2.40), wherein they showed that $|\cal{F}| \le O(n \log n)$, and they gave constructions of $\theta$-intersecting families of size at least $\Omega(n)$. The conjecture (which is still open) is whether $|\cal{F}| \le O(n)$ for any $\theta$-intersecting family $\cal{F}$ over $[n]$.
In this talk, I will discuss some recent progress on this conjecture, and some related questions concerning ranks of certain matrix ensembles, tournaments, symmetric designs, and sunflowers.
About the speaker: Brahadeesh Sankarnarayanan is a final-year PhD student at the Department of Mathematics, IIT Bombay. He has just submitted his thesis under the supervision of Prof. Niranjan Balachandran. His research interest is in extremal graph theory and combinatorics.
See here for past instances of the CSE research symposium.