working

CV/hqn-cv.tex

@@ -76,8 +76,8 @@ \section{Employment History}
 %Buffalo}{}{}{}
 
 \section{Awards and Honors}
-\cventry{2022}{Alberto Mendelzon Test of Time Award}{(For the 2012 ``Worst-case Optimal
-Join'' paper)}{}{}{}
+\cventry{2025}{ACM Distinguished Member}{}{}{}{}
+\cventry{2022}{Alberto Mendelzon Test of Time Award}{(For the 2012 ``Worst-case Optimal Join'' paper)}{}{}{}
 \cventry{2022}{Best paper award}{PODS 2022}{}{}{}
 \cventry{2022}{{ACM SIGMOD} Research Highlights Award}{(For the {\textsf Datalogo} paper)}{}{}{}
 \cventry{2022}{Best paper award}{ICDT 2019}{}{}{}

_data/my_papers.yml

@@ -1,3 +1,8 @@
+- authors: Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs
+  title: "Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints"
+  conf: ACM SIGMOD/PODS International Conference on Management of Data
+  abbvr: PODS
+  year: 2025
 - authors: Vasileios Nakos, Hung Q. Ngo and Charalampos Tsourakakis,
   title: "Targeted Least Cardinality Candidate Key for Relational Databases"
   conf: International Conference on Database Theory

index.html

@@ -122,6 +122,10 @@ <h3>Selected talks</h3>
       <div class="container">
       <h3>Selected or Recent Papers</h3>
       <ul>
+        <li> Sungjin Im, Ben Moseley, Hung Q. Ngo, Kirk Pruhs,
+            "<em>Efficient Algorithms for Cardinality Estimation and Conjunctive Query
+                Evaluation With Simple Degree Constraints,</em>",
+           <a href="https://2025.sigmod.org/">PODS 2025</a>.
         <li> Vasileios Nakos, Hung Q. Ngo and Charalampos Tsourakakis,
             "<em>Targeted Least Cardinality Candidate Key for Relational Databases</em>"
            <a href="https://edbticdt2025.upc.edu/?contents=accepted-papers-icdt.html">ICDT 2025</a>.