BibSonomy

The blue social bookmark and publication sharing system.

( en | de | ru )

 

user
  • tag
  • user
  • group
  • author
  • concept
  • BibTeX key
  • search
@j.c.m.janssen
  • sign in
  • register
  • groups
  • genealogy
  • popular 
    • posts
    • tags
    • authors
    • concepts
    • discussions
  • sign in
  • register

Login

Log in with your username.

@

I've lost my password.


Log in with your OpenID-Provider.

  • Other OpenID-Provider
  1. user
  2. @j.c.m.janssen
  3. Lexbfs

Publication title

bookmarks  (hide)
  • display
  • all
  • bookmarks only
  • bookmarks per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • sort by
  • added at
  • title
  • RSS
  • BibTeX
  • XML

    No matching posts.
  • ⟨⟨
  • ⟨
  • ⟩
  • ⟩⟩

publications  (hide)1  
  • display
  • all
  • publications only
  • publications per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • sort by
  • added at
  • title
  • author
  • publication date
  • entry type
  • help for advanced sorting...
  • RSS
  • BibTeX
  • RDF
  • more...

  •  

     
    2The Lexicographic Method for the Threshold Cover Problem
     

    M. Francis, and D. Jacob. (2019)cite arxiv:1912.05819Comment: 8 pages, accepted for conference CALDAM 2020.
    6 years ago by @j.c.m.janssen
    show all tags
    • Lexbfs
    • algorithnm
    • embedding
    • threshold_graphs
     
      Lexbfsalgorithnmembeddingthreshold_graphs
      (0)
      copydeleteadd this publication to your clipboard
      • community post
      • history of this post
      • URL
      • DOI
      • BibTeX
      • EndNote
      • APA
      • Chicago
      • DIN 1505
      • Harvard
      • MSOffice XML
       
       
    • ⟨⟨
    • ⟨
    • 1
    • ⟩
    • ⟩⟩

    browse

    • Lexbfs as tag from all users

    related tags

    • + | algorithnm
    • + | embedding
    • + | threshold_graphs

    concepts

    tags

    • network_analysis
    • thesis_topic
    • graph
    • 4330
    • zero_forcing
    • colouring
    • influence
    • list_colouring
    • graph_limits
    • algebraic_connectivity
    • domination
    • probabilistic_method
    • Laplacian
    • graphs
    • seminar
    • spectral_graph_theory
    • akbari
    • diffusion
    • dimension
    • graph_polynomial
    • graph_processes
    • edge_colouring
    • embedding
    • transversals
    • compression
    • spectral
    • graph_embedding
    • polytime_algorithm
    • Graph
    • polytope
    • Graph_distance
    • stable_marriage
    • lovasz_number
    • primes
    • Infinite
    • stochastic_block_model
    • algorithnm
    • matching
    • studentproject
    • alon_tarsi
    • edge_coloring
    • graph_seminar
    • matchings
    • product
    • Lexbfs
    • subgraph_sampling
    • average_parameter
    • graph_similarity
    • matrix
    • proximity
    What is BibSonomy?
    Getting Started
    Browser Buttons
    Help
    Developer
    Overview
    API Documentation
    Contact & Privacy
    Contact
    Privacy & Terms of Use
    Cookies
    Report Issues
    BibSonomy Wiki
    Integration
    PUMA
    TYPO3 Extension
    WordPress Plugin
    Java REST Client
    Supported Sites
    more
    About BibSonomy
    Team
    Blog
    Mailing List
    Social Media
     Follow us on Twitter

    BibSonomy is offered by the Data Science Chair of the University of Würzburg, the Information Processing and Analytics Group of the Humboldt-Unversität zu Berlin, the KDE Group of the University of Kassel, and the L3S Research Center.