render tex

latex/main.tex

@@ -23,49 +23,32 @@
 \setlength{\parskip}{0.6em}
 \linespread{1.08}
 
-\title{Predicting Dijkstra Runtime from Graph Properties:\\
-An Operation-Decomposed Model with Binary Heap}
-% \author{Seungjun Lee}
-% \date{May 2026}
-
-
-
 \begin{document}
 
-% \maketitle
-
 \begin{titlepage}
     \centering
+    \vspace*{\fill}
 
-    \vspace*{2cm}
+    % Title
+    {\Huge\bfseries Predicting Dijkstra Runtime\\[0.3em]
+     from Graph Properties\par}
 
-    {\large\scshape Extended Essay\par}
+    \vspace{0.8cm}
+
+    % Subtitle
+    {\Large An Operation-Decomposed Model with Binary Heap\par}
+
+    \vspace{10cm}
+
+    % Author
+    {\large\scshape Seungjun Lee\par}
 
     \vspace{0.4cm}
-    {\large\scshape Subject: Computer Science\par}
 
-    \vspace{2.5cm}
+    % Date
-
+    {\large April 14, 2026\par}
-    {\LARGE\bfseries Predicting Dijkstra Runtime from Graph Properties:\par}
-    \vspace{0.3cm}
-    {\LARGE\bfseries An Operation-Decomposed Model with Binary Heap\par}
-
-    \vspace{2cm}
-
-    {\large\itshape Research Question\par}
-    \vspace{0.4cm}
-    \begin{minipage}{0.8\textwidth}
-        \centering
-        {\large Can the runtime of Dijkstra's algorithm with a binary heap\\
-        be predicted from observable graph properties alone?\par}
-    \end{minipage}
-
-    \vfill
-
-    {\large Word Count: 2{,}759\par}
-
-    \vspace{1.5cm}
 
+    \vspace*{\fill}
 \end{titlepage}
 
 % \begin{abstract}