◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Ana Nikolikj

16 papers hereh-index 7112 citations27 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author8
  • middle author7
  • last author1

Across the 16 of 16 papers where every author was matched, so the position is known.

fields
  • cs.LG7
  • cs.NE7
  • cs.AI1
  • cs.SD1

identity via Semantic Scholar / OpenAlex

activity
20222026
most citedAlgorithm Instance Footprint: Separating Easily Solvable and Challenging Problem Instances

8 citations · 18 across the 16 of their papers we have counts for

collaborators
Showing cs.AIShow all

1 paper · 1 filter

cs.AI2024

A Learning Search Algorithm for the Restricted Longest Common Subsequence Problem

Marko Djukanović, Jaume Reixach, Ana Nikolikj +3

This paper addresses the Restricted Longest Common Subsequence (RLCS) problem, an extension of the well-known Longest Common Subsequence (LCS) problem. This problem has significant…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.